Dynamic word problems

DOI10.1145/256303.256309zbMath0890.68060OpenAlexW2079668749MaRDI QIDQ4377276

Skovbjerg Gudmund Frandsen, Peter Bro Miltersen, Sven Skyum

Publication date: 17 February 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

cell probedecision assignment tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (15)

Dynamic nested brackets ⋮ On dynamic bit-probe complexity ⋮ Lower bounds for dynamic transitive closure, planar point location, and parentheses matching ⋮ Sunflowers: from soil to oil ⋮ Dynamic algorithms for the Dyck languages ⋮ Integer representation and counting in the bit probe model ⋮ Locality and Centrality: The Variety ZG ⋮ Integer representations towards efficient counting in the bit probe model ⋮ Integer Representation and Counting in the Bit Probe Model ⋮ Work-sensitive dynamic complexity of formal languages ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ Coding for Sunflowers ⋮ Partial sums on the ultra-wide word RAM ⋮ Unnamed Item ⋮ A Survey of Data Structures in the Bitprobe Model

This page was built for publication: Dynamic word problems