( en | de | ru )

 

Disambiguation of "Busch, Costas"

Author of the publication

copydeleteadd this publication to your clipboard
Complete Visibility for Oblivious Robots in 풪(N) Time.

, , and . NETYS, volume 11028 of Lecture Notes in Computer Science, page 67-84. Springer, (2018)

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.

Peter Costas

Costas Averkiou

Ilse Costas

Costas Higoumenakis

Costas Panayotakis

 

Other publications of authors with the same name

Impossibility Results for Weak Threshold Networks., and . Inf. Process. Lett., 63 (2): 85-90 (1997)Threshold Counters with Increments and Decrements., , , and . SIROCCO, page 47-61. Carleton Scientific, (1999)Optimal Oblivious Path Selection on the Mesh., , and . IEEE Trans. Computers, 57 (5): 660-671 (2008)Oblivious Buy-at-Bulk in Planar Graphs, , and . CoRR, (2010)Sketching asynchronous streams over a sliding window., , and . PODC, page 82-91. ACM, (2006)An Analysis Framework for Distributed Hierarchical Directories., and . ICDCN, volume 7730 of Lecture Notes in Computer Science, page 378-392. Springer, (2013)Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories., and . DISC, volume 7611 of Lecture Notes in Computer Science, page 415-416. Springer, (2012)Bottleneck Congestion Games with Logarithmic Price of Anarchy., and . SAGT, volume 6386 of Lecture Notes in Computer Science, page 222-233. Springer, (2010)Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor., , and . Algorithmica, 69 (3): 658-684 (2014)Atomic Routing Games on Maximum Congestion., and . AAIM, volume 4041 of Lecture Notes in Computer Science, page 79-91. Springer, (2006)