No. Title Author Year
1 The Support of Open Versus Closed Random Walks Sauerwald, Thomas et al. 2023
2 Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary Bernstein, Aaron et al. 2022
3 Augmenting the Algebraic Connectivity of Graphs Manghiuc, Bogdan-Adrian et al. 2020
4 Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem Li, Huan et al. 2019
5 Balls into bins via local search: cover time and maximum load Bringmann, Karl et al. 2014
6 Low Randomness Rumor Spreading via Hashing Giakkoupis, George et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 6


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