Dr. Andrei Negoescu

Mail

negoescu@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

Andrei Negoescu. Design of competitive paging algorithms with good behaviour in practice. PhD thesis, Goethe University Frankfurt am Main, 2013. View Online @phdthesis{DBLP:phd/dnb/Negoescu13, author = "Negoescu, Andrei", biburl = "https://dblp.org/rec/phd/dnb/Negoescu13.bib", school = "Goethe University Frankfurt am Main", title = "Design of competitive paging algorithms with good behaviour in practice", url = "http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/32128", year = "2013" }

5

Gabriel Moruz and Andrei Negoescu. Improved space bounds for strongly competitive randomized paging algorithms. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, and David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I, volume 7965 of Lecture Notes in Computer Science, 757–768. Springer, 2013. View Online doi:10.1007/978-3-642-39206-1_64 @inproceedings{DBLP:conf/icalp/MoruzN13, author = "Moruz, Gabriel and Negoescu, Andrei", editor = "Fomin, Fedor V. and Freivalds, Rusins and Kwiatkowska, Marta Z. and Peleg, David", biburl = "https://dblp.org/rec/conf/icalp/MoruzN13.bib", booktitle = "Automata, Languages, and Programming - 40th International Colloquium, {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}", doi = "10.1007/978-3-642-39206-1\_64", pages = "757--768", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms", url = "https://doi.org/10.1007/978-3-642-39206-1\_64", volume = "7965", year = "2013" }

6

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" }

7

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" }

8

Ulrich Meyer, Andrei Negoescu, and Volker Weichert. New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches. In Alberto Marchetti-Spaccamela and Michael Segal, editors, Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings, volume 6595 of Lecture Notes in Computer Science, 217–228. Springer, 2011. View Online doi:10.1007/978-3-642-19754-3_22 @inproceedings{DBLP:conf/tapas/MeyerNW11, author = "Meyer, Ulrich and Negoescu, Andrei and Weichert, Volker", editor = "Marchetti{-}Spaccamela, Alberto and Segal, Michael", biburl = "https://dblp.org/rec/conf/tapas/MeyerNW11.bib", booktitle = "Theory and Practice of Algorithms in (Computer) Systems - First International {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings", doi = "10.1007/978-3-642-19754-3\_22", pages = "217--228", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches", url = "https://doi.org/10.1007/978-3-642-19754-3\_22", volume = "6595", year = "2011" }

9

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" }

10

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" }