( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A linear lower bound on index size for text retrieval.

, и . SODA, стр. 289-294. ACM/SIAM, (2001)

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

 

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

Optimal Covering Tours with Turn Costs, , , , , и . (июня 2005)Solving the Rubik's Cube Optimally is NP-complete., , и . CoRR, (2017)The complexity of UNO, , , , и . CoRR, (2010)Efficient constant-velocity reconfiguration of crystalline robots., , , , , , , , , и 1 other автор(ы). Robotica, 29 (1): 59-71 (2011)Basic network creation games., , , и . SPAA, стр. 106-113. ACM, (2010)Folding and Unfolding Linkages, Paper, and Polyhedra.. JCDCG, том 2098 из Lecture Notes in Computer Science, стр. 113-124. Springer, (2000)Linear Reconfiguration of Cube-Style Modular Robots., , , , , , , , , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 208-219. Springer, (2007)On universally easy classes for NP-complete problems., , и . SODA, стр. 910-911. ACM/SIAM, (2001)Open Problems from CCCG 2009, и . Proceedings of the 21st Canadian Conference on Computational Geometry, Winnipeg, Manitoba, (2010)To appear..Geometric folding algorithms - linkages, origami, polyhedra., и . Cambridge University Press, (2007)