Εκπαίδευση - Σπουδές

Πτυχίο: Τμήμα Μαθηματικών, Π. Πατρών.

Διδακτορικό: Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής

Μεταδιδακτορικός Ερευνητής: Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής

Συνεργάτης Ερευνητής: Ερευνητική Μονάδα Ένα, Ερευνητικό Ακαδημαϊκο Ινστιτούτο Τεχνολογίας Υπολογιστών.

Ερευνητικά Ενδιαφέροντα

Αλγόριθμοι και Πολυπλοκότητα, Πιθανοτικές Τεχνικές, Δυναμικές Δομές Δεδομένων, Αλγοριθμική Θεωρία Παιγνίων, Βιοπληροφορική.

Μια μεγάλη τιμή για την εργασία The Probabilistic Analysis of a Greedy Satisfiability Algorithm (συ-συγγραφείς Λ. Κυρούσης, Ε. Λάλας) είναι η αναφορά της στην διάσημη σειρά τόμων του Καθηγητή Don Knuth The art of the computer programming. (“Οι 12 καλύτερες μονογραφίες του αιώναAmerican Scientist, “Αν νομίζεις ότι είσαι καλός προγραμματιστής… διάβασε τη συλλογή The art of the computer programming …” Bill Gates). Σε αυτό τον τόμο ο Καθηγητής Don Knuth με μοναδικά γλαφυρό αλλά και αυστηρό τρόπο παρουσιάζει τους σπουδαιότερους συνδυαστικούς αλγόριθμους.

Μια μεγάλη τιμή για την ερευνητική πρόταση “Αλγοριθμική Θεωρία Παιγνίων” όπου συμμετέχει είναι η επίτευξη της 1ης θέσης πανελλαδικά στο διαγωνισμό Θαλής στην περιοχή των Επιστημών Μηχανικών Πληροφορικής. Ο Συντονιστής της πρότασης είναι ο Καθηγητής Παύλος Σπυράκης

Διδασκαλία

Θεωρία Υπολογισμού, Αλγόριθμοι και Πολυπλοκότητα, Υπολογιστική Πολυπλοκότητα, Θεωρία Παιγνίων, Συνδυαστική Βελτιστοποίηση. 

 

Δημοσιεύσεις σε Διεθνή Περιοδικά (Journals)


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.


