Academic staff
Kaporis Alexis
Personal Information
Kaporis Alexis
Associate Professor
kaporisa [at] aegean [dot] gr
22730 82239
Lymberis Building, 2nd Floor, Office B5 (enter B1)
Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or mass reproduced without the explicit permission of the copyright holder.
Conference Publications
[1]
Djamal Belazzougui, A. Kaporis, P. Spirakis, Random input helps searching predecessors, Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, GASCom 2018, Luca Ferrari, Malvina Vamvakari, pp. 106-115, Jun, 2018, Athens, CEUR-WS.org 2018, http://gascom2018.hua.gr/
Download PDF[1]
D. Fotakis, A. Kaporis, T. Lianeas, P. Spirakis, Resolving Braess’s Paradox in Random Networks, WINE 2013: The 9th Conference on Web and Internet Economics, December 11-14, 2013, Harvard University, Cambridge, MA. , Dec, 2013, USA, Lecture Notes in Computes Science, Springer
[1]
D. Fotakis, A. Kaporis, T. Lianeas, P. Spirakis, On the Hardness of Network Design for Bottleneck Routing Games. , Symposium on Algorithmic Game Theory, Universitat Politècnica de Catalunya, Spain, pp. 156-167, 2012
[1]
A. Kaporis, S. Sioutas, K. Tsakalidis, K. Tsichlas, A. Papadopoulos, Efficient Processing of 3-Sided Range Queries with Probabilistic Guarantees., 13th International Conference on Database Theory (ICDT 2010), 2010
[2]
D. Fotakis, V. Gkatzelis, A. Kaporis, P. Spirakis, The Impact of Social Ignorance on Weighted Congestion Games., 5th International Workshop on Internet and Network Economics (WINE 2009), 2010
[1]
D. Fotakis, A. Kaporis, P. Spirakis, Efficient Methods for Selfish Network Design, 36th International Colloquium on Automata, Languages and Programming (ICALP 09), Jul, 2009, Rhodes – Greece
[2]
G. Brodal, A. Kaporis, S. Sioutas, K. Tsakalidis, K. Tsichlas, Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time, 20th International Symposium on Algorithms and Computation (ISAAC 2009) , 2009, HAWAI
[1]
D. Kalles, A. Kaporis, P. Spirakis, Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games, 7th International Workshop, WEA 2008, Lecture Notes in Computer Science 5038, May, 2008, Provincetown, MA, USA, Springer
[2]
D. Fotakis, A. Kaporis, P. Spirakis, Atomic congestion games: fast, myopic and concurrent, 1st International Symposium on Algorithmic Game Theory, Apr, 2008, Paderborn, Germany
[1]
A. Kaporis, L. M. Kirousis, E. C. Stavropoulos, Approximating almost all instances of Max Cut within a ratio above the Hastad threshold, 14th Annual European Symposium on Algorithms (ESA '06), Sep, 2006, Zurich, Switzerland, ETH Zurich
[2]
A. Kaporis, P. Spirakis, The price of Optimum in Stackelberg games on arbitrary networks and latency functions, 18th ACM Symposium on Parallelism in Algorithms and Architectures Cambridge (SPAA '06), Jul, 2006, MA, USA
[3]
A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, Dynamic Interpolation Search Revisited, 33rd International Colloquium on Automata, Languages and Programming (ICALP '06), S. Servolo, (ed), Jul, 2006, Venice - Italy
[1]
A. Kaporis, C. Makris, G. Mavritsakis, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, ISB-Tree: A New Indexing Scheme with Efficient, 16th Annual International Symposium on Algorithms and Computation (ISAAC '05), Dec, 2005, Sanya, Hainan, China
[2]
J. Diaz, A. Kaporis, L. M. Kirousis, X. Perez, Partitioning networks into classes of mutually isolated nodes, European Conference on Complex Systems (ECCS '05), Nov, 2005, Paris
[3]
J. Diaz, G. Grammatikopoulos, A. Kaporis, L. M. Kirousis, X. Perez, D. G. Sotiropoulos, 5-Regular Graphs are 3-Colorable with Uniformly Positive Probability, 13th Annual European Symposium on Algorithms (ESA '05), Oct, 2005, Spain
[4]
A. Kaporis, L. M. Kirousis, E. I. Politopoulou, P. Spirakis, Experimental results for Stackelberg scheduling strategies, 4th International Workshop on Efficient and Experimental Algorithms (WEA '05), Lecture Notes in Computer Science, pp. 77-89, 2005, Santorini Islands, Greece, Springer Verlag
[1]
A. Kaporis, L. M. Kirousis, E. G. Lalas, Selecting complementary pairs of literals, 18th Annual IEEE Symposium on Logic in Computer Science (LICS '03) affiliated Workshop on Typical case complexity and phase transitions, 2003, Ottawa, Canada
[2]
A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, Improved bounds for finger search on a RAM, 11th Annual European Symposium on Algorithms (ESA '03), 2003, Budapest, Hungary
[3]
A. Kaporis, L. M. Kirousis, E. G. Lalas, Lower bounds to the conjectured threshold value for the 3-SAT problem, 4th Pan-Hellenic Logic Symposium (PLS '03), 2003, Thessalonica, Greece
[1]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, How to prove conditional randomness using the principle of deferred decisions, Phase Transitions And Algorithmic Complexity, Institute for Pure and Applied Mathematics (IPAM '02), Jun, 2002, University of California, Los Angeles, USA
[2]
A. Kaporis, L. M. Kirousis, E. G. Lalas, The Probabilistic analysis of a greedy satisfiability algorithm, 10th Annual European Symposium on Algorithms (ESA '02), Lecture Notes in Computer Science, pp. 574-585, Jan, 2002, Rome, Italy, Springer-Verlag
[1]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, M. Zito, Upper bounds to the satisfiability threshold: a review of the rigorous results, Workshop on Computational Complexity and Statistical Physics, Sep, 2001, Santa Fe, New Mexico, USA
[2]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito, Coupon collectors, q-binomial coefficients and the unsatisfiability threshold, 7th Italian Conference on Theoretical Computer Science (ICTCS '01), 2001, Torino, Italy
[3]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito, The unsatisfiability threshold revisited, 16th Annual IEEE Symposium on Logic in Computer Science (LICS '01) affiliated Workshop on Theory and Applications of Satisfiability Testing (SAT '01), 2001, Boston, USA