Gabriel Moruz

Photo
Institut für Informatik
 
gabi@cs.uni-frankfurt.de

Publications

1
Gerth Stølting Brodal, Gabriel Moruz, and Andrei Negoescu. Onlinemin: A fast strongly competitive randomized paging algorithm. Theory Comput. Syst., 56(1):22–40, 2015. View Online doi:10.1007/s00224-012-9427-y @article{DBLP:journals/mst/BrodalMN15, author = "Brodal, Gerth St{\o}lting and Moruz, Gabriel and Negoescu, Andrei", biburl = "https://dblp.org/rec/journals/mst/BrodalMN15.bib", doi = "10.1007/s00224-012-9427-y", journal = "Theory Comput. Syst.", number = "1", pages = "22--40", title = "OnlineMin: {A} Fast Strongly Competitive Randomized Paging Algorithm", url = "https://doi.org/10.1007/s00224-012-9427-y", volume = "56", year = "2015" }
2
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, and Andrei Negoescu. The optimal structure of algorithms for α-paging. Inf. Process. Lett., 115(12):932–938, 2015. View Online doi:10.1016/j.ipl.2015.07.011 @article{DBLP:journals/ipl/KovacsMMN15, author = "Kov{\'{a}}cs, Annam{\'{a}}ria and Meyer, Ulrich and Moruz, Gabriel and Negoescu, Andrei", biburl = "https://dblp.org/rec/journals/ipl/KovacsMMN15.bib", doi = "10.1016/j.ipl.2015.07.011", journal = "Inf. Process. Lett.", number = "12", pages = "932--938", title = "The optimal structure of algorithms for {\(\alpha\)}-paging", url = "https://doi.org/10.1016/j.ipl.2015.07.011", volume = "115", year = "2015" }
3
Gabriel Moruz, Andrei Negoescu, Christian Neumann, and Volker Weichert. Engineering efficient paging algorithms. ACM Journal of Experimental Algorithmics, 2014. View Online doi:10.1145/2670127 @article{DBLP:journals/jea/MoruzNNW14, author = "Moruz, Gabriel and Negoescu, Andrei and Neumann, Christian and Weichert, Volker", biburl = "https://dblp.org/rec/journals/jea/MoruzNNW14.bib", doi = "10.1145/2670127", journal = "{ACM} Journal of Experimental Algorithmics", number = "1", title = "Engineering Efficient Paging Algorithms", url = "https://doi.org/10.1145/2670127", volume = "19", year = "2014" }
4
Gabriel Moruz, Andrei Negoescu, Christian Neumann, and Volker Weichert. Engineering efficient paging algorithms. In Ralf Klasing, editor, Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, volume 7276 of Lecture Notes in Computer Science, 320–331. Springer, 2012. View Online doi:10.1007/978-3-642-30850-5_28 @inproceedings{DBLP:conf/wea/MoruzNNW12, author = "Moruz, Gabriel and Negoescu, Andrei and Neumann, Christian and Weichert, Volker", editor = "Klasing, Ralf", biburl = "https://dblp.org/rec/conf/wea/MoruzNNW12.bib", booktitle = "Experimental Algorithms - 11th International Symposium, {SEA} 2012, Bordeaux, France, June 7-9, 2012. Proceedings", doi = "10.1007/978-3-642-30850-5\_28", pages = "320--331", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Engineering Efficient Paging Algorithms", url = "https://doi.org/10.1007/978-3-642-30850-5\_28", volume = "7276", year = "2012" }
5
Gabriel Moruz and Andrei Negoescu. Outperforming LRU via competitive analysis on parametrized inputs for paging. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, 1669–1680. SIAM, 2012. View Online doi:10.1137/1.9781611973099.132 @inproceedings{DBLP:conf/soda/MoruzN12, author = "Moruz, Gabriel and Negoescu, Andrei", editor = "Rabani, Yuval", biburl = "https://dblp.org/rec/conf/soda/MoruzN12.bib", booktitle = "Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012", doi = "10.1137/1.9781611973099.132", pages = "1669--1680", publisher = "{SIAM}", title = "Outperforming {LRU} via competitive analysis on parametrized inputs for paging", url = "https://doi.org/10.1137/1.9781611973099.132", year = "2012" }
6
Gerth Stølting Brodal, Gabriel Moruz, and Andrei Negoescu. Onlinemin: A fast strongly competitive randomized paging algorithm. In Roberto Solis-Oba and Giuseppe Persiano, editors, Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers, volume 7164 of Lecture Notes in Computer Science, 164–175. Springer, 2011. View Online doi:10.1007/978-3-642-29116-6_14 @inproceedings{DBLP:conf/waoa/BrodalMN11, author = "Brodal, Gerth St{\o}lting and Moruz, Gabriel and Negoescu, Andrei", editor = "Solis{-}Oba, Roberto and Persiano, Giuseppe", biburl = "https://dblp.org/rec/conf/waoa/BrodalMN11.bib", booktitle = {Approximation and Online Algorithms - 9th International Workshop, {WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011, Revised Selected Papers}, doi = "10.1007/978-3-642-29116-6\_14", pages = "164--175", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "OnlineMin: {A} Fast Strongly Competitive Randomized Paging Algorithm", url = "https://doi.org/10.1007/978-3-642-29116-6\_14", volume = "7164", year = "2011" }
7
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, and Gabriel Moruz. On computational models for flash memory devices. In Jan Vahrenhold, editor, Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, volume 5526 of Lecture Notes in Computer Science, 16–27. Springer, 2009. View Online doi:10.1007/978-3-642-02011-7_4 @inproceedings{DBLP:conf/wea/AjwaniBJMM09, author = "Ajwani, Deepak and Beckmann, Andreas and Jacob, Riko and Meyer, Ulrich and Moruz, Gabriel", editor = "Vahrenhold, Jan", biburl = "https://dblp.org/rec/conf/wea/AjwaniBJMM09.bib", booktitle = "Experimental Algorithms, 8th International Symposium, {SEA} 2009, Dortmund, Germany, June 4-6, 2009. Proceedings", doi = "10.1007/978-3-642-02011-7\_4", pages = "16--27", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "On Computational Models for Flash Memory Devices", url = "https://doi.org/10.1007/978-3-642-02011-7\_4", volume = "5526", year = "2009" }
8
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, and Andrei Negoescu. Online paging for flash memory devices. In Yingfei Dong, Ding-Zhu Du, and Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, volume 5878 of Lecture Notes in Computer Science, 352–361. Springer, 2009. View Online doi:10.1007/978-3-642-10631-6_37 @inproceedings{DBLP:conf/isaac/KovacsMN09, author = "Kov{\'{a}}cs, Annam{\'{a}}ria and Meyer, Ulrich and Moruz, Gabriel and Negoescu, Andrei", editor = "Dong, Yingfei and Du, Ding{-}Zhu and Ibarra, Oscar H.", biburl = "https://dblp.org/rec/conf/isaac/KovacsMN09.bib", booktitle = "Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings", doi = "10.1007/978-3-642-10631-6\_37", pages = "352--361", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Online paging for flash memory devices", url = "https://doi.org/10.1007/978-3-642-10631-6\_37", volume = "5878", year = "2009" }
9
Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, and Andrea Ribichini. Adapting parallel algorithms to the w-stream model, with applications to graph problems. In Ludek Kucera and Anton\'ın Kucera, editors, Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, volume 4708 of Lecture Notes in Computer Science, 194–205. Springer, 2007. View Online doi:10.1007/978-3-540-74456-6_19 @inproceedings{DBLP:conf/mfcs/DemetrescuEMR07, author = "Demetrescu, Camil and Escoffier, Bruno and Moruz, Gabriel and Ribichini, Andrea", editor = "Kucera, Ludek and Kucera, Anton{\'{\i}}n", biburl = "https://dblp.org/rec/conf/mfcs/DemetrescuEMR07.bib", booktitle = "Mathematical Foundations of Computer Science 2007, 32nd International Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic, August 26-31, 2007, Proceedings", doi = "10.1007/978-3-540-74456-6\_19", pages = "194--205", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems", url = "https://doi.org/10.1007/978-3-540-74456-6\_19", volume = "4708", year = "2007" }
10
Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, and Thomas Mølhave. Optimal resilient dynamic dictionaries. In Lars Arge, Michael Hoffmann, and Emo Welzl, editors, Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, volume 4698 of Lecture Notes in Computer Science, 347–358. Springer, 2007. View Online doi:10.1007/978-3-540-75520-3_32 @inproceedings{DBLP:conf/esa/BrodalFFGIJMM07, author = "Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. and J{\o}rgensen, Allan Gr{\o}nlund and Moruz, Gabriel and M{\o}lhave, Thomas", editor = "Arge, Lars and Hoffmann, Michael and Welzl, Emo", biburl = "https://dblp.org/rec/conf/esa/BrodalFFGIJMM07.bib", booktitle = "Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings", doi = "10.1007/978-3-540-75520-3\_32", pages = "347--358", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Optimal Resilient Dynamic Dictionaries", url = "https://doi.org/10.1007/978-3-540-75520-3\_32", volume = "4698", year = "2007" }
11
Allan Grønlund Jørgensen, Gabriel Moruz, and Thomas Mølhave. Priority queues resilient to memory faults. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, and Norbert Zeh, editors, Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, volume 4619 of Lecture Notes in Computer Science, 127–138. Springer, 2007. View Online doi:10.1007/978-3-540-73951-7_12 @inproceedings{DBLP:conf/wads/JorgensenMM07, author = "J{\o}rgensen, Allan Gr{\o}nlund and Moruz, Gabriel and M{\o}lhave, Thomas", editor = {Dehne, Frank K. H. A. and Sack, J{\"{o}}rg{-}R{\"{u}}diger and Zeh, Norbert}, biburl = "https://dblp.org/rec/conf/wads/JorgensenMM07.bib", booktitle = "Algorithms and Data Structures, 10th International Workshop, {WADS} 2007, Halifax, Canada, August 15-17, 2007, Proceedings", doi = "10.1007/978-3-540-73951-7\_12", pages = "127--138", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Priority Queues Resilient to Memory Faults", url = "https://doi.org/10.1007/978-3-540-73951-7\_12", volume = "4619", year = "2007" }
12
Gerth Stølting Brodal and Gabriel Moruz. Skewed binary search trees. In Yossi Azar and Thomas Erlebach, editors, Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, volume 4168 of Lecture Notes in Computer Science, 708–719. Springer, 2006. View Online doi:10.1007/11841036_63 @inproceedings{DBLP:conf/esa/BrodalM06, author = "Brodal, Gerth St{\o}lting and Moruz, Gabriel", editor = "Azar, Yossi and Erlebach, Thomas", biburl = "https://dblp.org/rec/conf/esa/BrodalM06.bib", booktitle = "Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings", doi = "10.1007/11841036\_63", pages = "708--719", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Skewed Binary Search Trees", url = "https://doi.org/10.1007/11841036\_63", volume = "4168", year = "2006" }
13
Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. Cache-aware and cache-oblivious adaptive sorting. In Lu\'ıs Caires, Giuseppe F. Italiano, Lu\'ıs Monteiro, Catuscia Palamidessi, and Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, volume 3580 of Lecture Notes in Computer Science, 576–588. Springer, 2005. View Online doi:10.1007/11523468_47 @inproceedings{DBLP:conf/icalp/BrodalFM05, author = "Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Moruz, Gabriel", editor = "Caires, Lu{\'{\i}}s and Italiano, Giuseppe F. and Monteiro, Lu{\'{\i}}s and Palamidessi, Catuscia and Yung, Moti", biburl = "https://dblp.org/rec/conf/icalp/BrodalFM05.bib", booktitle = "Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings", doi = "10.1007/11523468\_47", pages = "576--588", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Cache-Aware and Cache-Oblivious Adaptive Sorting", url = "https://doi.org/10.1007/11523468\_47", volume = "3580", year = "2005" }
14
Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. On the adaptiveness of quicksort. In Camil Demetrescu, Robert Sedgewick, and Roberto Tamassia, editors, Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005, 130–140. SIAM, 2005. View Online @inproceedings{DBLP:conf/alenex/BrodalFM05, author = "Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Moruz, Gabriel", editor = "Demetrescu, Camil and Sedgewick, Robert and Tamassia, Roberto", biburl = "https://dblp.org/rec/conf/alenex/BrodalFM05.bib", booktitle = "Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, {ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005", pages = "130--140", publisher = "{SIAM}", title = "On the Adaptiveness of Quicksort", url = "http://www.siam.org/meetings/alenex05/papers/12gbrodal.pdf", year = "2005" }
15
Gerth Stølting Brodal and Gabriel Moruz. Tradeoffs between branch mispredictions and comparisons for sorting algorithms. In Frank K. H. A. Dehne, Alejandro López-Ortiz, and Jörg-Rüdiger Sack, editors, Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, volume 3608 of Lecture Notes in Computer Science, 385–395. Springer, 2005. View Online doi:10.1007/11534273_34 @inproceedings{DBLP:conf/wads/BrodalM05, author = "Brodal, Gerth St{\o}lting and Moruz, Gabriel", editor = {Dehne, Frank K. H. A. and L{\'{o}}pez{-}Ortiz, Alejandro and Sack, J{\"{o}}rg{-}R{\"{u}}diger}, biburl = "https://dblp.org/rec/conf/wads/BrodalM05.bib", booktitle = "Algorithms and Data Structures, 9th International Workshop, {WADS} 2005, Waterloo, Canada, August 15-17, 2005, Proceedings", doi = "10.1007/11534273\_34", pages = "385--395", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms", url = "https://doi.org/10.1007/11534273\_34", volume = "3608", year = "2005" }
16
Gabriel Ciobanu, Daniel Dumitriu, Dorin Huzum, Gabriel Moruz, and Bogdan Tanasa. Client-server P systems in modeling molecular interaction. In Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, and Claudio Zandron, editors, Membrane Computing, International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers, volume 2597 of Lecture Notes in Computer Science, 203–218. Springer, 2002. View Online doi:10.1007/3-540-36490-0_13 @inproceedings{DBLP:conf/wmp/CiobanuDHMT02, author = "Ciobanu, Gabriel and Dumitriu, Daniel and Huzum, Dorin and Moruz, Gabriel and Tanasa, Bogdan", editor = "Paun, Gheorghe and Rozenberg, Grzegorz and Salomaa, Arto and Zandron, Claudio", biburl = "https://dblp.org/rec/conf/wmp/CiobanuDHMT02.bib", booktitle = "Membrane Computing, International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers", doi = "10.1007/3-540-36490-0\_13", pages = "203--218", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Client-Server {P} Systems in Modeling Molecular Interaction", url = "https://doi.org/10.1007/3-540-36490-0\_13", volume = "2597", year = "2002" }