scientific article; zbMATH DE number 2230258

zbMath1075.68628MaRDI QIDQ5708551

A. Toni

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

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

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)

Related Items (1)

Multidimensional segment trees can do range updates in poly-logarithmic time

Cites Work

• Query time versus redundancy trade-offs for range queries
• Inherent complexity trade-offs for range query problems
• Lower Bounds on the Complexity of Some Optimal Data Structures
• The Complexity of Maintaining an Array and Computing Its Partial Sums
• Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums

This page was built for publication: