Amanote Research

Amanote Research

    RegisterSign 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şcuErik D. Demaine
Publisher

ACM Press


Related search

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

2016English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Measurable Chromatic Numbers

Geometric and Functional Analysis
GeometryAnalysisTopology
2009English

Calculating Lower Bounds for Caching Problems

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2007English

Lower Bounds for Row Minima Searching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Improved Lower Bounds for Multicovering Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy