Gabriel Moruz

Available identifiers

Publication	Date of Publication	Type
Outperforming LRU via competitive analysis on parametrized inputs for paging	2019-05-10	Paper
On the adaptiveness of Quicksort	2017-06-15	Paper
Engineering efficient paging algorithms	2016-10-24	Paper
The optimal structure of algorithms for \(\alpha\)-paging	2015-09-15	Paper
\textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm	2015-05-12	Paper
Improved space bounds for strongly competitive randomized paging algorithms	2013-08-06	Paper
Resilient \(k\)-d trees: \(k\)-means in space revisited	2012-11-15	Paper
OnlineMin: a fast strongly competitive randomized paging algorithm	2012-07-16	Paper
Adapting parallel algorithms to the W-stream model, with applications to graph problems	2012-04-03	Paper
Online Paging for Flash Memory Devices	2009-12-17	Paper
Counting in the presence of memory faults	2009-12-17	Paper
Priority Queues Resilient to Memory Faults	2009-02-17	Paper
Optimal Resilient Dynamic Dictionaries	2008-09-25	Paper
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems	2008-09-17	Paper
Skewed Binary Search Trees	2008-03-11	Paper
Algorithms and Data Structures	2006-10-25	Paper
Automata, Languages and Programming	2006-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4413827	2003-07-21	Paper

This page was built for person: Gabriel Moruz