Skip to content

Gabriel Moruz

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

13

Venues

9

Active years

2005–2013

Best venue rank

A*

Where they publish

Papers

13 indexed papers, newest first.

YearVenueTitleAuthors
2013ICALPImproved Space Bounds for Strongly Competitive Randomized Paging Algorithms.Gabriel Moruz, Andrei Negoescu
2012SODAOutperforming LRU via competitive analysis on parametrized inputs for paging.Gabriel Moruz, Andrei Negoescu
2011WAOAOnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.Gerth Stlting Brodal, Gabriel Moruz, Andrei Negoescu
2010ICDMResilient K-d Trees: K-Means in Space Revisited.Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold
2009ISAACCounting in the Presence of Memory Faults.Gerth Stlting Brodal, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave
2009ISAACOnline paging for flash memory devices.Annamria Kovcs, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
2007ESAOptimal Resilient Dynamic Dictionaries.Gerth Stlting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave
2007MFCSAdapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems.Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
2007WADSPriority Queues Resilient to Memory Faults.Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave
2006ESASkewed Binary Search Trees.Gerth Stlting Brodal, Gabriel Moruz
2005ALENEXOn the Adaptiveness of Quicksort.Gerth Stlting Brodal, Rolf Fagerberg, Gabriel Moruz
2005ICALPCache-Aware and Cache-Oblivious Adaptive Sorting.Gerth Stlting Brodal, Rolf Fagerberg, Gabriel Moruz
2005WADSTradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.Gerth Stlting Brodal, Gabriel Moruz