000 04326nam a22005535i 4500
001 978-3-319-07890-8
003 DE-He213
005 20200421111655.0
007 cr nn 008mamaa
008 140528s2014 gw | s |||| 0|eng d
020 _a9783319078908
_9978-3-319-07890-8
024 7 _a10.1007/978-3-319-07890-8
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aFun with Algorithms
_h[electronic resource] :
_b7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings /
_cedited by Alfredo Ferro, Fabrizio Luccio, Peter Widmayer.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXII, 378 p. 141 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8496
505 0 _aAlgorithmic 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 _aThis 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 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aData Structures.
700 1 _aFerro, Alfredo.
_eeditor.
700 1 _aLuccio, Fabrizio.
_eeditor.
700 1 _aWidmayer, Peter.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319078892
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8496
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-07890-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54638
_d54638