default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLefteris M. Kirousis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[i11]Lefteris M. Kirousis, John Livieratos:
Improved bounds for acyclic coloring parameters. CoRR abs/2202.13846 (2022)- 2021
- [j41]Lefteris M. Kirousis
, John Livieratos, Kostas I. Psaromiligkos:
Correction to: Directed Lovász Local Lemma and Shearer's Lemma. Ann. Math. Artif. Intell. 89(3-4): 431-434 (2021) - [j40]John Livieratos, Phokion G. Kolaitis, Lefteris M. Kirousis:
On the Computational Complexity of Non-Dictatorial Aggregation. J. Artif. Intell. Res. 72: 137-183 (2021) - 2020
- [j39]Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos:
Directed Lovász local lemma and Shearer's lemma. Ann. Math. Artif. Intell. 88(1-3): 133-155 (2020)
2010 – 2019
- 2019
- [j38]Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos:
Aggregation of Votes with Multiple Positions on Each Issue. ACM Trans. Economics and Comput. 7(1): 1:1-1:25 (2019) - [c41]Josep Díaz, Lefteris M. Kirousis, Sofia Kokonezi, John Livieratos:
Algorithmically Efficient Syntactic Characterization of Possibility Domains. ICALP 2019: 50:1-50:13 - [i10]Josep Díaz, Lefteris M. Kirousis, Sofia Kokonezi, John Livieratos:
Algorithmically Efficient Syntactic Characterization of Possibility Domains. CoRR abs/1901.00138 (2019) - 2018
- [c40]Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos:
On the Computational Complexity of Non-dictatorial Aggregation. RAMiCS 2018: 350-365 - [c39]Ioannis Giotis, Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. GASCom 2018: 148-155 - [c38]Lefteris M. Kirousis, John Livieratos:
A Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma. LION 2018: 49-63 - 2017
- [j37]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Ioannis Mourtos, Maria J. Serna:
The social cost of congestion games by imposing variable delays. ICT Express 3(4): 155-159 (2017) - [j36]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
Acyclic edge coloring through the Lovász Local Lemma. Theor. Comput. Sci. 665: 40-50 (2017) - [c37]Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos:
Aggregation of Votes with Multiple Positions on Each Issue. RAMiCS 2017: 209-225 - 2016
- [j35]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna:
On the Stability of Generalized Second Price Auctions with Budgets. Theory Comput. Syst. 59(1): 1-23 (2016) - [r2]Alexis C. Kaporis, Lefteris M. Kirousis:
Thresholds of Random k-Sat. Encyclopedia of Algorithms 2016: 2236-2239 - [i9]Lefteris M. Kirousis, John Livieratos:
A Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma. CoRR abs/1611.00502 (2016) - 2015
- [c36]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. ANALCO 2015: 16-25 - [i8]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
An alternative proof for the constructive Asymmetric Lovász Local Lemma. CTW 2015: 89-92 - [i7]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
An alternative proof for the constructive Asymmetric Lovász Local Lemma. CoRR abs/1505.02568 (2015) - [i6]Lefteris M. Kirousis, Phokion G. Kolaitis:
Aggregation of Votes with Multiple Positions on Each Issue. CoRR abs/1505.07737 (2015) - 2014
- [c35]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna:
On the Stability of Generalized Second Price Auctions with Budgets. LATIN 2014: 695-706 - [i5]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Yiannis Mourtos, Maria J. Serna:
Optimizing the Social Cost of Congestion Games by Imposing Variable Delays. CoRR abs/1406.5153 (2014) - [i4]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
On the Algorithmic Lovász Local Lemma. CoRR abs/1407.5374 (2014) - 2013
- [i3]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna:
On the Stability of Generalized Second Price Auctions with Budgets. CoRR abs/1309.6474 (2013)
2000 – 2009
- 2009
- [j34]Josep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez-Giménez, Nicholas C. Wormald:
On the chromatic number of a random 5-regular graph. J. 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) - [c34]Lefteris M. Kirousis:
Coloring Random Graphs: A Short Survey. SYNASC 2009: 8 - 2008
- [c33]Ioannis Chatzigiannakis, Lefteris M. Kirousis, Thodoris Stratiotis:
Probabilistic Protocols for Fair Communication in Wireless Sensor Networks. ALGOSENSORS 2008: 100-110 - [c32]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. Discret. Appl. Math. 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) - [c31]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 - [p2]Lefteris M. Kirousis, Yannis C. Stamatiou, Michele Zito:
The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements. Computational Complexity and Statistical Physics 2006: 159-178 - [p1]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou:
Proving Conditional Randomness using The Principle of Deferred Decisions. Computational Complexity and Statistical Physics 2006: 179-194 - 2005
- [j30]Lefteris M. Kirousis, Evangelos Kranakis:
Special Issue on Typical Case Complexity and Phase Transitions. Discret. Appl. Math. 153(1-3): 1 (2005) - [c30]Josep Díaz, G. Grammatikopoulos, Alexis C. Kaporis, Lefteris M. Kirousis, Xavier Pérez-Giménez, Dionisios G. Sotiropoulos:
5-Regular Graphs are 3-Colorable with Positive Probability. ESA 2005: 215-225 - [c29]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. Electron. Notes Discret. Math. 16: 47-70 (2003) - [j27]Evangelos Kranakis, Lefteris M. Kirousis:
Preface: Volume 16. Electron. Notes Discret. Math. 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. J. Interconnect. Networks 3(1-2): 1-17 (2002) - [c28]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:
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 [contents] - 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 An Int. J. 6(4): 329-344 (2001) - [j21]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
The unsatisfiability threshold revisited. Electron. Notes Discret. Math. 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) - [c27]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 - [c26]Lefteris M. Kirousis, Phokion G. Kolaitis:
A Dichotomy in the Complexity of Propositional Circumscription. LICS 2001: 71-80 - [c25]Lefteris M. Kirousis, Phokion G. Kolaitis:
On the Complexity of Model Checking and Inference in Minimal Models. LPNMR 2001: 42-53 - [c24]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. Electron. 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 An Int. J. 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) - [c23]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. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c22]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) - [c21]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 - [c20]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) - [c19]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc:
A better upper bound for the unsatisfiability threshold. Satisfiability Problem: Theory and Applications 1996: 643-648 - [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:
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 [contents] - 1995
- [j12]Lefteris M. Kirousis, Andreas G. Veneris:
Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. Acta Informatica 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. J. Math. Imaging Vis. 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 Distributed 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]Lefteris M. Kirousis:
Fast Parallel Constraint Satisfaction . Artif. Intell. 64(1): 147-160 (1993) - [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]Lefteris M. Kirousis:
Fast Parallel Constraint Satisfaction. ICALP 1993: 418-429 - [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:
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 [contents] - 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. Discret. Math. 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]Lefteris M. Kirousis:
A Selection Theorem. J. Symb. Log. 48(3): 585-594 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
