Gabriel Moruz

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