TY - BOOK AU - AU - AU - ED - SpringerLink (Online service) TI - Fun with Algorithms: 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007. Proceedings T2 - Lecture Notes in Computer Science, SN - 9783540729143 AV - Libro electrónico U1 - 005.1 23 PY - 2007/// CY - Berlin, Heidelberg PB - Springer Berlin Heidelberg KW - Computer science KW - Data structures (Computer science) KW - Computer software KW - Computational complexity KW - Computer graphics KW - Computer Science KW - Algorithm Analysis and Problem Complexity KW - Data Structures KW - Computation by Abstract Devices KW - Discrete Mathematics in Computer Science KW - Computer Graphics N1 - 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 SpoonerismProblem -- 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 DesignA 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; ZDB-2-SCS; ZDB-2-LNC UR - http://dx.doi.org/10.1007/978-3-540-72914-3 ER -