scientific article; zbMATH DE number 7278092

DOI10.4230/LIPIcs.FSTTCS.2017.20zbMath1491.68054MaRDI QIDQ5136312

Joseph Boninger, Joshua Brody, Owen Kephart

Publication date: 25 November 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsdynamic data structurespredecessor searchnon-adaptivity

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Upper and Lower Bounds on the Power of Advice
• The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model
• Distributed computation in dynamic networks
• Towards polynomial lower bounds for dynamic problems
• Time-space trade-offs for predecessor search
• The Complexity of Data Aggregation in Directed Networks
• Should Tables Be Sorted?
• The cell probe complexity of dynamic range counting

This page was built for publication: