Client-Server P Systems in Modeling Molecular Interaction. - Gabriel Ciobanu; Daniel Dumitriu; Dorin Huzum; Gabriel Moruz; Bogdan Tanasa (WMC-CdeA, 2002)

Cache-Aware and Cache-Oblivious Adaptive Sorting. - Gerth Stølting Brodal; Rolf Fagerberg; Gabriel Moruz (ICALP, 2005)

Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. - Gerth Stølting Brodal; Gabriel Moruz (WADS, 2005)

Skewed Binary Search Trees. - Gerth Stølting Brodal; Gabriel Moruz (ESA, 2006)

Optimal Resilient Dynamic Dictionaries. - Gerth Stølting Brodal; Rolf Fagerberg; Irene Finocchi; Fabrizio Grandoni 001; Giuseppe F. Italiano; Allan Grønlund Jørgensen; Gabriel Moruz; Thomas Mølhave (ESA, 2007)

Priority Queues Resilient to Memory Faults. - Allan Grønlund Jørgensen; Gabriel Moruz; Thomas Mølhave (WADS, 2007)

On the adaptiveness of Quicksort. - Gerth Stølting Brodal; Rolf Fagerberg; Gabriel Moruz (ACM J. Exp. Algorithmics, 2008)

Counting in the Presence of Memory Faults. - Gerth Stølting Brodal; Allan Grønlund Jørgensen; Gabriel Moruz; Thomas Mølhave (ISAAC, 2009)

Online paging for flash memory devices. - Annamária Kovács; Ulrich Meyer 001; Gabriel Moruz; Andrei Negoescu (ISAAC, 2009)

On Computational Models for Flash Memory Devices. - Deepak Ajwani; Andreas Beckmann; Riko Jacob; Ulrich Meyer 001; Gabriel Moruz (SEA, 2009)

Resilient K-d Trees: K-Means in Space Revisited. - Fabian Gieseke; Gabriel Moruz; Jan Vahrenhold (ICDM, 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)

Outperforming LRU via competitive analysis on parametrized inputs for paging. - Gabriel Moruz; Andrei Negoescu (SODA, 2012)

Resilient k-d trees: k-means in space revisited. - Fabian Gieseke; Gabriel Moruz; Jan Vahrenhold (Frontiers Comput. Sci., 2012)

Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. - Gabriel Moruz; Andrei Negoescu (ICALP (1), 2013)

Engineering Efficient Paging Algorithms. - Gabriel Moruz; Andrei Negoescu; Christian Neumann; Volker Weichert (ACM J. Exp. Algorithmics, 2014)

The optimal structure of algorithms for α-paging. - Annamária Kovács; Ulrich Meyer 001; Gabriel Moruz; Andrei Negoescu (Inf. Process. Lett., 2015)

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. - Gerth Stølting Brodal; Gabriel Moruz; Andrei Negoescu (Theory Comput. Syst., 2015)