( en | de | ru )

 

Disambiguation of "Czumaj, Artur"

Author of the publication

copydeleteadd this publication to your clipboard
Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs.

, , , , and . CoRR, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

Artur Czumaj

Artur Teuscher

Artur Bischof

Artur Todtenhöfer

Artur Prinz

 

Other publications of authors with the same name

Delayed path coupling and generating random permutations., and . Random Struct. Algorithms, 17 (3-4): 238-259 (2000)An $O(k)$-Competitive Algorithm for Generalized Caching, , , and . SODA, page 1681--1689. SIAM, (2012)On the Complexity of Determining the Period of a String., and . CPM, volume 1848 of Lecture Notes in Computer Science, page 412-422. Springer, (2000)Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 220-231. Springer, (2007)Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 88-101. Springer, (1993)An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications.. SWAT, volume 621 of Lecture Notes in Computer Science, page 62-72. Springer, (1992)Distributed Methods for Computing Approximate Equilibria., , , , , and . Algorithmica, 81 (3): 1205-1231 (2019)Minimum k-Connected Geometric Networks., and . Encyclopedia of Algorithms, Springer, (2008)A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)., and . CoRR, (2019)Speeding Up Two String-Matching Algorithms., , , , , , and . STACS, volume 577 of Lecture Notes in Computer Science, page 589-600. Springer, (1992)