Fun with Algorithms 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings /

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...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Ferro, Alfredo. (Editor, http://id.loc.gov/vocabulary/relators/edt), Luccio, Fabrizio. (Editor, http://id.loc.gov/vocabulary/relators/edt), Widmayer, Peter. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2014.
Edition:1st ed. 2014.
Series:Theoretical Computer Science and General Issues ; 8496
Subjects:
Online Access:https://doi.org/10.1007/978-3-319-07890-8
LEADER 04856nam a22005655i 4500
001 978-3-319-07890-8
003 DE-He213
005 20210624181608.0
007 cr nn 008mamaa
008 140528s2014 gw | s |||| 0|eng d
020 |a 9783319078908  |9 978-3-319-07890-8 
024 7 |a 10.1007/978-3-319-07890-8  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Fun with Algorithms  |h [electronic resource] :  |b 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings /  |c edited by Alfredo Ferro, Fabrizio Luccio, Peter Widmayer. 
250 |a 1st ed. 2014. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2014. 
300 |a XII, 378 p. 141 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues ;  |v 8496 
505 0 |a 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. 
520 |a 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. 
650 0 |a Algorithms. 
650 0 |a Computer science—Mathematics. 
650 0 |a Artificial intelligence. 
650 0 |a Data structures (Computer science). 
650 1 4 |a Algorithm Analysis and Problem Complexity.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I16021 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I17028 
650 2 4 |a Artificial Intelligence.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I21000 
650 2 4 |a Data Structures.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I15017 
700 1 |a Ferro, Alfredo.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Luccio, Fabrizio.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Widmayer, Peter.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319078915 
776 0 8 |i Printed edition:  |z 9783319078892 
830 0 |a Theoretical Computer Science and General Issues ;  |v 8496 
856 4 0 |u https://doi.org/10.1007/978-3-319-07890-8 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)