No. Title Author Year
1 Matching on the Line Admits No o(√log n)-Competitive Algorithm Peserico, Enoch et al. 2021
2 Oblivious Parallel Tight Compaction Asharov, Gilad et al. 2020
3 Paging with Dynamic Memory Capacity Peserico, Enoch 2019
4 On Approximating the Stationary Distribution of Time-reversible Markov Chains Bressan, Marco et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 4

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI