( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.

, , , , , , и . Algorithmica, 50 (2): 279-298 (2008)

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

 

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

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch, , , , и . SIAM J. Comput., 48 (6): 1727--1762 (2019)Area-Optimal Simple Polygonalizations: The CG Challenge 2019, , , , и . CoRR, (2021)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , и . Graphs Comb., 36 (2): 251-267 (2020)A Novel Routing Algorithm for k-Ary n-Cube Interconnection Networks., и . Int. J. High Speed Comput., 8 (1): 81-92 (1996)Online searching with turn cost., , и . Theor. Comput. Sci., 361 (2-3): 342-355 (2006)Classic Nintendo games are (computationally) hard., , , и . Theor. Comput. Sci., (2015)Area-Optimal Simple Polygonalizations: The CG Challenge 2019., , , , и . ACM J. Exp. Algorithmics, (2022)Complexity of Solo Chess with Unlimited Moves., , , , , и . CoRR, (2023)An end-to-end approach to making self-folded 3D surface shapes by uniform heating., , , , , , , , и . ICRA, стр. 1466-1473. IEEE, (2014)Basic network creation games., , , и . SPAA, стр. 106-113. ACM, (2010)