Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Lefteris M. Kirousis
2000 – 2009
- 2009
[j34]Josep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez, Nicholas C. Wormald: On the chromatic number of a random 5-regular graph. Journal of Graph Theory 61(3): 157-191 (2009)- [j33]Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez: On the satisfiability threshold of formulas with three literals per clause. Theor. Comput. Sci. 410(30-32): 2920-2934 (2009)
- [c33]
- 2008
- [c32]Ioannis Chatzigiannakis, Lefteris M. Kirousis, Thodoris Stratiotis: Probabilistic Protocols for Fair Communication in Wireless Sensor Networks. ALGOSENSORS 2008: 100-110
- [c31]Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez: A new upper bound for 3-SAT. FSTTCS 2008: 163-174
- [r1]Alexis C. Kaporis, Lefteris M. Kirousis: Thresholds of Random k-Sat. Encyclopedia of Algorithms 2008
- [i2]Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez: A new upper bound for 3-SAT. CoRR abs/0807.3600 (2008)
- 2007
- [j32]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito: The unsatisfiability threshold revisited. Discrete Applied Mathematics 155(12): 1525-1538 (2007)
- 2006
- [j31]Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas: The probabilistic analysis of a greedy satisfiability algorithm. Random Struct. Algorithms 28(4): 444-480 (2006)
- [c30]Alexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos: Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold. ESA 2006: 432-443
- 2005
- [j30]Lefteris M. Kirousis, Evangelos Kranakis: Special Issue on Typical Case Complexity and Phase Transitions. Discrete Applied Mathematics 153(1-3): 1 (2005)
- [c29]Josep Díaz, G. Grammatikopoulos, Alexis C. Kaporis, Lefteris M. Kirousis, Xavier Pérez, Dionisios G. Sotiropoulos: 5-Regular Graphs are 3-Colorable with Positive Probability. ESA 2005: 215-225
- [c28]Alexis C. Kaporis, Lefteris M. Kirousis, Efpraxia I. Politopoulou, Paul G. Spirakis: Experimental Results for Stackelberg Scheduling Strategies. WEA 2005: 77-88
- 2004
- [j29]Lefteris M. Kirousis, Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput. Syst. 37(6): 695-715 (2004)
- 2003
- [j28]Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas: Selecting Complementary Pairs of Literals. Electronic Notes in Discrete Mathematics 16: 47-70 (2003)
- [j27]Evangelos Kranakis, Lefteris M. Kirousis: Preface: Volume 16. Electronic Notes in Discrete Mathematics 16: 93 (2003)
- [j26]Lefteris M. Kirousis, Phokion G. Kolaitis: The complexity of minimal satisfiability problems. Inf. Comput. 187(1): 20-39 (2003)
- [j25]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou: Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory. Networks 42(3): 169-180 (2003)
- 2002
- [j24]Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg: Station Layouts in the Presence of Location Constraints. Journal of Interconnection Networks 3(1-2): 1-17 (2002)
- [c27]Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas: The Probabilistic Analysis of a Greedy Satisfiability Algorithm. ESA 2002: 574-585
- [e3]Christos Kaklamanis, Lefteris M. Kirousis (Eds.): SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002. Proceedings in Informatics 13, Carleton Scientific 2002
- 2001
- [j23]Alexis C. Kaporis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou, Elias C. Stavropoulos: Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval. Comput. J. 44(4): 221-229 (2001)
- [j22]Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc: Random Constraint Satisfaction: A More Accurate Picture. Constraints 6(4): 329-344 (2001)
- [j21]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito: The unsatisfiability threshold revisited. Electronic Notes in Discrete Mathematics 9: 81-95 (2001)
- [j20]Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc: Rigorous results for random (2+p)-SAT. Theor. Comput. Sci. 265(1-2): 109-129 (2001)
- [c26]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito: Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. ICTCS 2001: 328-338
- [c25]Lefteris M. Kirousis, Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. LICS 2001: 71-80
- [c24]Lefteris M. Kirousis, Phokion G. Kolaitis: On the Complexity of Model Checking and Inference in Minimal Models. LPNMR 2001: 42-53
- [c23]Lefteris M. Kirousis, Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems. STACS 2001: 407-418
- 2000
- [j19]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou: A Note on the Non-Colorability Threshold of a Random Graph. Electr. J. Comb. 7 (2000)
- [j18]Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos: On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints. Constraints 5(3): 251-273 (2000)
- [j17]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc: Power consumption in packet radio networks. Theor. Comput. Sci. 243(1-2): 289-305 (2000)
- [c22]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou: Locating Information with Uncertainty in Fully Interconnected Networks. DISC 2000: 283-296
- [i1]Lefteris M. Kirousis, Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems. Electronic Colloquium on Computational Complexity (ECCC) 7(82) (2000)
1990 – 1999
- 1999
- [c21]Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg: Station Layouts in the Presence of Location Constraints. ISAAC 1999: 269-278
- 1998
- [j16]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou: Approximating the unsatisfiability threshold of random formulas. Random Struct. Algorithms 12(3): 253-269 (1998)
- 1997
- [j15]Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos: Fugitive-Search Games on Graphs and Related Parameters. Theor. Comput. Sci. 172(1-2): 233-254 (1997)
- [c20]Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou: Random Constraint Satisfaction: A More Accurate Picture. CP 1997: 107-120
- [c19]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc: Power Consumption in Packet Radio Networks (Extended Abstract). STACS 1997: 363-374
- 1996
- [j14]Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas: Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. Inf. Process. Lett. 58(1): 47-53 (1996)
- [j13]Lefteris M. Kirousis, Dimitrios M. Thilikos: The Linkage of a Graph. SIAM J. Comput. 25(3): 626-647 (1996)
- [c18]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc: Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract). ESA 1996: 27-38
- [e2]Lefteris M. Kirousis, Christos Kaklamanis (Eds.): Structure, Information and Communication Complexity, SIROCCO '95, Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, Olympia Greece, June 12-14, 1995. Proceedings in Informatics 2, Carleton Scientific 1996
- 1995
- [j12]Lefteris M. Kirousis, Andreas G. Veneris: Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. Acta Inf. 32(2): 155-170 (1995)
- [c17]Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos: Partial Arc Consistency. Over-Constrained Systems 1995: 229-236
- [c16]Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos: Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. FSTTCS 1995: 210-224
- [c15]Nick D. Dendris, Lefteris M. Kirousis: Linear-time Parallel Arc Consistency with Reduced Communication Requirements. SIROCCO 1995: 185-198
- 1994
- [j11]Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis: An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects. Journal of Mathematical Imaging and Vision 4(4): 375-387 (1994)
- [j10]Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas: Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. IEEE Trans. Parallel Distrib. Syst. 5(7): 688-696 (1994)
- [c14]Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos: Fugitive-Search Games on Graphs and Related Parameters. WG 1994: 331-342
- 1993
- [j9]
- [j8]Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis: Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays. Inf. Comput. 105(1): 94-104 (1993)
- [j7]Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis: Parallel Complexity of the Connected Subgraph Problem. SIAM J. Comput. 22(3): 573-586 (1993)
- [c13]
- [c12]Lefteris M. Kirousis, Andreas G. Veneris: Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. WDAG 1993: 54-68
- 1992
- [c11]Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis: An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects. ISAAC 1992: 198-208
- [e1]Sam Toueg, Paul G. Spirakis, Lefteris M. Kirousis (Eds.): Distributed Algorithms, 5th International Workshop, WDAG '91, Delphi, Greece, October 7-9, 1991, Proceedings. Lecture Notes in Computer Science 579, Springer 1992, ISBN 3-540-55236-7
- 1991
- [j6]Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis: The Complexity of the Reliable Connectivity Problem. Inf. Process. Lett. 39(5): 245-252 (1991)
- [c10]Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas: Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. ICCI 1991: 582-587
- [c9]Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis: The Complexity of The Reliable Connectivity Problem. MFCS 1991: 259-266
- [c8]Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas: Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. WDAG 1991: 229-241
- 1990
- [j5]Lefteris M. Kirousis: Effectively Labeling Planar Projections of Polyhedra. IEEE Trans. Pattern Anal. Mach. Intell. 12(2): 123-130 (1990)
1980 – 1989
- 1989
- [c7]Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis: The Parallel Complexity of the Subgraph Connectivity Problem. FOCS 1989: 294-299
- [c6]Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis: Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. SPAA 1989: 254-264
- 1988
- [j4]Lefteris M. Kirousis, Christos H. Papadimitriou: The Complexity of Recognizing Polyhedral Scenes. J. Comput. Syst. Sci. 37(1): 14-38 (1988)
- [c5]Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi: A Proof Technique for Register Automicity. FSTTCS 1988: 286-303
- [c4]Lefteris M. Kirousis, Paul G. Spirakis: Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. SWAT 1988: 163-175
- 1987
- [c3]Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi: Atomic Multireader Register. WDAG 1987: 278-296
- 1986
- [j3]Lefteris M. Kirousis, Christos H. Papadimitriou: Searching and Pebbling. Theor. Comput. Sci. 47(3): 205-218 (1986)
- [c2]Lefteris M. Kirousis: A Polynomial Algorithm for Recognizing Images of Polyhedra. Aegean Workshop on Computing 1986: 194-204
- 1985
- [j2]Lefteris M. Kirousis, Christos H. Papadimitriou: Interval graphs and seatching. Discrete Mathematics 55(2): 181-184 (1985)
- [c1]Lefteris M. Kirousis, Christos H. Papadimitriou: The Complexity of Recognizing Polyhedral Scenes (Extended Abstract). FOCS 1985: 175-185
- 1983
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:08 CET by the dblp team