Dipl.-Inf. Andrei Negoescu
Dr. Andrei Negoescu
Institut für Informatik
Robert-Mayer-Straße 11-15
60325 Frankfurt am Main
Email: negoescu@cs.uni-frankfurt.de
Andrei moved to a company in Offenbach am Main.

Conference Papers

Gabriel Moruz and Andrei Negoescu
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP) (I), LNCS 7965, pages 757-768, Springer, 2013.
Gabriel Moruz and Andrei Negoescu
Outperforming LRU via Competitive Analysis on Parametrized Inputs for Paging
In: Proc. of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, 2012, pages 1669-1680.
Gabriel Moruz, Andrei Negoescu, Christian Neumann and Volker Weichert
Engineering Efficient Paging Algorithms
In: Proc. of the 11th International Conference on Experimental Algorithms (SEA), LNCS 7276, pages 320-331, Springer, 2012.
Gerth Stoelting Brodal, Gabriel Moruz and Andrei Negoescu
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
In: Approximation and Online Algorithms (WAOA), LNCS 7164, pages 164-175, Springer, 2012.
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: Proc. of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS), Rome, Italy, 2011, 217-228
Annamária Kovács, Ulrich Meyer, Gabriel Moruz and Andrei Negoescu
Online Paging for Flash Memory Devices
In: LNCS, Volume 5878/2009, pp. 352-361, Springer, 2009.