| Optimal resilient dynamic dictionaries GS Brodal, R Fagerberg, I Finocchi, F Grandoni, GF Italiano, ... European Symposium on Algorithms, 347-358, 2007 | 48 | 2007 |
| Priority queues resilient to memory faults AG Jørgensen, G Moruz, T Mølhave Algorithms and Data Structures: 10th International Workshop, WADS 2007 …, 2007 | 44 | 2007 |
| 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 | 36 | 2009 |
| On the adaptiveness of quicksort GS Brodal, R Fagerberg, G Moruz Journal of Experimental Algorithmics (JEA) 12, 1-20, 2008 | 30 | 2008 |
| Cache-aware and cache-oblivious adaptive sorting GS Brodal, R Fagerberg, G Moruz Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005 | 20 | 2005 |
| 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 | 18 | 2010 |
| Tradeoffs between branch mispredictions and comparisons for sorting algorithms GS Brodal, G Moruz Algorithms and Data Structures: 9th International Workshop, WADS 2005 …, 2005 | 17 | 2005 |
| 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 | 14 | 2002 |
| 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 | 13 | 2012 |
| Resilient k-d trees: k-means in space revisited F Gieseke, G Moruz, J Vahrenhold Frontiers of Computer Science 6, 166-178, 2012 | 11 | 2012 |
| 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 | 11 | 2009 |
| Skewed binary search trees GS Brodal, G Moruz European Symposium on Algorithms, 708-719, 2006 | 11 | 2006 |
| OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm GS Brodal, G Moruz, A Negoescu Theory of Computing Systems 56, 22-40, 2015 | 10 | 2015 |
| 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 | 6 | 2007 |
| Online paging for flash memory devices A Kovács, U Meyer, G Moruz, A Negoescu Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009 | 4 | 2009 |
| 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 | 4 | 2002 |
| 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 | 3 | 2002 |
| Engineering efficient paging algorithms G Moruz, A Negoescu, C Neumann, V Weichert Journal of Experimental Algorithmics (JEA) 19, 1-19, 2015 | 2 | 2015 |
| Improved space bounds for strongly competitive randomized paging algorithms G Moruz, A Negoescu International Colloquium on Automata, Languages, and Programming, 757-768, 2013 | 1 | 2013 |
