Gabriel Moruz

According to our database, Gabriel Moruz authored at least 18 papers between 2002 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.

Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu

Theory Comput. Syst., 2015

The optimal structure of algorithms for α-paging.

Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu

Inf. Process. Lett., 2015

2014

Engineering Efficient Paging Algorithms.

Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert

ACM J. Exp. Algorithmics, 2014

2013

Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms.

Gabriel Moruz, Andrei Negoescu

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Resilient <i>k</i>-d trees: <i>k</i>-means in space revisited.

Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold

Frontiers Comput. Sci., 2012

Outperforming LRU via competitive analysis on parametrized inputs for paging.

Gabriel Moruz, Andrei Negoescu

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010

Adapting parallel algorithms to the W-Stream model, with applications to graph problems.

Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini

Theor. Comput. Sci., 2010

Resilient K-d Trees: K-Means in Space Revisited.

Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold

Proceedings of the ICDM 2010, 2010

2009

On Computational Models for Flash Memory Devices.

Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Online paging for flash memory devices.

Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Counting in the Presence of Memory Faults.

Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

On the adaptiveness of Quicksort.

Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz

ACM J. Exp. Algorithmics, 2008

2007

Priority Queues Resilient to Memory Faults.

Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Optimal Resilient Dynamic Dictionaries.

Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave

Proceedings of the Algorithms, 2007

2006

Skewed Binary Search Trees.

Gerth Stølting Brodal, Gabriel Moruz

Proceedings of the Algorithms, 2006

2005

Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.

Gerth Stølting Brodal, Gabriel Moruz

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Cache-Aware and Cache-Oblivious Adaptive Sorting.

Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2002

Client-Server P Systems in Modeling Molecular Interaction.

Gabriel Ciobanu, Daniel Dumitriu, Dorin Huzum, Gabriel Moruz, Bogdan Tanasa

Proceedings of the Membrane Computing, International Workshop, 2002