2008 | ||
---|---|---|
69 | EE | Ioannis Chatzigiannakis, Lefteris M. Kirousis, Thodoris Stratiotis: Probabilistic Protocols for Fair Communication in Wireless Sensor Networks. ALGOSENSORS 2008: 100-110 |
68 | EE | Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez: A new upper bound for 3-SAT. FSTTCS 2008 |
67 | EE | Alexis C. Kaporis, Lefteris M. Kirousis: Thresholds of Random k-Sat. Encyclopedia of Algorithms 2008 |
66 | EE | 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 | ||
65 | EE | 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 | ||
64 | EE | 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 |
63 | EE | 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) |
2005 | ||
62 | EE | 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 |
61 | EE | Alexis C. Kaporis, Lefteris M. Kirousis, E. I. Politopoulou, Paul G. Spirakis: Experimental Results for Stackelberg Scheduling Strategies. WEA 2005: 77-88 |
60 | EE | Lefteris M. Kirousis, Evangelos Kranakis: Special Issue on Typical Case Complexity and Phase Transitions. Discrete Applied Mathematics 153(1-3): 1 (2005) |
2004 | ||
59 | EE | Lefteris M. Kirousis, Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput. Syst. 37(6): 695-715 (2004) |
2003 | ||
58 | EE | Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas: Selecting Complementary Pairs of Literals. Electronic Notes in Discrete Mathematics 16: 47-70 (2003) |
57 | EE | Evangelos Kranakis, Lefteris M. Kirousis: Preface: Volume 16. Electronic Notes in Discrete Mathematics 16: 93 (2003) |
56 | EE | Lefteris M. Kirousis, Phokion G. Kolaitis: The complexity of minimal satisfiability problems. Inf. Comput. 187(1): 20-39 (2003) |
55 | EE | 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 | ||
54 | Christos Kaklamanis, Lefteris M. Kirousis: SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002 Carleton Scientific 2002 | |
53 | EE | Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas: The Probabilistic Analysis of a Greedy Satisfiability Algorithm. ESA 2002: 574-585 |
52 | EE | 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) |
2001 | ||
51 | EE | 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 |
50 | Lefteris M. Kirousis, Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. LICS 2001: 71-80 | |
49 | EE | Lefteris M. Kirousis, Phokion G. Kolaitis: On the Complexity of Model Checking and Inference in Minimal Models. LPNMR 2001: 42-53 |
48 | EE | Lefteris M. Kirousis, Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems. STACS 2001: 407-418 |
47 | EE | 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) |
46 | 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) | |
45 | EE | 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) |
44 | EE | 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) |
2000 | ||
43 | EE | Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou: Locating Information with Uncertainty in Fully Interconnected Networks. DISC 2000: 283-296 |
42 | 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) | |
41 | EE | 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) |
40 | EE | Lefteris M. Kirousis, Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems Electronic Colloquium on Computational Complexity (ECCC) 7(82): (2000) |
39 | EE | Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc: Power consumption in packet radio networks. Theor. Comput. Sci. 243(1-2): 289-305 (2000) |
1999 | ||
38 | EE | 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 | ||
37 | 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 | ||
36 | 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 | |
35 | Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc: Power Consumption in Packet Radio Networks (Extended Abstract). STACS 1997: 363-374 | |
34 | EE | 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) |
1996 | ||
33 | Lefteris M. Kirousis, Christos Kaklamanis: Structure, Information and Communication Complexity, SIROCCO '95, Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, Olympia Greece, June 12-14, 1995 Carleton Scientific 1996 | |
32 | Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc: Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract). ESA 1996: 27-38 | |
31 | EE | 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) |
30 | Lefteris M. Kirousis, Dimitrios M. Thilikos: The Linkage of a Graph. SIAM J. Comput. 25(3): 626-647 (1996) | |
1995 | ||
29 | 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 | |
28 | Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos: Partial Arc Consistency. Over-Constrained Systems 1995: 229-236 | |
27 | Nick D. Dendris, Lefteris M. Kirousis: Linear-time Parallel Arc Consistency with Reduced Communication Requirements. SIROCCO 1995: 185-198 | |
26 | 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) | |
1994 | ||
25 | Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos: Fugitive-Search Games on Graphs and Related Parameters. WG 1994: 331-342 | |
24 | EE | 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) |
1993 | ||
23 | Lefteris M. Kirousis: Fast Parallel Constraint Satisfaction. ICALP 1993: 418-429 | |
22 | Lefteris M. Kirousis, Andreas G. Veneris: Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. WDAG 1993: 54-68 | |
21 | Lefteris M. Kirousis: Fast Parallel Constraint Satisfaction . Artif. Intell. 64(1): 147-160 (1993) | |
20 | 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) | |
19 | Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis: Parallel Complexity of the Connected Subgraph Problem. SIAM J. Comput. 22(3): 573-586 (1993) | |
1992 | ||
18 | Sam Toueg, Paul G. Spirakis, Lefteris M. Kirousis: Distributed Algorithms, 5th International Workshop, WDAG '91, Delphi, Greece, October 7-9, 1991, Proceedings Springer 1992 | |
17 | 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 | |
1991 | ||
16 | Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas: Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. ICCI 1991: 582-587 | |
15 | Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis: The Complexity of The Reliable Connectivity Problem. MFCS 1991: 259-266 | |
14 | 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 | |
13 | Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis: The Complexity of the Reliable Connectivity Problem. Inf. Process. Lett. 39(5): 245-252 (1991) | |
1990 | ||
12 | EE | Lefteris M. Kirousis: Effectively Labeling Planar Projections of Polyhedra. IEEE Trans. Pattern Anal. Mach. Intell. 12(2): 123-130 (1990) |
1989 | ||
11 | Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis: The Parallel Complexity of the Subgraph Connectivity Problem FOCS 1989: 294-299 | |
10 | EE | 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 | ||
9 | Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi: A Proof Technique for Register Automicity. FSTTCS 1988: 286-303 | |
8 | Lefteris M. Kirousis, Paul G. Spirakis: Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. SWAT 1988: 163-175 | |
7 | Lefteris M. Kirousis, Christos H. Papadimitriou: The Complexity of Recognizing Polyhedral Scenes. J. Comput. Syst. Sci. 37(1): 14-38 (1988) | |
1987 | ||
6 | Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi: Atomic Multireader Register. WDAG 1987: 278-296 | |
1986 | ||
5 | Lefteris M. Kirousis: A Polynomial Algorithm for Recognizing Images of Polyhedra. Aegean Workshop on Computing 1986: 194-204 | |
4 | Lefteris M. Kirousis, Christos H. Papadimitriou: Searching and Pebbling. Theor. Comput. Sci. 47(3): 205-218 (1986) | |
1985 | ||
3 | Lefteris M. Kirousis, Christos H. Papadimitriou: The Complexity of Recognizing Polyhedral Scenes (Extended Abstract) FOCS 1985: 175-185 | |
2 | EE | Lefteris M. Kirousis, Christos H. Papadimitriou: Interval graphs and seatching. Discrete Mathematics 55(2): 181-184 (1985) |
1983 | ||
1 | Lefteris M. Kirousis: A Selection Theorem. J. Symb. Log. 48(3): 585-594 (1983) |