Andrei Negoescu

Affiliations:

Goethe University Frankfurt am Main, Institute for Computer Science

According to our database¹, Andrei Negoescu authored at least 8 papers between 2009 and 2015.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2015

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Gabriel Moruz

Andrei Negoescu

Theory Comput. Syst., 2015

The optimal structure of algorithms for α-paging.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

2014

Engineering Efficient Paging Algorithms.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2014

2013

Design of competitive paging algorithms with good behaviour in practice.

[BibT_eX]

[DOI]

Andrei Laurian Negoescu

PhD thesis, 2013

Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms.

[BibT_eX]

[DOI]

Gabriel Moruz

Andrei Negoescu

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Outperforming LRU via competitive analysis on parametrized inputs for paging.

[BibT_eX]

[DOI]

Gabriel Moruz

Andrei Negoescu

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches.

[BibT_eX]

[DOI]

Ulrich Meyer

Andrei Negoescu

Volker Weichert

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2009

Online paging for flash memory devices.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Andrei Negoescu

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...