Showing 1–20 of 36 results
/ Date/ Name
Mar 28, 2021Euler Meets GPU: Practical Graph Algorithms with Theoretical GuaranteesMay 9, 2021Knapsack and Subset Sum with Small ItemsOct 19, 2023Deterministic 3SUM-HardnessFeb 26, 2018Online Coloring of Short IntervalsSep 24, 2024Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic ProblemsJun 30, 2021Nearly-Tight and Oblivious Algorithms for Explainable ClusteringMar 4, 2020Online metric algorithms with untrusted predictionsMar 18, 2022Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in MultigraphsNov 10, 2024Faster Weighted and Unweighted Tree Edit Distance and APSP EquivalenceSep 30, 2020Monochromatic Triangles, Intermediate Matrix Products, and ConvolutionsApr 4, 2023Mixing predictions for online metric algorithmsNov 14, 2022Bellman-Ford is optimal for shortest hop-bounded pathsMar 2, 2015Counting Triangles in Large Graphs on GPUMar 3, 2017Why is it hard to beat $O(n^2)$ for Longest Common Weakly Increasing Subsequence?May 6, 2021Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement PathsJun 28, 2021Robust Learning-Augmented Caching: An Experimental StudyApr 30, 2025The Planted Orthogonal Vectors ProblemDec 13, 2023Connectivity Oracles for Predictable Vertex FailuresNov 25, 2024Approximation Algorithms for Combinatorial Optimization with PredictionsAug 30, 2019Equivalences between triangle and range query problems