Amanote Research
Register
Sign In
Lower Bounds for Dynamic Connectivity
doi 10.1145/1007352.1007435
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2004
Authors
Mihai Pǎtraşcu
Erik D. Demaine
Publisher
ACM Press
Related search
Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Lower Bounds
Lower Bounds for Subgraph Isomorphism
Lower Bounds for Z-Numbers
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
Lower Bounds for Measurable Chromatic Numbers
Geometric and Functional Analysis
Geometry
Analysis
Topology
Calculating Lower Bounds for Caching Problems
Computing (Vienna/New York)
Numerical Analysis
Computational Theory
Computer Science Applications
Computational Mathematics
Mathematics
Theoretical Computer Science
Software
Lower Bounds for Row Minima Searching
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Improved Lower Bounds for Multicovering Codes
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences