Fun with Algorithms
(Sprache: Englisch)
This book constitutes the refereed proceedings of the 4th International Conference on Fun with Algorithms, FUN 2007, held in Castiglioncello, Italy in June 2007. It details the use, design, and analysis of algorithms and data structures, focusing on...
Leider schon ausverkauft
versandkostenfrei
Buch
74.99 €
Produktdetails
Produktinformationen zu „Fun with Algorithms “
Klappentext zu „Fun with Algorithms “
This book constitutes the refereed proceedings of the 4th International Conference on Fun with Algorithms, FUN 2007, held in Castiglioncello, Italy in June 2007. It details 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.
Inhaltsverzeichnis zu „Fun with Algorithms “
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features.- Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs.- Fun with Sub-linear Time Algorithms.- Wooden Geometric Puzzles: Design and Hardness Proofs.- HIROIMONO Is NP-Complete.- Tablatures for Stringed Instruments and Generating Functions.- Knitting for Fun: A Recursive Sweater.- Pictures from Mongolia - Partial Sorting in a Partial World.- Efficient Algorithms for the Spoonerism Problem.- High Spies (or How to Win a Programming Contest).- Robots and Demons (The Code of the Origins).- The Traveling Beams Optical Solutions for Bounded NP-Complete Problems.- The Worst Page-Replacement Policy.- Die Another Day.- Approximating Rational Numbers by Fractions.- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms.- The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake.- Drawing Borders Efficiently.- The Ferry Cover Problem.- Web Marshals Fighting Curly Link Farms.- Intruder Capture in Sierpi?ski Graphs.- On the Complexity of the Traffic Grooming Problem in Optical Networks.
Bibliographische Angaben
- 2007, X, 271 Seiten, mit Abbildungen, Maße: 15,7 x 23,8 cm, Kartoniert (TB), Englisch
- Herausgegeben: Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci
- Verlag: Springer Berlin
- ISBN-10: 3540729135
- ISBN-13: 9783540729136
- Erscheinungsdatum: 24.05.2007
Sprache:
Englisch
Kommentar zu "Fun with Algorithms"
0 Gebrauchte Artikel zu „Fun with Algorithms“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Fun with Algorithms".
Kommentar verfassen