Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

New lower bound techniques for dynamic partial sums and related problems

In English

Författare

Summary, in English

We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We give the model access to the right answer +/-1 as an oracle and prove that the problem remains hard. This suggests which kind of information is hard to maintain. From these results, we derive a number of lower bounds for dynamic algorithms and data structures: We prove lower bounds for dynamic algorithms for existential range queries, reachability in directed graphs, planarity testing, planar point location, incremental parsing, and fundamental data structure problems like maintaining the majority of the prefixes of a string of bits. We prove a lower bound for reachability in grid graphs in terms of the graph's width. We characterize the complexity of maintaining the value of any symmetric function on the prefixes of a bit string.

Avdelning/ar

  • Computer Science

Publiceringsår

2003

Språk

Engelska

Sidor

736-753

Publikation/Tidskrift/Serie

SIAM Journal on Computing

Volym

32

Issue

3

Dokumenttyp

Artikel i tidskrift

Förlag

Society for Industrial and Applied Mathematics

Ämne

  • Computer Science

Nyckelord

  • cell-probe model
  • data structure
  • partial sum
  • dynamic algorithm

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0097-5397