|
This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies.
For more information visit Aigaion.nl. |  |
?>
?>
|
[RACTI-RU1-2016-31] Kaporis, Alexis and Spirakis, Paul, Stackelberg Games: The Price of Optimum, in: Encyclopedia of Algorithms, pages 2078-2083, 2016. [DOI] |
|
|
[RACTI-RU1-2014-24] Fotakis, Dimitris, Kaporis, Alexis, Lianeas, Thanasis and Spirakis, Paul, On the Hardness of Network Design for Bottleneck Routing Games, in: Theoretical Computer Science (TCS), volume 521, number 13, pages 107-122, 2014. |
|
|
[RACTI-RU1-2013-46] Fotakis, Dimitris, Kaporis, Alexis, Lianeas, Thanasis and Spirakis, Paul, Resolving Braess's Paradox in Random Networks, in: WINE 2013, USA, 2013. |
|
[RACTI-RU1-2013-40] Kaporis, Alexis, Makris, Christos, Sioutas, Spyros, Tsakalidis, Athanasios, Tsichlas, Kostas and Zaroliagis, Christos, Improved Bounds for Finger Search on a RAM, in: Algorithmica, volume 66, number 2, pages 249-286, 2013. |
|
|
[RACTI-RU1-2012-31] Fotakis, Dimitris, Kaporis, Alexis and Spirakis, Paul, Efficient methods for selfish network design, volume 448, pages 9-20, 2012. |
|
|
[RACTI-RU1-2011-63] Kaporis, Alexis, Makris, Christos, Sioutas, Spyros, Tsakalidis, Athanasios, Tsichlas, Kostas and Zaroliagis, Christos, Improved Bounds for Finger Search on a RAM, in: Algorithmica, 2011. |
|
|
[RACTI-RU1-2010-71] Kaporis, Alexis, Makris, Christos, Mavritsakis, George, Sioutas, Spyros, Tsakalidis, Athanasios, Tsichlas, Kostas and Zaroliagis, Christos, ISB-tree: A new indexing scheme with efficient expected behaviour, in: Elsevier, volume 8, pages 373-387, 2010. [DOI] |
|
[RACTI-RU1-2010-11] Fotakis, Dimitris, Kaporis, Alexis and Spirakis, Paul, Atomic Congestion Games: Fast, Myopic and Concurrent, in: Theory of Computing Systems, pages 38-59, Springer New York, 2010. |
|
|
[RACTI-RU1-2009-34] Fotakis, Dimitris, Gkatzelis, Vasilis, Kaporis, Alexis and Spirakis, Paul, The Impact of Social Ignorance on Weighted Congrestion Games, in: 5th International Workshop on Internet and Network Economics (WINE 2009), WINE 2009, Rome, Italy, 2009. |
|
[RACTI-RU1-2009-30] Diaz, Josep, Kaporis, Alexis, Kemkes, G.D, Kirousis, Lefteris, Perez, X and Wormald, Nick, On the Chromatic Number of a Random 5-Regular Graph, in: Journal of Graph Theory, 2009. |
|
[RACTI-RU1-2009-16] Fotakis, Dimitris, Kaporis, Alexis and Spirakis, Paul, Efficient Methods for Selfish Network Design, pages 1-12, 2009. |
|
[RACTI-RU1-2009-8] Kaporis, Alexis and Spirakis, Paul, The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions, in: Symposium on Parallel Algorithms and Architectures (SPAA), pages 745-755, 2009. |
|
|
[RACTI-RU1-2008-14] Fotakis, Dimitris, Kaporis, Alexis and Spirakis, Paul, Atomic Congestion Games: Fast, Myopic and Concurrent, in: B. Monien and U.-P. Schroeder (Eds.): SAGT 2008, pages 121-132, Springer-Verlag Berlin Heidelberg 2008, 2008. |
|
[RACTI-RU1-2008-9] Kalles, D., Kaporis, Alexis and Spirakis, Paul, Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games, in: 7th International Workshop on Experimental Algorithms (WEA 2008), pages 181-193, Springer-Verlag Berlin Heidelberg, Massachusetts, USA, 2008. |
|
|
[RACTI-RU1-2007-84] Kaporis, Alexis, Kirousis, Lefteris, Stamatiou, Yannis, Vamvakari, Malvina and Zito, Michele, The unsatisfiability threshold revisited., in: Discrete Applied Mathematics, volume 155, number 12, pages 1525-1538, 2007. [DOI] |
|
[RACTI-RU1-2007-12] Spirakis, Paul, Kaporis, Alexis and Fotakis, Dimitris, Atomic congestion games: fast, myopic and concurrent, 2007. |
|
|
[RACTI-RU1-2006-65] Kaporis, Alexis, Kirousis, Lefteris and Stavropoulos, Elias, Approximating almost all instances of Max-Cut within a ratio above the Hastad threshold, in: 14th Annual European Symposium on Algorithms (ESA 2006), pages 432-443, Springer, L.N Computer Science, 2006. [DOI] |
|
[RACTI-RU1-2006-45] Kaporis, Alexis, Makris, Christos, Sioutas, Spyros, Tsakalidis, Athanasios, Tsichlas, Kostas and Zaroliagis, Christos, Dynamic Interpolation Search Revisited., in: 33rd International Colloquium for Automata, Languages and Programming, pages 382-394, Springer, ICALP 2006, 2006. |
|
[RACTI-RU1-2006-24] Kaporis, Alexis, Kirousis, Lefteris and Lalas, Efthimios, The probabilistic analysis of a greedy
satisfiability algorithm, in: Random Structures and Algorithms, volume 28, number 4, pages 444-480, 2006. |
|
[RACTI-RU1-2006-21] Kaporis, Alexis, Kirousis, Lefteris and Stamatiou, Yannis, How to prove conditional randomness using the Principle of Deferred Decisionseds., Computational Complexity and Statistical Physics, in: Oxford University, pages 179-194, 2006. |
|
|
[RACTI-RU1-2005-57] Kaporis, Alexis, Makris, Christos, Mavritsakis, George, Sioutas, Spyros, Tsakalidis, Athanasios, Tsichlas, Kostas and Zaroliagis, Christos, ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour, in: 16th Annual International Symposium on Algorithms and Computation, pages 318-327, Springer-Verlag, ISAAC 2005, Hainan, China, 2005. |
|
[RACTI-RU1-2005-45] Kaporis, Alexis, Politopoulou, E. I. and Spirakis, Paul, The Price of Optimum in Stackelberg Games, in: Electronic Colloquium on Computational Complexity (ECCC), volume 056, 2005. |
|
[RACTI-RU1-2005-41] Kaporis, Alexis, Kirousis, Lefteris, Politopoulou, E. I. and Spirakis, Paul, Experimental Results for Stackelberg Scheduling Strategies, in: 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005), pages 77-88, 2005. [DOI] |
|
|
[RACTI-RU1-2003-29] Kaporis, Alexis, Makris, Christos, Sioutas, Spyros, Tsakalidis, Athanasios, Tsichlas, Kostas and Zaroliagis, Christos, Improved Bounds for Finger Search on a RAM, in: 11th Annual European Symposium on Algorithms (ESA 2003), pages 325-336, Springer Verlag, Budapest, Hungary, 2003. |
|
|
[RACTI-RU1-2001-1] Kaporis, Alexis, Kirousis, Lefteris, Kranakis, Evangelos, Krizanc, Danny, Stamatiou, Yannis and Stavropoulos, Elias, Locating information with uncertainty in fully interconnected networks with appli-
cations to world wide web information retrieval, in: The Computer Journal, volume 44, number 4, pages 221-229, 2001. |
|
|
|