Author of the publication

The Complexity of The Reliable Connectivity Problem.

, , and . MFCS, volume 520 of Lecture Notes in Computer Science, page 259-266. Springer, (1991)

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

The Complexity of Minimal Satisfiability Problems., and . STACS, volume 2010 of Lecture Notes in Computer Science, page 407-418. Springer, (2001)Thresholds of Random k-Sat., and . Encyclopedia of Algorithms, Springer, (2008)Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P., and . SWAT, volume 318 of Lecture Notes in Computer Science, page 163-175. Springer, (1988)A Proof Technique for Register Automicity., , , and . FSTTCS, volume 338 of Lecture Notes in Computer Science, page 286-303. Springer, (1988)Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract)., , and . ESA, volume 1136 of Lecture Notes in Computer Science, page 27-38. Springer, (1996)An alternative proof for the constructive Asymmetric Lovász Local Lemma., , , and . CTW, page 89-92. (2015)Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma., , , , and . GASCom, volume 2113 of CEUR Workshop Proceedings, page 148-155. CEUR-WS.org, (2018)The Parallel Complexity of the Subgraph Connectivity Problem, , and . FOCS, page 294-299. IEEE Computer Society, (1989)Aggregation of Votes with Multiple Positions on Each Issue., , and . RAMiCS, volume 10226 of Lecture Notes in Computer Science, page 209-225. (2017)The Linkage of a Graph., and . SIAM J. Comput., 25 (3): 626-647 (1996)