No. Title Author Year
1 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
2 Origamizer: A Practical Algorithm for Folding Any Polyhedron Demaine, Erik D. et al. 2017
3 Front Matter, Table of Contents, Preface, Conference Organization Demaine, Erik D. et al. 2016
4 LIPIcs, Volume 49, FUN'16, Complete Volume Demaine, Erik D. et al. 2016
5 Super Mario Bros. is Harder/Easier Than We Thought Demaine, Erik D. et al. 2016
6 The Complexity of Hex and the Jordan Curve Theorem Adler, Aviv et al. 2016
7 The Fewest Clues Problem Demaine, Erik D. et al. 2016
8 Who Needs Crossings? Hardness of Plane Graph Rigidity Abel, Zachary et al. 2016
9 Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals Becker, Aaron T. et al. 2015
10 Algorithms for Designing Pop-Up Cards Abel, Zachary et al. 2013
Current Page :
Number of result pages: 2
Number of documents: 19


DROPS-Home | Fulltext Search | Imprint Published by LZI