No. Title Author Year
1 Computational Complexity of Generalized Push Fight Bosboom, Jeffrey et al. 2018
2 Computational Complexity of Motion Planning of a Robot through Simple Gadgets Demaine, Erik D. et al. 2018
3 Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch Demaine, Erik D. et al. 2018
4 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
5 Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures Chen, Lijie et al. 2018
6 Solving the Rubik's Cube Optimally is NP-complete Demaine, Erik D. et al. 2018
7 The Computational Complexity of Portal and Other 3D Video Games Demaine, Erik D. et al. 2018
8 Tree-Residue Vertex-Breaking: a new tool for proving hardness Demaine, Erik D. et al. 2018
9 Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Abel, Zachary et al. 2018
10 Origamizer: A Practical Algorithm for Folding Any Polyhedron Demaine, Erik D. et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 27


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI