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 Solving the Rubik's Cube Optimally is NP-complete Demaine, Erik D. et al. 2018
3 Origamizer: A Practical Algorithm for Folding Any Polyhedron Demaine, Erik D. et al. 2017
4 Front Matter, Table of Contents, Preface, Conference Organization Demaine, Erik D. et al. 2016
5 LIPIcs, Volume 49, FUN'16, Complete Volume Demaine, Erik D. et al. 2016
6 Super Mario Bros. is Harder/Easier Than We Thought Demaine, Erik D. et al. 2016
7 The Complexity of Hex and the Jordan Curve Theorem Adler, Aviv et al. 2016
8 The Fewest Clues Problem Demaine, Erik D. et al. 2016
9 Who Needs Crossings? Hardness of Plane Graph Rigidity Abel, Zachary et al. 2016
10 Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals Becker, Aaron T. et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 20


DROPS-Home | Fulltext Search | Imprint Published by LZI