Follow
Gabi Moruz
Gabi Moruz
J.W. Goethe University Frankfurt am Main
Verified email at cs.uni-frankfurt.de
Title
Cited by
Cited by
Year
Optimal resilient dynamic dictionaries
GS Brodal, R Fagerberg, I Finocchi, F Grandoni, GF Italiano, ...
European Symposium on Algorithms, 347-358, 2007
482007
Priority queues resilient to memory faults
AG Jørgensen, G Moruz, T Mølhave
Algorithms and Data Structures: 10th International Workshop, WADS 2007 …, 2007
442007
On computational models for flash memory devices
D Ajwani, A Beckmann, R Jacob, U Meyer, G Moruz
Experimental Algorithms: 8th International Symposium, SEA 2009, Dortmund …, 2009
372009
On the adaptiveness of quicksort
GS Brodal, R Fagerberg, G Moruz
Journal of Experimental Algorithmics (JEA) 12, 1-20, 2008
312008
Cache-aware and cache-oblivious adaptive sorting
GS Brodal, R Fagerberg, G Moruz
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
212005
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
C Demetrescu, B Escoffier, G Moruz, A Ribichini
Theoretical computer science 411 (44-46), 3994-4004, 2010
192010
Tradeoffs between branch mispredictions and comparisons for sorting algorithms
GS Brodal, G Moruz
Algorithms and Data Structures: 9th International Workshop, WADS 2005 …, 2005
182005
Client–Server P Systems in modeling molecular interaction
G Ciobanu, D Dumitriu, D Huzum, G Moruz, B TanasĂ
Workshop on Membrane Computing, 203-218, 2002
142002
Outperforming LRU via competitive analysis on parametrized inputs for paging
G Moruz, A Negoescu
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012
132012
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
GS Brodal, G Moruz, A Negoescu
Theory of Computing Systems 56, 22-40, 2015
112015
Resilient k-d trees: k-means in space revisited
F Gieseke, G Moruz, J Vahrenhold
Frontiers of Computer Science 6, 166-178, 2012
112012
Counting in the presence of memory faults
GS Brodal, AG Jørgensen, G Moruz, T Mølhave
Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009
112009
Skewed binary search trees
GS Brodal, G Moruz
European Symposium on Algorithms, 708-719, 2006
112006
Adapting parallel algorithms to the w-stream model, with applications to graph problems
C Demetrescu, B Escoffier, G Moruz, A Ribichini
International Symposium on Mathematical Foundations of Computer Science, 194-205, 2007
62007
Online paging for flash memory devices
A Kovács, U Meyer, G Moruz, A Negoescu
Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009
42009
Simulation and prediction of T cell responses
G Ciobanu, B Tanasa, D Dumitriu, D Huzum, G Moruz
Proc. 3rd Intl. Conf. on Systems Biology, 2002
42002
Resilient priority queues
AG Jørgenson, G Moruz, T Mølhave
Proceedings of 10th International Workshop on Algorithms and Data Structures …, 0
4
Molecular networks as communicating membranes
G Ciobanu, B Tanasa, D Dumitriu, D Huzum, G Moruz
Proceedings of Workshop On Membrane Computing, MolCoNet 1, 163-175, 2002
32002
Engineering efficient paging algorithms
G Moruz, A Negoescu, C Neumann, V Weichert
Journal of Experimental Algorithmics (JEA) 19, 1-19, 2015
22015
Improved space bounds for strongly competitive randomized paging algorithms
G Moruz, A Negoescu
International Colloquium on Automata, Languages, and Programming, 757-768, 2013
12013
The system can't perform the operation now. Try again later.
Articles 1–20