During my undergraduate studies in the Computer Science Department at University of Crete, I was a scholar in Telecommunications and Networks Laboratory of Institute of Computer Science (ICS-FORTH) and joined the research team of Panagiotis Tsakalides. I also participated in the ’Aspire Project’ funded by the European Commission. During my Master in the same department I was a graduate research assistant at Computational Medicine Laboratory of ICS-FORTH under the supervision of Ioannis G. Tollis.


I am currently a PhD candidate in the Computer Science Department of Brown University working with Prof. Roberto Tamassia. I am a proud recipient of the "Paris Kanellakis Fellowship" and the "Gerondelis Foundation Fellowship". During the academic year 2012-2013 I participated in the "BIGDATA" project led by Prof. Eli Upfal.



Education


BROWN UNIVERSITY, USA

Ph.D. in Computer Science, 2012-present
Advisor:
Roberto Tamassia
Paris Kanellakis Fellowship
Gerondelis Foundation Fellowship

UNIVERSITY OF CRETE, GREECE

M.Sc. in Computer Science, Algorithms and System Analysis, 2012
Advisor:
Ioannis G. Tollis
Foundation for Research and Technology Hellas (ICS-FORTH) Scholarship

Diploma in Computer Science, 2009
Advisor:
Panagiotis Tsakalides

Foundation for Research and Technology Hellas (ICS-FORTH) Scholarship

Publications

Preprints

[IACR ePrint]     E.M.Kornaropoulos and P. Efstathopoulos, "Breaking and Fixing Secure Similarity Approximations: Dealing with Adversarially Perturbed Inputs", September 2017.


Referred Conferences

[EuroS&P]     M.T.Goodrich, E.M.Kornaropoulos, M.Mitzenmacher, and R. Tamassia, "Auditable Data Structures", 2nd IEEE European Symposium on Security and Privacy (Euro S&P'17), April 2017

[ESORICS]     M.T.Goodrich, E.M.Kornaropoulos, M.Mitzenmacher, and R. Tamassia, "More Practical and Secure History-Independent Hash Tables", 21st European Symposium on Research in Computer Security (ESORICS'16), September 2016

[COCOA]     A. Mahmoody, E.M.Kornaropoulos, and E. Upfal, "Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection", 9th Conference on Combinatorial Optimization and Applications (COCOA'15), December 2015

[WSDM]     M.Riondato and E.M.Kornaropoulos, "Fast Estimation of Betweenness Centrality through Sampling", 7th International Conference on Web Search and Web Data Mining (WSDM'14), pp.413-422, March 2014

[GD]     E.M.Kornaropoulos and I.G.Tollis, “Weak Dominance Drawing for Directed Acyclic Graphs”, in Proceedings of the 20th International Symposium on Graph Drawing (GD'12), LNCS vol. 7704, pp. 499-510, Springer-Verlag, September, 2012.

[GD]     E.M.Kornaropoulos and I.G.Tollis, “DAGView: An Approach for Visualizing Large Graphs”, in Proceedings of the 20th International Symposium on Graph Drawing (GD'12), LNCS vol. 7704, pp. 559-560, Springer-Verlag, September, 2012.

[GD]     E.M.Kornaropoulos and I.G.Tollis, “Overloaded Orthogonal Drawings”, in Proceedings of the 19th International Symposium on Graph Drawing (GD'11), LNCS vol. 7034, pp. 242-253, Springer-Verlag, September, 2011.

[SSP]     E.M.Kornaropoulos and P.Tsakalides, “A Novel knn Classifier for Acoustic Vehicle Classification Based on Alpha Stable Statistical Modeling”, in Proc. 2009 IEEE 15th Workshop on Statistical Signal Processing (SSP ’09), Cardiff, Wales, UK, August 31- September 3, 2009.



Referred Journals

[DMKD]     M.Riondato and E.M.Kornaropoulos, " Fast Approximation of Betweenness Centrality through Sampling , in Journal of Data Mining and Knowledge Discovery (DMKD), 30(2): 438-475 (2016).

[JGAA]     E.M.Kornaropoulos and I.G.Tollis, Algorithms for Overloaded Orthogonal Drawings , in Journal of Graph Algorithms and Applications, (JGAA), 20(2): 217-246 (2016).



Other

Evgenios M. Kornaropoulos. Dominance Drawing of Non-Planar Graphs. Master's thesis, University of Crete, Heraklion, Greece, June 2012.



Graduate Courses Attended @ Brown University



Graduate Courses Attended @ University of Crete

  • CS-577: Machine Learning
  • CS-531: Information Theory
  • CS-580: Topics in Algorithm Design
  • CS-583: Graph Algorithms
  • CS-590.71: Topics in Discrete Optimization
  • CS-695: Randomized Algorithms
  • AM-383: Game Theory
  • CS-564: Advanced Topics on Human-Computer Interaction
  • CS-582.1: Computational Number Theory & Cryptography
  • CS-482: Algorithms in Bioinformatics