Image de couverture de livre

Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hu, Ivan, van Melkebeek, Dieter, Morgan, Andrew
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

From Dynamic Programs to Greedy Algorithms
par: van Melkebeek, Dieter
Publié: (2025)

Tight Lower Bounds for Central String Queries in Compressed Space
par: Kempa, Dominik, et autres
Publié: (2025)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
par: Azarmehr, Amir, et autres
Publié: (2025)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
par: Shah, Vihan
Publié: (2026)

A Tight Lower Bound for Cycle Detection in Grid Graphs
par: Au, Andrew
Publié: (2026)

Statistical Query Lower Bounds for Smoothed Agnostic Learning
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Lower Bounds on Tree Covers
par: Chen, Yu, et autres
Publié: (2025)

Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data
par: De, Rajat, et autres
Publié: (2023)

Lower Bounds for Testing Directed Acyclicity in the Unidirectional Bounded-Degree Model
par: Yoshida, Yuichi
Publié: (2026)

Improved Lower Bounds on the Expected Length of Longest Common Subsequences
par: Heineman, George T., et autres
Publié: (2024)

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
par: Boneh, Itai, et autres
Publié: (2025)

New Algorithms and Lower Bounds for Streaming Tournaments
par: Ghosh, Prantar, et autres
Publié: (2024)

Lower Bounds on $0$-Extension with Steiner Nodes
par: Chen, Yu, et autres
Publié: (2024)

Double Exponential Lower Bound for Telephone Broadcast
par: Tale, Prafullkumar
Publié: (2024)

Lower Bounds on Flow Sparsifiers with Steiner Nodes
par: Chen, Yu, et autres
Publié: (2026)

Dynamic PageRank: Algorithms and Lower Bounds
par: Jayaram, Rajesh, et autres
Publié: (2024)

Fine Grained Lower Bounds for Multidimensional Knapsack
par: Doron-Arad, Ilan, et autres
Publié: (2024)

Encodings for Range Minimum Queries over Bounded Alphabets
par: Jo, Seungbum, et autres
Publié: (2026)

A General Technique for Searching in Implicit Sets via Function Inversion
par: Aronov, Boris, et autres
Publié: (2023)

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
par: Huiberts, Sophie, et autres
Publié: (2022)

Improved Lower Bounds for Privacy under Continual Release
par: Aryanfard, Bardiya, et autres
Publié: (2025)

Non-Signaling Locality Lower Bounds for Dominating Set
par: Fleming, Noah, et autres
Publié: (2026)

Lower Bounds for Non-adaptive Local Computation Algorithms
par: Azarmehr, Amir, et autres
Publié: (2025)

A Lower Bound for Light Spanners in General Graphs
par: Bodwin, Greg, et autres
Publié: (2024)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
par: Funke, Daniel, et autres
Publié: (2024)

Statistical Query Lower Bounds for Learning Truncated Gaussians
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds
par: Manea, Florin, et autres
Publié: (2024)

Tight Static Lower Bounds for Non-Adaptive Data Structures
par: Persiano, Giuseppe, et autres
Publié: (2020)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure
par: Bodwin, Greg, et autres
Publié: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
par: Chitnis, Rajesh, et autres
Publié: (2024)

Lower Bounds for Matroid Optimization Problems with a Linear Constraint
par: Doron-Arad, Ilan, et autres
Publié: (2023)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
par: Kosolobov, Dmitry
Publié: (2024)

Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
par: Nikolov, Aleksandar, et autres
Publié: (2026)

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
par: Brown, Nathaniel K., et autres
Publié: (2026)

A Tight Lower Bound for Comparison-Based Quantile Summaries
par: Cormode, Graham, et autres
Publié: (2019)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
par: Cheng, Yu, et autres
Publié: (2024)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
par: Hwang, Samuel, et autres
Publié: (2024)

New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
par: Ghosh, Prantar, et autres
Publié: (2024)

Query Lower Bounds for Diffusion Sampling
par: Xun, Zhiyang, et autres
Publié: (2026)

Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries
par: Adar, Tomer, et autres
Publié: (2024)