( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ...

, , , , , , и . J. Inf. Process., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Nabil Sarah

Sarah Wagner

Sarah Nietzer

Sarah Schneider

Sarah Babian

 

Другие публикации лиц с тем же именем

Learning Regular Languages via Alternating Automata., , и . IJCAI, стр. 3308-3314. AAAI Press, (2015)Finding the limit: examining the potential and complexity of compilation scheduling for JIT-based runtime systems., , , , и . ASPLOS, стр. 607-622. ACM, (2014)Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM., , , , , , , и . STACS, том 20 из LIPIcs, стр. 172-184. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Free Edge Lengths in Plane Graphs., , , , , , , и . Discret. Comput. Geom., 54 (1): 259-289 (2015)On the learnability of shuffle ideals., , , и . J. Mach. Learn. Res., 14 (1): 1513-1531 (2013)Finding a Hamiltonian Path in a Cube with Specified Turns is Hard., , , , , и . J. Inf. Process., 21 (3): 368-377 (2013)Who Needs Crossings? Hardness of Plane Graph Rigidity., , , , , и . SoCG, том 51 из LIPIcs, стр. 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Solving the Rubik's Cube Optimally is NP-complete., , и . CoRR, (2017)Flattening Fixed-Angle Chains Is Strongly NP-Hard., и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 314-325. Springer, (2011)Algorithms for Solving Rubik's Cubes., , , , и . ESA, том 6942 из Lecture Notes in Computer Science, стр. 689-700. Springer, (2011)