Fun with Algorithms 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings /

Bibliographic Details
Call Number:Libro Electrónico
Corporate Author: SpringerLink (Online service)
Other Authors: Crescenzi, Pierluigi (Editor), Prencipe, Giuseppe (Editor), Pucci, Geppino (Editor)
Format: Electronic eBook
Language:Inglés
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edition:1st ed. 2007.
Series:Theoretical Computer Science and General Issues, 4475
Subjects:
Software engineering.
Algorithms.
Artificial intelligence-Data processing.
Computer science.
Computer science-Mathematics.
Discrete mathematics.
Computer graphics.
Software Engineering.
Data Science.
Theory of Computation.
Discrete Mathematics in Computer Science.
Computer Graphics.
Online Access:Texto Completo
Table of 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.

Similar Items