Online paging for flash memory devices. - Annamária Kovács; Ulrich Meyer 001; Gabriel Moruz; Andrei Negoescu (ISAAC, 2009)

New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches. - Ulrich Meyer 001; Andrei Negoescu; Volker Weichert (TAPAS, 2011)

Outperforming LRU via competitive analysis on parametrized inputs for paging. - Gabriel Moruz; Andrei Negoescu (SODA, 2012)

Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. - Gabriel Moruz; Andrei Negoescu (ICALP (1), 2013)

Design of competitive paging algorithms with good behaviour in practice. - Andrei Laurian Negoescu (2013)

Engineering Efficient Paging Algorithms. - Gabriel Moruz; Andrei Negoescu; Christian Neumann; Volker Weichert (ACM J. Exp. Algorithmics, 2014)

The optimal structure of algorithms for α-paging. - Annamária Kovács; Ulrich Meyer 001; Gabriel Moruz; Andrei Negoescu (Inf. Process. Lett., 2015)

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. - Gerth Stølting Brodal; Gabriel Moruz; Andrei Negoescu (Theory Comput. Syst., 2015)