LEADER 04860nam  22009375  450 
001 9910767562903321
005 20251226195449.0
010   $a1-280-94387-4
010   $a9786610943876
010   $a3-540-72914-3
024 7 $a10.1007/978-3-540-72914-3
035   $a(CKB)1000000000490599
035   $a(EBL)3061556
035   $a(SSID)ssj0000297060
035   $a(PQKBManifestationID)11243523
035   $a(PQKBTitleCode)TC0000297060
035   $a(PQKBWorkID)10332773
035   $a(PQKB)10299191
035   $a(DE-He213)978-3-540-72914-3
035   $a(MiAaPQ)EBC3061556
035   $a(MiAaPQ)EBC6743283
035   $a(Au-PeEL)EBL6743283
035   $a(OCoLC)184904992
035   $a(PPN)123162815
035   $a(BIP)14224977
035   $a(EXLCZ)991000000000490599
100   $a20100301d2007      u|         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aFun with Algorithms $e4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings /$fedited by Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (280 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4475
300   $aIncludes index.
311 08$a3-540-72913-5 
320   $aIncludes bibliographical references and index.
327   $aOn 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.
330   $aThis book constitutes the refereed proceedings of the 4th International Conference on Fun with Algorithms, FUN 2007, held in Castiglioncello, Italy in June 2007, co-located with the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2007). The 20 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 41 submissions. The papers are dedicated to 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4475
606   $aSoftware engineering
606   $aAlgorithms
606   $aArtificial intelligence$xData processing
606   $aComputer science
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aComputer graphics
606   $aSoftware Engineering
606   $aAlgorithms
606   $aData Science
606   $aTheory of Computation
606   $aDiscrete Mathematics in Computer Science
606   $aComputer Graphics
615  0$aSoftware engineering.
615  0$aAlgorithms.
615  0$aArtificial intelligence$xData processing.
615  0$aComputer science.
615  0$aComputer science$xMathematics.
615  0$aDiscrete mathematics.
615  0$aComputer graphics.
615 14$aSoftware Engineering.
615 24$aAlgorithms.
615 24$aData Science.
615 24$aTheory of Computation.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aComputer Graphics.
676   $a005.1
686   $a31.80$2bcl
702   $aPrencipe$b Giuseppe$f1972-
702   $aPucci$b Geppino
702   $aCrescenzi$b Pierluigi
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910767562903321
996   $aFun with Algorithms$9772446
997   $aUNINA