Andreas Pavlogiannis

Andreas Pavlogiannis 

Andreas Pavlogiannis
Graduate Student
Department of Computer Science
UC Davis

apavlogiannis<at>ucdavis<dot>edu

paulogiann<at>ceid<dot>upatras<dot>gr

News
June ’11

Attended FCRC ’11 in San Jose.

Feb ’11

My undergraduate thesis in a book: New Models for Population Protocols from Morgan&Claypool Publishers.

Education

Research Interests

  • My main interest falls in the union of Algorithms, Theory of Computation and Complexity, and Logic. I also find that Descriptive Complexity and Game Theory have a significant role in unraveling the mysteries of life.

  • I enjoy the precise formulation of problems arising from other fields (especially sociology and biology) and evaluating the proposed solutions. Lately, part of my work involves developing graph theoretic algorithms for analyzing biological networks.

  • In the recent past, I worked in the area of Distributed Computing and Sensor Networks, developing models adequate for describing situations of passive mobility, and studying their computability and space complexity.

  • I find Machine Learning a convenient tool for analyzing existing information, (but nothing more than that).

Publications

  • 2011

    • Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis: Passively Mobile Communicating Machines that Use Restricted Space. Theor. Comput. Sci. Accepted Paper (pdf)

    • Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis: Passively mobile communicating machines that use restricted space. FOMC 2011: 6-15 (pdf) (pres)

  • 2010

    • Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis: All Symmetric Predicates in NSPACE(n^2) Are Stably Computable by the Mediated Population Protocol Model. MFCS 2010: 270-281 (pdf)

    • Filippas, Apostolos, Nikolaou, Stavros, Pavlogiannis, Andreas, Michail, Othon, Chatzigiannakis, Ioannis and Spirakis, Paul: Computational Models for Wireless Sensor Networks: A Survey, in: 1st International Conference for Undergraduate and Postgraduate Students in Computer Engineering, Informatics, related Technologies and Applications (Eureka!), Ancient Olympia, Greece, 2010 (pdf)

Random Habits

  • Travelling around cities, selling my products. It can get really difficult!

  • Creating self-referencial statements (like this one!).

  • Stating tautological sentences or not stating tautological sentences.

  • Drawing in a hyperplane.

  • Counting to infinity as fast as I can.

  • Guessing whether a machine will halt on input w.