( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Simple Yet Effective Balanced Edge Partition Model for Parallel Computing.

, , , , , , и . SIGMETRICS (Abstracts), стр. 6. ACM, (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.

Christian Szegedy

Simone Marion

Ernst Marioth-Wirtz

Martin Marioth

Anneliese Marioth

 

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

Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract)., и . STOC, стр. 561-570. ACM, (1996)On the Complexity of RAM with Various Operation Sets, и . STOC, стр. 624-631. ACM, (1992)Long Monotone Paths in Line Arrangements., , , , и . Discrete & Computational Geometry, 32 (2): 167-176 (2004)Moser and tardos meet Lovász, и . STOC, стр. 235-244. ACM, (2011)Near optimality of the priority sampling procedure. Electron. Colloquium Comput. Complex., (2005)Rubik Tables, Stack Rearrangement, and Multi-Robot Path Planning., , , и . Allerton, стр. 1-4. IEEE, (2022)On Rearrangement of Items Stored in Stacks., и . WAFR, том 17 из Springer Proceedings in Advanced Robotics, стр. 518-533. Springer, (2021)A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications., и . Advances In Computational Complexity Theory, том 13 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 183-193. DIMACS/AMS, (1990)A note on the Theta number of Lovász and the generalized Delsarte bound. FOCS, стр. 36-39. IEEE Computer Society, (1994)Regular Languages Are Testable with a Constant Number of Queries., , , и . FOCS, стр. 645-655. IEEE Computer Society, (1999)