A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, Dynamic Interpolation Search revisited, Information and Computation, 2019, Elsevier, (to_appear), https://www.sciencedirect.com/scien...
[2]
Gerth Stolting Brodal, A. Kaporis, A. Papadopoulos, S. Sioutas, K. Tsakalidis, K. Tsichlas, Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time, Theoretical Computer Science, 2014, Springer, (to_appear), http://www.journals.elsevier.com/th..., IF = 0.697
[3]
D. Fotakis, A. Kaporis, T. Lianeas, P. Spirakis, On the Hardness of Network Design for Bottleneck Routing Games, Theoretical Computer Science, 2013, (to_appear),
[4]
A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, Improved bounds for finger search on a RAM, Algorithmica, Vol. 66, No. 2, pp. 249-286, 2013, Springer, http://link.springer.com/article/10...
[5]
D. Fotakis, V. Gkatzelis, A. Kaporis, P. Spirakis, The Impact of Social Ignorance on Weighted Congestion Games, Theory of Computing Systems, Vol. 3, No. 50, pp. 559-578, 2012, Elsevier, http://link.springer.com/article/10...
[6]
D. Fotakis, P. Spirakis, A. Kaporis, Efficient methods for selfish network design. , Theor. Comput. Sci. , Vol. 448, pp. 9-20 , 2012, Elsevier, http://www.sciencedirect.com/scienc...
[7]
A. Kaporis, P. Spirakis, Selfish splittable flows and NP-completeness, Computer Science Reviews, Vol. 5, No. 3, pp. 209-228, 2011, Elsevier, http://www.sciencedirect.com/scienc...
[8]
A. Kaporis, C. Makris, G. Mavritsakis, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour, Journal of Discrete Algorithms, Vol. 8, No. 4, pp. 373-387 , 2010, http://www.sciencedirect.com/scienc...
[9]
D. Fotakis, A. Kaporis, P. Spirakis, Atomic congestion games: fast, myopic and concurrent, Theory of Computing Systems, Vol. 47, No. 1, pp. 38-59, 2010, http://link.springer.com/article/10...
[10]
J. Diaz, A. Kaporis, G. Kemkes, L. M. Kirousis, X. Perez, N. C. Wormald, On the chromatic number of a random 5-regular graph, Journal of Graph Theory, Vol. 61, No. 3, pp. 157-191, 2009, Wiley, http://onlinelibrary.wiley.com/doi/...
[11]
A. Kaporis, P. Spirakis, The price of Optimum in Stackelberg games on arbitrary networks, Theoretical Computer Science, 2009, http://www.sciencedirect.com/scienc...
[12]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito, The unsatisfiability threshold revisited, Discrete Applied Mathematics, Vol. 155, No. 12, pp. 1525-1538, 2007, Elsevier, http://www.sciencedirect.com/scienc...
[13]
A. Kaporis, L. M. Kirousis, E. G. Lalas, The probabilistic analysis of a greedy satisfiability algorithm, Random Structures and Algorithms, Vol. 28, No. 4, pp. 444--480, 2006, Wiley, http://onlinelibrary.wiley.com/doi/...
[14]
A. Kaporis, L. M. Kirousis, E. G. Lalas, Selecting complementary pairs of literals, Electronic Notes in Discrete Mathematics (ENDM), Vol. 16, pp. 47-70, 2003, Elsevier Science, http://www.sciencedirect.com/scienc...
[15]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito, The unsatisfiability threshold revisited., Electronic Notes in Discrete Mathematics (ENDM), Vol. 9, pp. 81-95, 2001, Springer, http://www.sciencedirect.com/scienc...
[16]
A. Kaporis, L. M. Kirousis, E. Kranakis, D. Krizanc, Y. Stamatiou, E. C. Stavropoulos, Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval, Computer Journal, Vol. 44, No. 4, pp. 221—229, 2001, http://comjnl.oxfordjournals.org/co...
[17]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, A note on the non-colorability threshold of a random graph, Electronic Journal of Combinatorics, Vol. 7, No. 1, 2000, http://www.combinatorics.org/ojs/in...
[18]
A. Kaporis, L. M. Kirousis, I. Giotis, Corrigendum to: A note on the non-colorability threshold of a random graph, Electronic Journal of Combinatorics, Vol. 7, No. 1, 2000,

Επιστημονικά Συνέδρια (Conferences)


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.


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/
[2]
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,
[3]
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, Dec, 2012,
[4]
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), Dec, 2010,
[5]
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), Dec, 2010,
[6]
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,
[7]
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) , Dec, 2009, HAWAI,
[8]
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,
[9]
D. Fotakis, A. Kaporis, P. Spirakis, Atomic congestion games: fast, myopic and concurrent, 1st International Symposium on Algorithmic Game Theory, Apr, 2008, Paderborn, Germany,
[10]
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,
[11]
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,
[12]
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 ,
[13]
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,
[14]
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,
[15]
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,
[16]
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, Dec, 2005, Santorini Islands, Greece, Springer Verlag,
[17]
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), Dec, 2003, Thessalonica, Greece,
[18]
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), Dec, 2003, Budapest, Hungary,
[19]
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, Dec, 2003, Ottawa, Canada,
[20]
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,
[21]
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,
[22]
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,
[23]
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), Dec, 2001, Boston, USA,
[24]
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), Dec, 2001, Torino, Italy,

Βιβλία


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.


Κεφάλαια σε Βιβλία


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.


[1]
D. Kalles, A. Kaporis, V. Mperoukli, A. Chatzinouskas, Discovery of Emergent Sorting behavior using Swarm Intelligence and Grid-enabled Genetic Algorithms, chapter in: Biologically-Inspired Techniques for Knowledge Discovery and Data Mining, Dr. Shafiq Alam, Dr. Yun Sing Koh, Prof. Gillian Dobbie, U. Auckland, New Zeland, (eds), pp. , 2013, IGI Global, (to_appear),
A. Kaporis, L. M. Kirousis, E. G. Lalas, Thresholds for random k-SAT , chapter in: The Encyclopedia of Algorithms, Ming-Yang Kao, 2008, Springer,
[3]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, Proving Conditional Randomness using the Principle of Deferred Decisions, chapter in: Computational Complexity and Statistical Physics, 2005, Oxford University Press,
A. Kaporis, P. Spirakis, Algorithms for the Price of Optimum in Stackelberg Games , chapter in: The Encyclopedia of Algorithms, 2005, Springer,

Επιμέλεια Πρακτικών Διεθνών Συνεδρίων


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.