Amanote Research

Amanote Research

  • Register
  • Sign In

Lower Bounds for Dynamic Connectivity

doi 10.1145/1007352.1007435

Full Text

Abstract

Available in

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

Improved Lower Bounds for Multicovering Codes

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

Lower Bounds for Monotone Span Programs

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
1996English

New Lower Bounds for Hopcroft's Problem

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1996English

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy