No. Title Author Year
1 Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths Kociumaka, Tomasz et al. 2023
2 Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost Berger, Aaron et al. 2022
3 Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs Lassota, Alexandra et al. 2022
4 Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths Gu, Yuzhou et al. 2021
5 Knapsack and Subset Sum with Small Items Polak, Adam et al. 2021
6 Monochromatic Triangles, Intermediate Matrix Products, and Convolutions Lincoln, Andrea et al. 2020
7 Online Coloring of Short Intervals Chybowska-Sokół, Joanna et al. 2020
8 Tight Conditional Lower Bounds for Longest Common Increasing Subsequence Duraj, Lech et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 8

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