The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lefteris M. Kirousis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lefteris M. Kirousis
    A Polynomial Algorithm for Recognizing Images of Polyhedra. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:194-204 [Conf]
  2. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou
    Random Constraint Satisfaction: A More Accurate Picture. [Citation Graph (0, 0)][DBLP]
    CP, 1997, pp:107-120 [Conf]
  3. Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    Partial Arc Consistency. [Citation Graph (0, 0)][DBLP]
    Over-Constrained Systems, 1995, pp:229-236 [Conf]
  4. J. Díaz, G. Grammatikopoulos, Alexis C. Kaporis, Lefteris M. Kirousis, X. Pérez, Dionisios G. Sotiropoulos
    5-Regular Graphs are 3-Colorable with Positive Probability. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:215-225 [Conf]
  5. Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas
    The Probabilistic Analysis of a Greedy Satisfiability Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:574-585 [Conf]
  6. Alexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos
    Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:432-443 [Conf]
  7. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
    Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:27-38 [Conf]
  8. Lefteris M. Kirousis, Christos H. Papadimitriou
    The Complexity of Recognizing Polyhedral Scenes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:175-185 [Conf]
  9. Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis
    The Parallel Complexity of the Subgraph Connectivity Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:294-299 [Conf]
  10. Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
    A Proof Technique for Register Automicity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:286-303 [Conf]
  11. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:210-224 [Conf]
  12. Lefteris M. Kirousis
    Fast Parallel Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:418-429 [Conf]
  13. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
    Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:582-587 [Conf]
  14. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
    Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:328-338 [Conf]
  15. Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg
    Station Layouts in the Presence of Location Constraints. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:269-278 [Conf]
  16. Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis
    An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:198-208 [Conf]
  17. Lefteris M. Kirousis, Phokion G. Kolaitis
    A Dichotomy in the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:71-80 [Conf]
  18. Lefteris M. Kirousis, Phokion G. Kolaitis
    On the Complexity of Model Checking and Inference in Minimal Models. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:42-53 [Conf]
  19. Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis
    The Complexity of The Reliable Connectivity Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:259-266 [Conf]
  20. Nick D. Dendris, Lefteris M. Kirousis
    Linear-time Parallel Arc Consistency with Reduced Communication Requirements. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:185-198 [Conf]
  21. Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis
    Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:254-264 [Conf]
  22. Lefteris M. Kirousis, Phokion G. Kolaitis
    The Complexity of Minimal Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:407-418 [Conf]
  23. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Power Consumption in Packet Radio Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:363-374 [Conf]
  24. Lefteris M. Kirousis, Paul G. Spirakis
    Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:163-175 [Conf]
  25. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
    Locating Information with Uncertainty in Fully Interconnected Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:283-296 [Conf]
  26. Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
    Atomic Multireader Register. [Citation Graph (0, 0)][DBLP]
    WDAG, 1987, pp:278-296 [Conf]
  27. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
    Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. [Citation Graph (0, 0)][DBLP]
    WDAG, 1991, pp:229-241 [Conf]
  28. Lefteris M. Kirousis, Andreas G. Veneris
    Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. [Citation Graph (0, 0)][DBLP]
    WDAG, 1993, pp:54-68 [Conf]
  29. Alexis C. Kaporis, Lefteris M. Kirousis, E. I. Politopoulou, Paul G. Spirakis
    Experimental Results for Stackelberg Scheduling Strategies. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:77-88 [Conf]
  30. Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
    Fugitive-Search Games on Graphs and Related Parameters. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:331-342 [Conf]
  31. Lefteris M. Kirousis, Andreas G. Veneris
    Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:2, pp:155-170 [Journal]
  32. Lefteris M. Kirousis
    Fast Parallel Constraint Satisfaction . [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1993, v:64, n:1, pp:147-160 [Journal]
  33. 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. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2001, v:44, n:4, pp:221-229 [Journal]
  34. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou
    A Note on the Non-Colorability Threshold of a Random Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  35. Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc
    Random Constraint Satisfaction: A More Accurate Picture. [Citation Graph (0, 0)][DBLP]
    Constraints, 2001, v:6, n:4, pp:329-344 [Journal]
  36. 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. [Citation Graph (0, 0)][DBLP]
    Constraints, 2000, v:5, n:3, pp:251-273 [Journal]
  37. Lefteris M. Kirousis, E. Kranakisdeg
    Special Issue on Typical Case Complexity and Phase Transitions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:1- [Journal]
  38. Lefteris M. Kirousis, Phokion G. Kolaitis
    The Complexity of Minimal Satisfiability Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:82, pp:- [Journal]
  39. Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis
    Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:105, n:1, pp:94-104 [Journal]
  40. Lefteris M. Kirousis, Phokion G. Kolaitis
    The complexity of minimal satisfiability problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:1, pp:20-39 [Journal]
  41. Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis
    The Complexity of the Reliable Connectivity Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:5, pp:245-252 [Journal]
  42. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
    Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:1, pp:47-53 [Journal]
  43. Lefteris M. Kirousis, Christos H. Papadimitriou
    The Complexity of Recognizing Polyhedral Scenes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:1, pp:14-38 [Journal]
  44. Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg
    Station Layouts in the Presence of Location Constraints. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:1-2, pp:1-17 [Journal]
  45. Lefteris M. Kirousis
    A Selection Theorem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:3, pp:585-594 [Journal]
  46. Lefteris M. Kirousis, Phokion G. Kolaitis
    A Dichotomy in the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:6, pp:695-715 [Journal]
  47. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
    Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:3, pp:169-180 [Journal]
  48. Lefteris M. Kirousis
    Effectively Labeling Planar Projections of Polyhedra. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1990, v:12, n:2, pp:123-130 [Journal]
  49. Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas
    The probabilistic analysis of a greedy satisfiability algorithm. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:4, pp:444-480 [Journal]
  50. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
    Approximating the unsatisfiability threshold of random formulas. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:3, pp:253-269 [Journal]
  51. Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis
    Parallel Complexity of the Connected Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:573-586 [Journal]
  52. Lefteris M. Kirousis, Dimitrios M. Thilikos
    The Linkage of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:3, pp:626-647 [Journal]
  53. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
    Rigorous results for random (2+p)-SAT. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:109-129 [Journal]
  54. Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
    Fugitive-Search Games on Graphs and Related Parameters. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:233-254 [Journal]
  55. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Power consumption in packet radio networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:289-305 [Journal]
  56. Lefteris M. Kirousis, Christos H. Papadimitriou
    Searching and Pebbling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:205-218 [Journal]
  57. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
    Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:7, pp:688-696 [Journal]
  58. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
    The unsatisfiability threshold revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:12, pp:1525-1538 [Journal]
  59. Lefteris M. Kirousis, Christos H. Papadimitriou
    Interval graphs and seatching. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:181-184 [Journal]

  60. Probabilistic Protocols for Fair Communication in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  61. A new upper bound for 3-SAT. [Citation Graph (, )][DBLP]


  62. A new upper bound for 3-SAT [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002