Andrei Negoescu

Publication Activity (10 Years)

Years Active: 2009-2015
Publications (10 Years): 0

Top Topics

Computationally Intensive

Computational Efficiency

Top Venues

Inf. Process. Lett.

Theory Comput. Syst.

ACM J. Exp. Algorithmics

Publications

Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
The optimal structure of algorithms for α-paging. Inf. Process. Lett. 115 (12) (2015)
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst. 56 (1) (2015)
Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert
Engineering Efficient Paging Algorithms. ACM J. Exp. Algorithmics 19 (1) (2014)
Gabriel Moruz, Andrei Negoescu
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. ICALP (1) (2013)
Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert
Engineering Efficient Paging Algorithms. SEA (2012)
Gabriel Moruz, Andrei Negoescu
Outperforming LRU via competitive analysis on parametrized inputs for paging. SODA (2012)
Ulrich Meyer, Andrei Negoescu, Volker Weichert
New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches. TAPAS (2011)
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. WAOA (2011)
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
Online paging for flash memory devices. ISAAC (2009)