Finding least common ancestors in directed acyclic graphs

Michael A. Bender; Giridhar Pemmasani; Steven Skiena; Pavel Sumazin

Finding least common ancestors in directed acyclic graphs

Michael A. Bender
, Giridhar Pemmasani
, Steven Skiena
, Pavel Sumazin

Computer Science

Stony Brook University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

Original language	English
Title of host publication	Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages	845-854
Number of pages	10
State	Published - 2001
Event	2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States Duration: Apr 30 2001 → May 1 2001

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	2001 Operating Section Proceedings, American Gas Association
Country/Territory	United States
City	Dallas, TX
Period	04/30/01 → 05/1/01

Keywords

Algorithms
Experimentation
Measurement
Performance
Theory
Verification

Cite this

@inproceedings{48d3b41f132341b5891dadaacf51c487,

title = "Finding least common ancestors in directed acyclic graphs",

keywords = "Algorithms, Experimentation, Measurement, Performance, Theory, Verification",

author = "Bender, \{Michael A.\} and Giridhar Pemmasani and Steven Skiena and Pavel Sumazin",

year = "2001",

language = "English",

isbn = "0898714907",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "845--854",

booktitle = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms",

note = "2001 Operating Section Proceedings, American Gas Association ; Conference date: 30-04-2001 Through 01-05-2001",

}

Bender, MA, Pemmasani, G, Skiena, S & Sumazin, P 2001, Finding least common ancestors in directed acyclic graphs. in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 845-854, 2001 Operating Section Proceedings, American Gas Association, Dallas, TX, United States, 04/30/01.

Finding least common ancestors in directed acyclic graphs. / Bender, Michael A.; Pemmasani, Giridhar; Skiena, Steven et al.
Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. p. 845-854 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Finding least common ancestors in directed acyclic graphs

AU - Bender, Michael A.

AU - Pemmasani, Giridhar

AU - Skiena, Steven

AU - Sumazin, Pavel

PY - 2001

Y1 - 2001

KW - Algorithms

KW - Experimentation

KW - Measurement

KW - Performance

KW - Theory

KW - Verification

UR - https://www.scopus.com/pages/publications/64049096000

M3 - Conference contribution

AN - SCOPUS:64049096000

SN - 0898714907

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 845

EP - 854

BT - Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms

T2 - 2001 Operating Section Proceedings, American Gas Association

Y2 - 30 April 2001 through 1 May 2001

ER -

Finding least common ancestors in directed acyclic graphs

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this