( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Computational Complexity of Portal and Other 3D Video Games.

, , и . CoRR, (2016)

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.

Nilgün Erikli

Anders Erikson

Magdalena Karin Matilda Eriksson

Max-Peter Eriksen

Elina Eriksson

 

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

The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications., и . ICALP, том 2380 из Lecture Notes in Computer Science, стр. 401-413. Springer, (2002)An end-to-end approach to making self-folded 3D surface shapes by uniform heating., , , , , , , , и . ICRA, стр. 1466-1473. IEEE, (2014)Meshes Preserving Minimum Feature Size., , , , и . EGC, том 7579 из Lecture Notes in Computer Science, стр. 258-273. Springer, (2011)Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams., , , , , , и . LATIN, том 3887 из Lecture Notes in Computer Science, стр. 80-92. Springer, (2006)Bumpy Pyramid Folding., , , , , и . CCCG, Carleton University, Ottawa, Canada, (2014)Computing 3SAT on a Fold-and-Cut Machine., , , и . CCCG, стр. 208-213. (2017)Locked and Unlocked Chains of Planar Shapes., , , , , , , и . Discret. Comput. Geom., 44 (2): 439-462 (2010)Geometric folding algorithms - linkages, origami, polyhedra., и . Cambridge University Press, (2007)Open Problems from CCCG 2009, и . Proceedings of the 21st Canadian Conference on Computational Geometry, Winnipeg, Manitoba, (2010)To appear..On universally easy classes for NP-complete problems., , и . SODA, стр. 910-911. ACM/SIAM, (2001)