List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Outperforming LRU via competitive analysis on parametrized inputs for paging | 2019-05-10 | Paper |
| Engineering efficient paging algorithms ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
| The optimal structure of algorithms for \(\alpha\)-paging Information Processing Letters | 2015-09-15 | Paper |
| \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm Theory of Computing Systems | 2015-05-12 | Paper |
| Improved space bounds for strongly competitive randomized paging algorithms Automata, Languages, and Programming | 2013-08-06 | Paper |
| OnlineMin: a fast strongly competitive randomized paging algorithm Approximation and Online Algorithms | 2012-07-16 | Paper |
| New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
| Online Paging for Flash Memory Devices Algorithms and Computation | 2009-12-17 | Paper |
Research outcomes over time
This page was built for person: Andrei Negoescu
