Gabriel Moruz

Postdoctoral fellow
PhD, University of Aarhus, 2007

Department of Computer Science, University of Frankfurt,
Robert-Mayer-Straße 11-15, room 312,
60325 Frankfurt/Main, Germany
Email:
gabiat csdotuni-frankfurtdotde
Phone:+49 69 798 28823
Fax:+49 69 798 28814
The copyrights for the papers belong to the relevant publisher of the journal or the conference proceedings.

Journal papers

  1. Resilient K-d Trees: K-Means in Space Revisited. Fabian Gieseke, Gabriel Moruz, and Jan Vahrenhold. In Frontiers of Computer Science, volume 6, number 2, pages 166-178, 2012 (pdf)

  2. 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 (pdf).

  3. On the Adaptiveness of Quicksort. Gerth Stølting 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 (pdf).

Conference papers

  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 (pdf).

  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 (pdf).

  3. OnlineMIN: A Fast Strongly Competitive Paging Algorithm. Gerth Stølting Brodal, Gabriel Moruz, and Andrei Negoescu. In Proc. 9th Workshop on Approximation and Online Algorithms (WAOA), pages 164-175, 2011 (pdf).

  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 (pdf).

  5. Counting in the Presence of Memory Faults. Gerth Støting Brodal, Allan Grønlung Jørgensen, Gabriel Moruz, and Thomas Mølhave. In Proc. 20th International Symposium on Algorithms and Computation (ISAAC), pages 842-851, 2009 (pdf).

  6. Online Paging Tailored for Flash Memory Devices. Annamária Kovács, Ulrich Meyer, Gabriel Moruz, and Andrei Negoescu. In Proc. 20th International Symposium on Algorithms and Computation (ISAAC), pages 352-361, 2009 (pdf).

  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 (pdf).

  8. Optimal Resilient Dynamic Dictionaries. Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlung Jørgensen, Gabriel Moruz, and Thomas Mølhave. In Proc. 14th Annual European Symposium on Algorithms (ESA), pages 347-358, 2007 (pdf).

  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 (pdf).

  10. Resilient Priority Queues. Allan Grønlung Jørgensen, Gabriel Moruz, and Thomas Mølhave. In Proc. 10th International Workshop on Algorithms and Data Structures (WADS), pages 127-138, 2007 (pdf).

  11. Skewed Binary Search Trees. Gerth Stølting Brodal and Gabriel Moruz. In Proc. 14th Annual European Symposium on Algorithms (ESA), pages 708-719, 2006 (pdf).

  12. Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. Gerth Stølting Brodal and Gabriel Moruz. In Proc. 9th International Workshop on Algorithms and Data Structures (WADS), pages 385-395, 2005 (pdf).

  13. Cache-Aware and Cache-Oblivious Adaptive Sorting. Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. In Proc. 32nd International Colloquium on Automata, Languages, and Programming (ICALP), pages 576-588, 2005 (pdf).

  14. On the Adaptiveness of Quicksort. Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. In Proc. 7th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 130-140, 2005 (pdf).

  15. Client-Server P systems in Modeling Molecular Interaction. Gabriel Ciobanu, Daniel Dumitriu, Dorin S. Huzum, Gabriel Moruz, and Bogdan Tanasa. In Proc. International Workshop Membrane Computing, WMC-CdeA, pages 203–218, 2002 (pdf).

Technical reports

  1. Optimal Resilient Dynamic Dictionaries. Gerth Stølting Brodal, Rolf Fagerberg, Allan Grønlung Jørgensen, Gabriel Moruz, and Thomas Mølhave. DAIMI PB-585, Department of Computer Science, University of Aarhus, 14 pages, November 2007 (pdf).

  2. Parallel Algorithms are Good for Streaming. Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, and Andrea Ribichini. Cahier de recherche du LAMSADE no 234, 2006 (pdf).

  3. On the Adaptiveness of Quicksort. Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. BRICS-RS-04-27, BRICS, Department of Computer Science, University of Aarhus, 23 pages, December 2004 (pdf).

Thesis

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


Last update: Thursday, 14th of June 2012.