Volume 54, Issue 4

Search all Theory of Computing Systems articles

May 2014

Fun with Algorithms

Issue Editors:

Evangelos Kranakis,
DANNY KRIZANC,
Flaminia Luccio

11 articles in this issue

Editorial: Fun with Algorithms
Evangelos Kranakis
Danny Krizanc
Flaminia Luccio
EditorialNotes 20 September 2013 Pages: 529 - 530
Picture-Hanging Puzzles
Erik D. Demaine
Martin L. Demaine
Mihai Pǎtraşcu
OriginalPaper 13 September 2013 Pages: 531 - 550
The Coolest Way to Generate Binary Strings
Brett Stevens
Aaron Williams
OriginalPaper 03 July 2013 Pages: 551 - 577
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions
Ferdinando Cicalese
OriginalPaper 27 June 2013 Pages: 578 - 594
Gaming Is a Hard Job, but Someone Has to Do It!
Giovanni Viglietta
OriginalPaper 31 August 2013 Pages: 595 - 621
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors
Stefan Dobrev
Lata Narayanan
Jaroslav Opatrny
OriginalPaper 09 June 2013 Pages: 622 - 639
Computational Aspects of M.C. Escher’s Ribbon Patterns
Ellen Gethner
David G. Kirkpatrick
Nicholas J. Pippenger
OriginalPaper 29 May 2013 Pages: 640 - 658
Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set
Kevin J. Lang
OriginalPaper 31 August 2013 Pages: 659 - 688
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
Helmut Alt
Esther M. Arkin
Valentin Polishchuk
OriginalPaper 14 August 2013 Pages: 689 - 714
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye
Michael A. Bender
Ritwik Bose
Samuel McCauley
OriginalPaper 25 May 2013 Pages: 715 - 730
Spanning Trees and the Complexity of Flood-Filling Games
Kitty Meeks
Alexander Scott
OriginalPaper 04 June 2013 Pages: 731 - 753

Volume 54, Issue 4

Search

Navigation