scientific article; zbMATH DE number 1476488

MaRDI QIDQ4490353zbMATH OpenFDO

Authors Thore Husfeldt

Publication date 14 July 2000

zbMATH Keywords

dynamic graph problemsplanar \(st\)-graphssymmetric Boolean functions

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Recommendations

• New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
• Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
• scientific article; zbMATH DE number 1002202
• Dynamic complexity of the Dyck reachability
• STACS 2005

Cited in

(6)

• Computing with continuous change
• scientific article; zbMATH DE number 1002202 (Why is no real title available?)
• Upper and lower bounds for dynamic data structures on strings
• New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
• Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
• Small dynamic complexity classes. An investigation into dynamic descriptive complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490353)