Eleni Drinea

LECTURER IN DISCIPLINE OF COMPUTER SCIENCE; GRADUATE STUDENT ADVISOR FOR DATA SCIENCE

414 S.W. Mudd
Mail Code 4721

Tel(212) 854-9258

Research Interests

Randomized and graph algorithms, information theory, network coding, algorithms for big data, dimensionality reduction techniques.

Drinea received a BS/MS in Computer Engineering and Informatics from University of Patras, Greece and a PhD in Computer Science from Harvard University.

RESEARCH EXPERIENCE

  • Research associate, Ecole Polytechnique Federale de Lausanne, 2007-2009

PROFESSIONAL EXPERIENCE

  • Lecturer in Discipline of Computer Science, Columbia University, 2014-

PROFESSIONAL AFFILIATIONS

  • Information Theory Society (ITSOC)
  • Institute of Electrical and Electronics Engineers (IEEE)
  • Association for Computing Machinery (ACM)

SELECTED PUBLICATIONS

  • Eleni Drinea, Lorenzo Keller, and Christina Fragouli. Real-time delay with network coding and feedback. Journal of Physical Communication , 6(3):100-113, 2013. Invited article.
  • Adam Kirsch and Eleni Drinea. Directly lower bounding the information capacity for channels with i.i.d. deletions and duplications. IEEE Transactions on Information Theory (ToIT) , 56(1):86-102, 2010.
  • Eleni Drinea and Michael Mitzenmacher. Improved lower bounds for channels with i.i.d. deletions and insertions. IEEE Transactions on Information Theory (ToIT) , 53(8):2693-2714, 2007.
  • Michael Mitzenmacher and Eleni Drinea. A simple lower bound for the capacity of the deletion channel. IEEE Transactions on Information Theory (ToIT) , 52(10):4657-4660, 2006.
  • Eleni Drinea and Michael Mitzenmacher. On lower bounds for the capacity of i.i.d. deletion channels. IEEE Transactions on Information Theory (ToIT), 52(10):4648-4657, 2006.
  • Eleni Drinea, Alan Frieze, and Michael Mitzenmacher. Balls and bins models with feedback. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 308-315, 2002.
  • Petros Drineas, Eleni Drinea, and Patrick Huggins. An experimental evaluation of a Monte-Carlo algorithm for singular value decomposition. Y. Manolopoulos et. al. (Eds.): Revised Selected Papers from the 8th Panhellenic Conference on Informatics, Lecture Notes in Computer Science (LNCS) , 2563:279-296, 2003.