Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators

Adam L. Buchsbaum; Haim Kaplan; Anne Rogers; Jeffery R. Westbrook

doi:10.1145/276698.276764

Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators

Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook

Research output: Contribution to journal › Conference article › peer-review

Abstract

We present two new data structure tools - disjoint set union with bottom-up linking, and pointer-based radix sort - and combine them with bottom-level microtrees to devise the first linear-time pointer-machine algorithms for off-line least common ancestors, minimum spanning tree (MST) verification, randomized MST construction, and computing dominators in a flowgraph.

Original language	English
Pages (from-to)	279-288
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/276698.276764
State	Published - 1998
Externally published	Yes
Event	Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA Duration: 23 May 1998 → 26 May 1998

Access to Document

10.1145/276698.276764

Cite this

@article{739c832445564c7ebcc10ab465555ef6,

title = "Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators",

abstract = "We present two new data structure tools - disjoint set union with bottom-up linking, and pointer-based radix sort - and combine them with bottom-level microtrees to devise the first linear-time pointer-machine algorithms for off-line least common ancestors, minimum spanning tree (MST) verification, randomized MST construction, and computing dominators in a flowgraph.",

author = "Buchsbaum, {Adam L.} and Haim Kaplan and Anne Rogers and Westbrook, {Jeffery R.}",

year = "1998",

doi = "10.1145/276698.276764",

language = "אנגלית",

pages = "279--288",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "null ; Conference date: 23-05-1998 Through 26-05-1998",

}

TY - JOUR

T1 - Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators

AU - Buchsbaum, Adam L.

AU - Kaplan, Haim

AU - Rogers, Anne

AU - Westbrook, Jeffery R.

PY - 1998

Y1 - 1998

N2 - We present two new data structure tools - disjoint set union with bottom-up linking, and pointer-based radix sort - and combine them with bottom-level microtrees to devise the first linear-time pointer-machine algorithms for off-line least common ancestors, minimum spanning tree (MST) verification, randomized MST construction, and computing dominators in a flowgraph.

AB - We present two new data structure tools - disjoint set union with bottom-up linking, and pointer-based radix sort - and combine them with bottom-level microtrees to devise the first linear-time pointer-machine algorithms for off-line least common ancestors, minimum spanning tree (MST) verification, randomized MST construction, and computing dominators in a flowgraph.

UR - http://www.scopus.com/inward/record.url?scp=0031631006&partnerID=8YFLogxK

U2 - 10.1145/276698.276764

DO - 10.1145/276698.276764

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0031631006

SP - 279

EP - 288

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

SN - 0734-9025

Y2 - 23 May 1998 through 26 May 1998

ER -

Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators

Abstract

Access to Document

Other files and links

Fingerprint

Cite this