DOI: 10.1145/276698.276715. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

10.1145/276698.276715

Crossref proceedings-article

ACM Press

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 (320)

Bibliography

Holm, J., de Lichtenberg, K., & Thorup, M. (1998). Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC â98, 79â89.

Authors 3

Jacob Holm (first)
Kristian de Lichtenberg (additional)
Mikkel Thorup (additional)

References 0 Referenced 42

None

Dates

Type	When
Created	21 years, 9 months ago (Nov. 25, 2003, 11:40 a.m.)
Deposited	2 months, 2 weeks ago (June 18, 2025, 1:43 a.m.)
Indexed	2 months ago (June 30, 2025, 11:26 a.m.)
Issued	27 years, 8 months ago (Jan. 1, 1998)
Published	27 years, 8 months ago (Jan. 1, 1998)
Published Print	27 years, 8 months ago (Jan. 1, 1998)

Funders 0

None

BibTeX

@inproceedings{Holm_1998, series={STOC ’98}, title={Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity}, url={http://dx.doi.org/10.1145/276698.276715}, DOI={10.1145/276698.276715}, booktitle={Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98}, publisher={ACM Press}, author={Holm, Jacob and de Lichtenberg, Kristian and Thorup, Mikkel}, year={1998}, pages={79–89}, collection={STOC ’98} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        6,
        30
      ]
    ],
    "date-time": "2025-06-30T15:26:46Z",
    "timestamp": 1751297206603,
    "version": "3.41.0"
  },
  "publisher-location": "New York, New York, USA",
  "reference-count": 0,
  "publisher": "ACM Press",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1998,
            1,
            1
          ]
        ],
        "date-time": "1998-01-01T00:00:00Z",
        "timestamp": 883612800000
      },
      "content-version": "vor",
      "delay-in-days": 0,
      "URL": "https://www.acm.org/publications/policies/copyright_policy#Background"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1998
      ]
    ]
  },
  "DOI": "10.1145/276698.276715",
  "type": "proceedings-article",
  "created": {
    "date-parts": [
      [
        2003,
        11,
        25
      ]
    ],
    "date-time": "2003-11-25T16:40:52Z",
    "timestamp": 1069778452000
  },
  "page": "79-89",
  "source": "Crossref",
  "is-referenced-by-count": 42,
  "title": "Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity",
  "prefix": "10.1145",
  "author": [
    {
      "given": "Jacob",
      "family": "Holm",
      "sequence": "first",
      "affiliation": []
    },
    {
      "given": "Kristian",
      "family": "de Lichtenberg",
      "sequence": "additional",
      "affiliation": []
    },
    {
      "given": "Mikkel",
      "family": "Thorup",
      "sequence": "additional",
      "affiliation": []
    }
  ],
  "member": "320",
  "event": "the thirtieth annual ACM symposium",
  "container-title": "Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC '98",
  "original-title": [],
  "link": [
    {
      "URL": "https://dl.acm.org/doi/10.1145/276698.276715",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://dl.acm.org/ft_gateway.cfm?id=276715&amp;ftid=35427&amp;dwn=1",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2025,
        6,
        18
      ]
    ],
    "date-time": "2025-06-18T05:43:01Z",
    "timestamp": 1750225381000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "http://portal.acm.org/citation.cfm?doid=276698.276715"
    }
  },
  "subtitle": [],
  "proceedings-subject": "Theory of computing",
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1998
      ]
    ]
  },
  "references-count": 0,
  "URL": "http://dx.doi.org/10.1145/276698.276715",
  "relation": {},
  "subject": [],
  "published": {
    "date-parts": [
      [
        1998
      ]
    ]
  }
}