No. Title Author Year
1 Fine-grained Lower Bounds on Cops and Robbers Brandt, Sebastian et al. 2018
2 Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees Dorfman, Dani et al. 2018
3 Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts Huang, Shang-En et al. 2018
4 Simultaneously Load Balancing for Every p-norm, With Reassignments Bernstein, Aaron et al. 2017
5 Structure and Hardness in P (Dagstuhl Seminar 16451) Lewenstein, Moshe et al. 2017
6 Faster Worst Case Deterministic Dynamic Connectivity Kejlberg-Rasmussen, Casper et al. 2016
7 Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap Amir, Amihood et al. 2016
8 Sources of Superlinearity in Davenport-Schinzel Sequences Pettie, Seth 2008
9 Towards a Final Analysis of Pairing Heaps Pettie, Seth 2006
Current Page :
Number of result pages: 1
Number of documents: 9


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