Author of the publication

Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract).

, , and . STOC, page 265-274. ACM, (1999)

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.

 

Other publications of authors with the same name

Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph., and . SWAT, volume 1851 of Lecture Notes in Computer Science, page 272-285. Springer, (2000)RNA Tree Comparisons via Unrooted Unordered Alignments., , , , , and . WABI, volume 7534 of Lecture Notes in Computer Science, page 135-148. Springer, (2012)The connectivity carcass of a vertex subset in a graph and its incremental maintenance., and . STOC, page 716-725. ACM, (1994)Planarity of the 2-Level Cactus Model., , and . WG, volume 2204 of Lecture Notes in Computer Science, page 91-102. Springer, (2001)On Optimal Solutions for the Bottleneck Tower of Hanoi Problem., and . SOFSEM (1), volume 4362 of Lecture Notes in Computer Science, page 248-259. Springer, (2007)Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract)., , and . CSCML, volume 12716 of Lecture Notes in Computer Science, page 266-274. Springer, (2021)Bit complexity of breaking and achieving symmetry in chains and rings., , and . J. ACM, 55 (1): 3:1-3:28 (2008)Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN., , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 34-37. Springer, (2018)Two Absolute Bounds for Distributed Bit Complexity., and . SIROCCO, volume 3499 of Lecture Notes in Computer Science, page 115-126. Springer, (2005)Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules., and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 36-47. Springer, (2006)