( en | de | ru )

 

Disambiguation of "Kirousis, Lefteris M."

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Recognizing Polyhedral Scenes (Extended Abstract)

, and . FOCS, page 175-185. IEEE Computer Society, (1985)

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.

Simon M M Laimer

M. Biswas M. Dam

Marcel M M Kuypers

Bernhard M M Lang

Doris M M Eggert

 

Other publications of authors with the same name

Approximating the unsatisfiability threshold of random formulas., , , and . Random Struct. Algorithms, 12 (3): 253-269 (1998)An alternative proof for the constructive Asymmetric Lovász Local Lemma., , , and . CoRR, (2015)The Complexity of Minimal Satisfiability Problems., and . STACS, volume 2010 of Lecture Notes in Computer Science, page 407-418. Springer, (2001)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)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)Station Layouts in the Presence of Location Constraints., , , , , and . J. Interconnect. Networks, 3 (1-2): 1-17 (2002)Thresholds of Random k-Sat., and . Encyclopedia of Algorithms, Springer, (2008)Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations., and . Acta Inf., 32 (2): 155-170 (1995)A Note on the Non-Colorability Threshold of a Random Graph., , and . Electron. J. Comb., (2000)