Lower bounds for dynamic algebraic problems
type: Item
instance of: scholarly article
title: Lower bounds for dynamic algebraic problems
zbMATH Open document ID: 1005.68076
author: Gudmund S. Frandsen
author: Johan P. Hansen
author: Peter Bro Miltersen
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1853226
MaRDI profile type: Publication
full work available at URL: inco.2001.3046
OpenAlex ID: W2064176976
cites work: Q4234091
cites work: On pointers versus addresses
cites work: Q4331740
cites work: Q4317713
cites work: Storing a Sparse Table with 0 (1) Worst Case Access Time
cites work: Lower Bounds on the Complexity of Some Optimal Data Structures
cites work: The Complexity of Maintaining an Array and Computing Its Partial Sums
cites work: Surpassing the information theoretic bound with fusion trees
cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths
cites work: Q5831393
cites work: Communication Complexity
cites work: A geometric construction of a superconcentrator of depth 2
cites work: Lower bounds for union-split-find related problems on random access machines
cites work: On data structures and asymmetric communication complexity
cites work: Q3940846
cites work: On Dynamic Algorithms for Algebraic Problems
cites work: An Algorithm for the Computation of Linear Forms
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Q4302493
cites work: ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
cites work: On the number of multiplications necessary to compute certain functions
cites work: On the Complexity of Maintaining Partial Sums
DOI: 10.1006/INCO.2001.3046
description: scientific article; zbMATH DE number 1853226