Gabriel Moruz

Publication Activity (10 Years)

Years Active: 2002-2015
Publications (10 Years): 2

Top Topics

Computational Efficiency

Computationally Complex

Top Venues

Inf. Process. Lett.

Theory Comput. Syst.

ACM J. Exp. Algorithmics

Publications

Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
The optimal structure of algorithms for α-paging. Inf. Process. Lett. 115 (12) (2015)
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst. 56 (1) (2015)
Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert
Engineering Efficient Paging Algorithms. ACM J. Exp. Algorithmics 19 (1) (2014)
Gabriel Moruz, Andrei Negoescu
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. ICALP (1) (2013)
Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold
-means in space revisited. Frontiers Comput. Sci. 6 (2) (2012)
Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert
Engineering Efficient Paging Algorithms. SEA (2012)
Gabriel Moruz, Andrei Negoescu
Outperforming LRU via competitive analysis on parametrized inputs for paging. SODA (2012)
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. WAOA (2011)
Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411 (44-46) (2010)
Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold
Resilient K-d Trees: K-Means in Space Revisited. ICDM (2010)
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz
On Computational Models for Flash Memory Devices. SEA (2009)
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
Online paging for flash memory devices. ISAAC (2009)
Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
Counting in the Presence of Memory Faults. ISAAC (2009)
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
On the adaptiveness of Quicksort. ACM J. Exp. Algorithmics 12 (2008)
Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
Priority Queues Resilient to Memory Faults. WADS (2007)
Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
Optimal Resilient Dynamic Dictionaries. ESA (2007)
Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. MFCS (2007)
Gerth Stølting Brodal, Gabriel Moruz
Skewed Binary Search Trees. ESA (2006)
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
On the Adaptiveness of Quicksort. ALENEX/ANALCO (2005)
Gerth Stølting Brodal, Gabriel Moruz
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. WADS (2005)
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
Cache-Aware and Cache-Oblivious Adaptive Sorting. ICALP (2005)
Gabriel Ciobanu, Daniel Dumitriu, Dorin Huzum, Gabriel Moruz, Bogdan Tanasa
Client-Server P Systems in Modeling Molecular Interaction. WMC-CdeA (2002)