| Description |
1 online resource (xii, 378 pages) : illustrations |
| Series |
Lecture Notes in Computer Science, 0302-9743 ; 8496 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 8496. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Algorithmic Gems in the Data Miner's Cave.-Fun with Fonts: Algorithmic Typography.-Happy Edges: Threshold-Coloring of Regular Lattices.-Classic Nintendo Games Are (Computationally) Hard.-On the Solvability of the Six Degrees of Kevin Bacon Game -- A Faster Graph Diameter and Radius Computation Method.-No Easy Puzzles: A Hardness Result for Jigsaw Puzzles.-Normal, Abby Normal, Prefix Normal.-Nonconvex Cases for Carpenter's Rulers.-How to Go Viral: Cheaply and Quickly -- Synchronized Dancing of Oblivious Chameleons.-Another Look at the Shoelace TSP: The Case of Very Old Shoes -- Playing Dominoes Is Hard, Except by Yourself.-UNO Gets Easier for a Single Player -- Secure Auctions without Cryptography.-Towards an Algorithmic Guide to Spiral Galaxies -- Competitive Analysis of the Windfall Game.-Excuse Me! or The Courteous Theatregoers' Problem.-Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives.-Approximability of Latin Square Completion-Type Puzzles.-Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.-Quell.-How Even Tiny Influence Can Have a Big Impact.-Optimizing Airspace Closure with Respect to Politicians' Egos -- Being Negative Makes Life NP-hard (for Product Sellers).-Clearing Connections by Few Agents.-Counting Houses of Pareto Optimal Matchings in the House Allocation Problem -- Practical Card-Based Cryptography.-The Harassed Waitress Problem.-Lemmings Is PSPACE-Complete.-Finding Centers and Medians of a Tree by Distance Queries.-Swapping Labeled Tokens on Graphs |
| Summary |
This book constitutes the refereed proceedings of the 7th International Conference, FUN 2014, held in July 2014 in Lipari Island, Sicily, Italy. The 29 revised full papers were carefully reviewed and selected from 49 submissions. They feature a large variety of topics in the field of the use, design and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area. In particular, algorithmic questions rooted in biology, cryptography, game theory, graphs, the internet, robotics and mobility, combinatorics, geometry, stringology, as well as space-conscious, randomized, parallel, distributed algorithms and their visualization are addressed |
| Notes |
International conference proceedings |
|
Includes author index |
|
English |
|
Online resource; title from PDF title page (SpringerLink, viewed June 9, 2014) |
| In |
Springer eBooks |
| Subject |
Computer algorithms -- Congresses
|
|
Data structures (Computer science) -- Congresses
|
|
Artificial intelligence.
|
|
Software
|
|
Artificial Intelligence
|
|
software.
|
|
artificial intelligence.
|
|
Computer algorithms
|
|
Data structures (Computer science)
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Ferro, Alfredo, editor.
|
|
Luccio, Fabrizio, 1938- editor.
|
|
Widmayer, Peter, editor.
|
| ISBN |
9783319078908 |
|
3319078909 |
|
3319078895 |
|
9783319078892 |
|
