| The probabilistic analysis of a greedy satisfiability algorithm AC Kaporis, LM Kirousis, EG Lalas Random Structures & Algorithms 28 (4), 444-480, 2006 | 194 | 2006 |
| Selecting complementary pairs of literals AC Kaporis, LM Kirousis, E Lalas Electronic Notes in Discrete Mathematics 16, 47-70, 2003 | 60 | 2003 |
| Improved bounds for finger search on a ram A Kaporis, C Makris, S Sioutas, A Tsakalidis, K Tsichlas, C Zaroliagis Algorithmica 66 (2), 249-286, 2013 | 51* | 2013 |
| The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions AC Kaporis, PG Spirakis Theoretical Computer Science 410 (8-10), 745-755, 2009 | 45 | 2009 |
| Dynamic interpolation search revisited A Kaporis, C Makris, S Sioutas, A Tsakalidis, K Tsichlas, C Zaroliagis International Colloquium on Automata, Languages, and Programming, 382-394, 2006 | 36 | 2006 |
| Atomic congestion games: Fast, myopic and concurrent D Fotakis, AC Kaporis, PG Spirakis Theory of Computing Systems 47 (1), 38-59, 2010 | 30 | 2010 |
| 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 | 26 | 2000 |
| Efficient Methods for Selfish Network Design D. Fotakis, A. C. Kaporis, P. G.Spirakis Automata, Languages and Programming, 36th Internatilonal …, 2009 | 23* | 2009 |
| The unsatisfiability threshold revisited AC Kaporis, LM Kirousis, YC Stamatiou, M Vamvakari, M Zito Discrete applied mathematics 155 (12), 1525-1538, 2007 | 22* | 2007 |
| Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold AC Kaporis, LM Kirousis, YC Stamatiou, M Vamvakari, M Zito Italian Conference on Theoretical Computer Science, 328-338, 2001 | 20 | 2001 |
| The impact of social ignorance on weighted congestion games D Fotakis, V Gkatzelis, AC Kaporis, PG Spirakis Theory of Computing Systems 50 (3), 559-578, 2012 | 18 | 2012 |
| 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 | 14* | 2009 |
| ISB-tree: A new indexing scheme with efficient expected behaviour A Kaporis, C Makris, G Mavritsakis, S Sioutas, A Tsakalidis, K Tsichlas, ... International Symposium on Algorithms and Computation, 318-327, 2005 | 14 | 2005 |
| Proving Conditional Randomness using The Principle of Deferred Decisions. AC Kaporis, LM Kirousis, YC Stamatiou Computational Complexity and Statistical Physics, 179-194, 2006 | 13 | 2006 |
| Resolving Braess’s paradox in random networks D Fotakis, AC Kaporis, T Lianeas, PG Spirakis Algorithmica 78 (3), 788-818, 2017 | 10 | 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 | 10 | 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 |
| Stackelberg Games: The Price of Optimum. AC Kaporis, PG Spirakis Encyclopedia of Algorithms, 888-892, 2008 | 8 | 2008 |
| 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 |
