Sciweavers

FUN
2007
Springer
169views Algorithms» more  FUN 2007»
14 years 1 months ago
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
This paper is devoted to the “Discovery of Slowness.” The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with ele...
Hermann Gruber, Markus Holzer, Oliver Ruepp
FUN
2007
Springer
120views Algorithms» more  FUN 2007»
14 years 3 months ago
Drawing Borders Efficiently
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
14 years 3 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
FUN
2007
Springer
85views Algorithms» more  FUN 2007»
14 years 3 months ago
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ri...
FUN
2007
Springer
82views Algorithms» more  FUN 2007»
14 years 3 months ago
The Worst Page-Replacement Policy
In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of mi...
Kunal Agrawal, Michael A. Bender, Jeremy T. Finema...
FUN
2007
Springer
78views Algorithms» more  FUN 2007»
14 years 5 months ago
Wooden Geometric Puzzles: Design and Hardness Proofs
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
Helmut Alt, Hans L. Bodlaender, Marc J. van Krevel...
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
14 years 5 months ago
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Ro...
FUN
2007
Springer
98views Algorithms» more  FUN 2007»
14 years 5 months ago
Die Another Day
The Hydra was a many-headed monster from Greek mythology that would immediately replace a head that was cut off by one or two new heads. It was the ask of Hercules to kill this mon...
Rudolf Fleischer
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
14 years 5 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
FUN
2007
Springer
87views Algorithms» more  FUN 2007»
14 years 5 months ago
Knitting for Fun: A Recursive Sweater
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm th...
Anna Bernasconi, Chiara Bodei, Linda Pagli