| Description |
1 online resource (ix, 382 pages) : illustrations |
| Series |
Lecture notes in computer science ; 6099 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6099.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Fun with olympiad in algorithmics (invited talk) / Roberto Grossi, Alessio Orlandi, and Giuseppe Ottaviano -- The FUNnest talks that belong to FUN (abstract) (invited talk) / Prabhakar Raghavan -- Fun with games (invited talk) / Paul G. Spirakis, Ioannis Chatzigiannakis, Georgios Mylonas, and Panagiota N. Panagopoulou -- Do we need a stack to erase a component in a binary image? / Tetsuo Asano -- Kaboozle is NP-complete, even in a strip / Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara -- A hat trick / Oren Ben-Zwi and Guy Wolfovitz -- Fun at a department store : data mining meets switching theory / Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, and Linda Pagli -- Using cell phone keyboards is (NP) hard / Peter Boothe -- Urban hitchhiking / Marco Bressan and Enoch Peserico -- A fun application of compact data structures to indexing geographic data / Nieves R. Brisaboa, Miguel R. Luaces, Gonzalo Navarro, and Diego Seco -- On table arrangements, scrabble freaks, and jumbled pattern matching / Péter Burcsi, Ferdinando Cicalese, Gabriele Fici, and Zsuzsanna Lipták -- Cryptographic and physical zero-knowledge proof : from Sudoku to Nonogram / Yu-Feng Chien and Wing-Kai Hon -- A better bouncer's algorithm / Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanič, and Eberhard Triesch -- Tradeoffs in process strategy games with application in the WDM reconfiguration problem / Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, and Nicolas Nisse -- UNO is hard, even for a single player / Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, and Yushi Uno -- Leveling-up in Heroes of Might and Magic III / Dimitrios I. Diochnos -- The magic of a number system / Amr Elmasry, Claus Jensen, and Jyrki Katajainen -- Bit-(parallelism)² : getting to the next level of parallelism / Domenico Cantone, Simone Faro, and Emanuele Giaquinta -- An algorithmic analysis of the Honey-Bee game / Rudolf Fleischer and Gerhard J. Woeginger -- Mapping an unfriendly subway system / Paola Flocchini, Matthew Kellett, Peter C. Mason, and Nicola Santoro -- Cracking bank PINs by playing Mastermind / Riccardo Focardi and Flaminia L. Luccio -- Computational complexity of two-dimensional platform games / Michal Forišek -- Christmas gift exchange games / Arpita Ghosh and Mohammad Mahdian -- Return of the boss problem : competing online against a non-adaptive adversary / Magnús M. Halldórsson and Hadas Shachnai -- Managing change in the era of the iPhone / Patrick Healy -- The computational complexity of RaceTrack / Markus Holzer and Pierre McKenzie -- Simple wriggling is hard unless you are a fat hippo / Irina Kostitsyna and Valentin Polishchuk -- The urinal problem / Evangelos Kranakis and Danny Krizanc -- Fighting censorship with algorithms / Mohammad Mahdian -- The complexity of flood filling games / David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, and Benjamin Sach -- The computational complexity of the Kakuro puzzle, revisited / Oliver Ruepp and Markus Holzer -- Symmetric monotone Venn diagrams with seven curves / Tao Cao, Khalegh Mamakani, and Frank Ruskey -- The feline Josephus problem / Frank Ruskey and Aaron Williams -- Scheduling with bully selfish jobs / Tami Tamir -- O(1)-time unsorting by prefix-reversals in a boustrophedon linked list / Aaron Williams |
| Summary |
Annotation This book constitutes the proceedings of the 5th International Conference, FUN 2010, held in June 2010 in Ischia, Italy. FUN with algorithms is a three-yearly conference that aims at atractings works which, besides a deep and interesting algorithmic content, also present amusing and fun aspects. The 32 full papers and 3 invited talks are carefully selected from 54 submissions and focus on topics such as distributed algorithms, graph computations, parallelism, zero-knowledge proof, iphone, pattern matching and strategy games |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
Print version record |
| In |
Springer eBooks |
| Subject |
Algorithms -- Congresses
|
|
Algorithms
|
|
algorithms.
|
|
Informatique.
|
|
Algorithms
|
|
Algorithmus
|
|
Komplexitätstheorie
|
|
Datenstruktur
|
|
Ischia <2010>
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Boldi, Paolo.
|
|
Gargano, Luisa
|
| LC no. |
2010926872 |
| ISBN |
9783642131226 |
|
3642131220 |
|
