January 1, 1979

A near optimal data structure for a type of range query problem

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

Let G denote the set of elements of a commutative group whose addition operations is denoted by +, let N be a positive integer, and let A(1) ,..., A(N) denote an array with values in G. We will be concerned with designing data structures for representing the array A, which facilitate efficient implementation of the following two on-line tasks:

Preguntar a la IA

Me gusta

Guardar

Cite This Study

Michael L. Fredman (Mon,) studied this question.

synapsesocial.com/papers/6a10caee8102eb4b66ee6a69 https://doi.org/https://doi.org/10.1145/800135.804398

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Inherent complexity trade-offs for range query problems1981 · 19 citations
2Lower Bounds on the Complexity of Some Optimal Data Structures1981 · 70 citations
3The Complexity of Maintaining an Array and Computing Its Partial Sums1982 · 98 citations
4Reference machines require non-linear time to maintain disjoint sets1977 · 30 citations
5A Lower Bound on the Complexity of Orthogonal Range Queries1981 · 114 citations

Preguntar a la IA

Me gusta

Guardar