Andrei Negoescu

Available identifiers

zbMath Open negoescu.andreiMaRDI QIDQ495672

List of research outcomes

Publication	Date of Publication	Type
Outperforming LRU via competitive analysis on parametrized inputs for paging	2019-05-10	Paper
Engineering efficient paging algorithms	2016-10-24	Paper
The optimal structure of algorithms for \(\alpha\)-paging	2015-09-15	Paper
\textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm	2015-05-12	Paper
Improved space bounds for strongly competitive randomized paging algorithms	2013-08-06	Paper
OnlineMin: a fast strongly competitive randomized paging algorithm	2012-07-16	Paper
New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches	2011-05-12	Paper
Online Paging for Flash Memory Devices	2009-12-17	Paper

Research outcomes over time

This page was built for person: Andrei Negoescu