Skip to main content
  • Conference proceedings
  • © 2007

Fun with Algorithms

4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4475)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): FUN: International Conference on Fun with Algorithms

Conference proceedings info: FUN 2007.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (23 papers)

  1. Front Matter

  2. On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features

    • Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
    Pages 1-13
  3. Fun with Sub-linear Time Algorithms

    • Luca Trevisan
    Pages 15-15
  4. Wooden Geometric Puzzles: Design and Hardness Proofs

    • Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
    Pages 16-29
  5. HIROIMONO Is NP-Complete

    • Daniel Andersson
    Pages 30-39
  6. Tablatures for Stringed Instruments and Generating Functions

    • Davide Baccherini, Donatella Merlini, Renzo Sprugnoli
    Pages 40-52
  7. Knitting for Fun: A Recursive Sweater

    • Anna Bernasconi, Chiara Bodei, Linda Pagli
    Pages 53-65
  8. Pictures from Mongolia – Partial Sorting in a Partial World

    • Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna
    Pages 66-77
  9. Efficient Algorithms for the Spoonerism Problem

    • Hans-Joachim Böckenhauer, Juraj Hromkovič, Richard Královič, Tobias Mömke, Kathleen Steinhöfel
    Pages 78-92
  10. High Spies (or How to Win a Programming Contest)

    • André Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom
    Pages 93-107
  11. Robots and Demons (The Code of the Origins)

    • Yoann Dieudonné, Franck Petit
    Pages 108-119
  12. The Worst Page-Replacement Policy

    • Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
    Pages 135-145
  13. Die Another Day

    • Rudolf Fleischer
    Pages 146-155
  14. Approximating Rational Numbers by Fractions

    • Michal Forišek
    Pages 156-165
  15. Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles

    • Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
    Pages 166-182
  16. Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms

    • Hermann Gruber, Markus Holzer, Oliver Ruepp
    Pages 183-197
  17. Drawing Borders Efficiently

    • Kazuo Iwama, Eiji Miyano, Hirotaka Ono
    Pages 213-226

Other Volumes

  1. Fun with Algorithms

Editors and Affiliations

  • Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Firenze, Italy

    Pierluigi Crescenzi

  • Dipartimento di Informatica, Università degli Studi di Pisa, Pisa, Italy

    Giuseppe Prencipe

  • Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Padova, Padova, Italy

    Geppino Pucci

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access