scientific article; zbMATH DE number 7250167

DOI10.4230/LIPIcs.CCC.2018.27zbMath1441.68024MaRDI QIDQ5121915

No author found.

Publication date: 22 September 2020

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

zbMATH Keywords

sunflower lemmanon-adaptive data structures

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Data structures (68P05)

Related Items (2)

Sunflowers: from soil to oil ⋮ Coding for Sunflowers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The monotone circuit complexity of Boolean functions
• Preserving order in a forest in less than logarithmic time and linear space
• On data structures and asymmetric communication complexity
• Surpassing the information theoretic bound with fusion trees
• Log-logarithmic worst-case range queries are possible in space theta(N)
• Optimal bounds for the predecessor problem and related problems
• The cell probe complexity of succinct data structures
• Lower bounds for predecessor searching in the cell probe model
• Lower bounds for union-split-find related problems on random access machines
• Time-space trade-offs for predecessor search
• Intersection Theorems for Systems of Sets
• Finding the Median (Obliviously) with Bounded Space
• Dynamic word problems
• Cell-probe lower bounds for dynamic problems via a new communication model
• The cell probe complexity of dynamic range counting
• Don't rush into a union
• Logarithmic Lower Bounds in the Cell-Probe Model

This page was built for publication: