Curriculum vitæ







\scalebox{1}{\includegraphics{gabi_suit.eps}}
Name Gabriel Moruz
Born 1979, December 21st, Iasi, Romania
Citizenship Romanian
Address Department of Computer Science
  Goethe-University Frankfurt am Main
  Robert-Mayer-Straße 11-15
  60325 Frankfurt am Main
  Germany
Phone +49 (0) 69 798 28823
Mobile +49 (0) 152 24228302
Fax +49 (0) 69 798 28814
Email gabi@cs.uni-frankfurt.de
www www.cs.uni-frankfurt.de/~gabi

Education

Aug. 2003 - Jul. 2007 Ph.D. in Computer Science, University of Aarhus, Denmark.
  Dissertation: Hardware-Aware Algorithms and Data Structures
  Advisor: Gerth S. Brodal
  Committee: Ivan Damgård (Århus), Giuseppe F. Italiano (Rome),
  Ulrich Meyer (Frankfurt)
Sep. 2005 - Jan. 2006 Research stage, Univeristy of Rome ``La Sapienza'', Italy
Jul. 2002 - Jan. 2003 Research internship, National University of Singapore, Singapore
Oct. 1998 - Jun. 2002 B.Sc., ``Al. I. Cuza'' University of Iasi, Romania

Positions

Oct. 2011 - present Postdoc, own position, Goethe University Frankfurt am Main, Germany
Oct. 2007 - Sep. 2011 Postdoc, Chair for Algorithm Engineering,
  Goethe University Frankfurt am Main, Germany

Funding

Oct. 2011 - Sep. 2013 Funding (postdoc) for own position, from Deutsche
  Forschungsgemeinschaft (DFG)

Publications

Journal articles

  1. OnlineMIN: A Fast Strongly Competitive Paging Algorithm. Gerth S. Brodal, Gabriel Moruz, and Andrei Negoescu. in Theory of Computing Systems (ToCS), Special issue of the 9th Workshop on Approximation and Online Algorithms, 2013. To appear.
  2. Resilient K-d Trees: K-Means in Space Revisited. Fabian Gieseke, Gabriel Moruz, and Jan Vahrenhold. In Frontiers of Computer Science. In Frontiers of Computer Science, volume 6, number 2, pages 166-178, 2012.
  3. Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, and Andrea Ribichini. In Theoretical Computer Science, volume 411, number 44-46, pages 3994-4004, 2010.
  4. On the Adaptiveness of Quicksort. Gerth S. Brodal, Rolf Fagerberg, and Gabriel Moruz. In ACM Journal of Experimental Algorithmics, Special Issue on 7th Workshop on Algorithm Engineering and Experiments, volume 12, pages 1-20, 2008.

Conference articles

  1. Engineering Efficient Paging Algorithms. Gabriel Moruz, Andrei Negoescu, Christian Neumann, and Volker Weichert. In Proc. 11th International Symposium on Experimental Algorithms (SEA), pages 320-331, 2012.
  2. Outperforming LRU via Competitive Analysis on Parametrized Inputs for Paging. Gabriel Moruz and Andrei Negoescu. In Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1669-1680, 2012.
  3. OnlineMIN: A Fast Strongly Competitive Paging Algorithm. Gerth S. Brodal, Gabriel Moruz, and Andrei Negoescu. In Proc. 9th Workshop on Approximation and Online Algorithms (WAOA), pages 164-175, 2011.
  4. Resilient k-d trees: k-means in space revisited. Fabian Gieseke, Gabriel Moruz, and Jan Vahrenhold. In Proc. 10th IEEE Conference on Data Mining (ICDM), pages 815-820, 2010.
  5. Counting in the Presence of Memory Faults. Gerth S. Brodal, Allan G. Jørgensen, Gabriel Moruz, and Thomas Mølhave. In Proc. 20th International Symposium on Algorithms and Computation (ISAAC), pages 842-851, 2009.
  6. Online Paging Tailored for Flash Memory Devices. Annamaria Kovacs, Ulrich Meyer, Gabriel Moruz, and Andrei Negoescu. In Proc. 20th International Symposium on Algorithms and Computation (ISAAC), pages 352-361, 2009.
  7. On Computational Models for Flash Memory Devices. Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer and Gabriel Moruz. In Proc. 8th International Symposium on Experimental Algorithms (SEA), pages 16-27, 2009.
  8. Optimal Resilient Dynamic Dictionaries. Gerth S. Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan G. Jørgensen, Gabriel Moruz, and Thomas Mølhave. In Proc. 14th Annual European Symposium on Algorithms (ESA), pages 347-358, 2007.
  9. Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, and Andrea Ribichini. In Proc. 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 194-205, 2007.
  10. Resilient Priority Queues. Allan G. Jørgensen, Gabriel Moruz, and Thomas Mølhave. In Proc. 10th International Workshop on Algorithms and Data Structures (WADS), pages 127-138, 2007.
  11. Skewed Binary Search Trees. Gerth S. Brodal and Gabriel Moruz. In Proc. 14th Annual European Symposium on Algorithms (ESA), pages 708-719, 2006.
  12. Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. Gerth S. Brodal and Gabriel Moruz. In Proc. 9th International Workshop on Algorithms and Data Structures (WADS), pages 385-395, 2005.
  13. Cache-Aware and Cache-Oblivious Adaptive Sorting. Gerth S. Brodal, Rolf Fagerberg, and Gabriel Moruz. In Proc. 32nd International Colloquium on Automata, Languages, and Programming (ICALP), pages 576-588, 2005.
  14. On the Adaptiveness of Quicksort. Gerth S. Brodal, Rolf Fagerberg, and Gabriel Moruz. In Proc. 7th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 130-140, 2005.
  15. Client-Server P systems in Modeling Molecular Interaction. Gabriel Ciobanu, Daniel Dumitriu, Dorin S. Huzum, Gabriel Moruz, and Bogdan Tanasa. In Proc. Membrane Computing, International Workshop, WMC-CdeA, pages 203-218, 2002.

Technical reports

  1. Optimal Resilient Dynamic Dictionaries. Gerth S. Brodal, Rolf Fagerberg, Allan G. Jørgensen, Gabriel Moruz, and Thomas Mølhave. DAIMI PB-585, Department of Computer Science, University of Aarhus, 14 pages, November 2007.
  2. Parallel Algorithms are Good for Streaming. Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, and Andrea Ribichini. Cahier de recherche du LAMSADE no 234, 2006.
  3. On the Adaptiveness of Quicksort. Gerth S. Brodal, Rolf Fagerberg, and Gabriel Moruz. BRICS-RS-04-27, BRICS, Department of Computer Science, University of Aarhus, 23 pages, December 2004.

Thesis

  1. Hardware-Aware Algorithms and Data Structures. Gabriel Moruz. Ph.D. dissertation, University of Aarhus, 2007.

Submissions

  1. Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. Gabriel Moruz and Andrei Negoescu. Submitted to the 40th International Colloquium on Automata, Languages, and Programming (ICALP), 2013.
  2. Engineering Efficient Paging Algorithms. Gabriel Moruz, Andrei Negoescu, Christian Neumann, and Volker Weichert. Submitted to Journal of Experimental Algorithmics, Special issue of the 11th Symposium on Experimental Algorithms.

Program Committees

Advising

Teaching

Conference and workshop participation

Summer school participation

Journal reviewer

Conference reviewer

References

Language skills

Besides Romanian (my mother tongue), I am fluent in English, at a good level in German, French, and Italian, and at an intermediate level in Danish.

Last updated: February 26, 2013



Gabriel Moruz 2013-02-26