1 option
Fun with Algorithms : 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings / edited by Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4475.
- Theoretical Computer Science and General Issues ; 4475
- Language:
- English
- Subjects (All):
- Software engineering.
- Algorithms.
- Data structures (Computer science).
- Computers.
- Computer science--Mathematics.
- Computer science.
- Computer graphics.
- Software Engineering/Programming and Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Computation by Abstract Devices.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Computation by Abstract Devices.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Physical Description:
- 1 online resource (X, 273 pages).
- Edition:
- First edition 2007.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-72914-3
- 9783540729143
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.