The probabilistic analysis of a greedy satisfiability algorithm AC Kaporis, LM Kirousis, EG Lalas Random Structures & Algorithms 28 (4), 444-480, 2006 | 218 | 2006 |
Selecting complementary pairs of literals AC Kaporis, LM Kirousis, E Lalas Electronic Notes in Discrete Mathematics 16, 47-70, 2003 | 64 | 2003 |
Improved bounds for finger search on a RAM A Kaporis, C Makris, S Sioutas, A Tsakalidis, K Tsichlas, C Zaroliagis Algorithmica 66, 249-286, 2013 | 54* | 2013 |
Dynamic interpolation search revisited A Kaporis, C Makris, S Sioutas, A Tsakalidis, K Tsichlas, C Zaroliagis Automata, Languages and Programming: 33rd International Colloquium, ICALP …, 2006 | 46* | 2006 |
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions AC Kaporis, PG Spirakis Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006 | 40 | 2006 |
Atomic congestion games: Fast, myopic and concurrent D Fotakis, AC Kaporis, PG Spirakis Theory of Computing Systems 47, 38-59, 2010 | 34 | 2010 |
Efficient Methods for Selfish Network Design D. Fotakis, A. C. Kaporis, P. G.Spirakis Automata, Languages and Programming, 36th Internatilonal …, 2009 | 31* | 2009 |
A note on the non-colorability threshold of a random graph AC Kaporis, LM Kirousis, YC Stamatiou the electronic journal of combinatorics 7, R29-R29, 2000 | 27 | 2000 |
The unsatisfiability threshold revisited AC Kaporis, LM Kirousis, YC Stamatiou, M Vamvakari, M Zito Discrete applied mathematics 155 (12), 1525-1538, 2007 | 24* | 2007 |
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold A Restivo, SR Della Rocca, L Roversi, AC Kaporis, LM Kirousis, ... Theoretical Computer Science: 7th Italian Conference, ICTCS 2001 Torino …, 2001 | 22 | 2001 |
The impact of social ignorance on weighted congestion games D Fotakis, V Gkatzelis, AC Kaporis, PG Spirakis International Workshop on Internet and Network Economics, 316-327, 2009 | 17 | 2009 |
On the chromatic number of a random 5‐regular graph J Díaz, AC Kaporis, GD Kemkes, LM Kirousis, X Pérez, N Wormald Journal of Graph Theory 61 (3), 157-191, 2009 | 16* | 2009 |
ISB-tree: A new indexing scheme with efficient expected behaviour A Kaporis, C Makris, G Mavritsakis, S Sioutas, A Tsakalidis, K Tsichlas, ... Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya …, 2005 | 14 | 2005 |
How to prove conditional randomness using the Principle of Deferred Decisions AC Kaporis, LM Kirousis, YC Stamatiou Special Volume on Computational Complexity and Statistical Physics. Santa Fe …, 2002 | 14 | 2002 |
Resolving braess’s paradox in random networks D Fotakis, AC Kaporis, T Lianeas, PG Spirakis Algorithmica 78, 788-818, 2017 | 11 | 2017 |
ISB-tree: A new indexing scheme with efficient expected behaviour A Kaporis, C Makris, G Mavritsakis, S Sioutas, A Tsakalidis, K Tsichlas, ... Journal of Discrete Algorithms 8 (4), 373-387, 2010 | 9 | 2010 |
Locating information with uncertainty in fully interconnected networks with applications to World Wide Web information retrieval AC Kaporis, LM Kirousis, E Kranakis, D Krizanc, YC Stamatiou, ... The Computer Journal 44 (4), 221-229, 2001 | 9 | 2001 |
Random input helps searching predecessors D Belazzougui, AC Kaporis, PG Spirakis arXiv preprint arXiv:1104.4353, 2011 | 7 | 2011 |
Efficient processing of 3-sided range queries with probabilistic guarantees A Kaporis, AN Papadopoulos, S Sioutas, K Tsakalidis, K Tsichlas Proceedings of the 13th International Conference on Database Theory, 34-43, 2010 | 7 | 2010 |
Stackelberg Games: The Price of Optimum. AC Kaporis, PG Spirakis Encyclopedia of Algorithms, 888-892, 2008 | 7 | 2008 |