Finding least common ancestors in directed acyclic graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 845-854

  Bender, Michael A ^a   Pemmasani, Giridhar ^a   Skiena, Steven ^a   Sumazin, Pavel ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

Algorithms; Experimentation; Measurement; Performance; Theory; Verification

Indexed keywords

EID: 64049096000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. AGM91 Noga Alon , Zvi Galil , Oded Margalit, On the exponent of the all pairs shortest path problem, Proceedings of the 32nd annual symposium on Foundations of computer science, p.569-575, September 1991, San Juan, Puerto Rico
2. AGM97 Noga Alon , Zvi Galil , Oded Margalit, On the exponent of the all pairs shortest path problem, Journal of Computer and System Sciences, v.54 n.2, p.255-262, April 1997 [doi〉10.1006/jcss.1997.1388 ]
3. AKBLN89 Hassan Aït-Kaci , Robert Boyer , Patrick Lincoln , Roger Nasr, Efficient implementation of lattice operations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.1, p.115-146, Jan. 1989 [doi〉10.1145/59287.59293]
4. BAwCD97a Jeff Bilmes , Krste Asanovic , Chee-Whye Chin , Jim Demmel, Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology, Proceedings of the 11th international conference on Supercomputing, p.340-347, July 07-11, 1997, Vienna, Austria [doi〉10.1145/263580.263662]
5. BAwCD97b Jeff Bilmes, Krste Asanovid, Chee whye Chin, and Jim Demmel. Using PHiPAC to speed error back-propagation learning. In Proceedings of ICASSP, volume 5, pages 4153-4157, Munich, Germany, April 1997.
6. BFC00 Michael A. Bender , Martin Farach-Colton, The LCA Problem Revisited, Proceedings of the 4th Latin American Symposium on Theoretical Informatics, p.88-94, April 10-14, 2000
7. BR97 Vincent Bouchitté , Jean-Xavier Rampon, On-line algorithms for orders, Theoretical Computer Science, v.175 n.2, p.225-238, April 10, 1997
8. BSV93 Omer Berkman , Baruch Schieber , Uzi Vishkin, Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values, Journal of Algorithms, v.14 n.3, p.344-370, May 1993 [doi〉10.1006/jagm. 1993.1018 ]
9. BV93 Omer Berkman , Uzi Vishkin, Recursive star-tree parallel data structure, SIAM Journal on Computing, v.22 n.2, p.221-242, April 1993 [doi〉10.1137/0222017]
10. BV94 Omer Berkman , Uzi Vishkin, Finding level-ancestors in trees, Journal of Computer and System Sciences, v.48 n.2, p.214-230, April 1994 [doi〉10.1016/S0022-0000(05)80002-9]
11. CH99 Richard Cole , Ramesh Hariharan, Dynamic LCA queries on trees, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.235-244, January 17-19, 1999, Baltimore, Maryland, United States
12. CW87 D. Coppersmith , S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.1-6, January 1987, New York, New York, United States [doi〉10.1145/28395.28396]
13. CZ96 E. Cohen and U. Zwick. All-pairs small-stretch paths. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 452- 461, Burlington, Vermont, 14-16 October 1996.
14. CZ97 Edith Cohen , Uri Zwick, All-pairs small-stretch paths, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.93-102, January 05-07, 1997, New Orleans, Louisiana, United States
15. DH87 R. Ducournau , M. Habib, On some algorithms for multiple inheritance in objectoriented programming, European conference on object-oriented programming on ECOOP '87, p.243-252, October 1987, Paris, France
16. Fal90 Stewart Andrew Fall , Veronica Dahl, Reasoning with taxonomies, 1996
17. Fal95 Andrew Fall. An abstract framework for taxonomic encoding. Proc. First International Symposium on Knowledge Retrieval, Use and Storage for Efficiency, 1995.
18. Fre76 Michael L. Fredman. New bounds on the complexity of the shortest path problem. SIAM J. Cornput., 5(1):83-89, March 1976.
19. GR80 Adele Goldberg , David Robson, Smalltalk-80: the language and its implementation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
20. HHS95 Michel Habib, M. Huchard, and Jeremy Spinrad. A linear algorithm to decompose inheritance graphs into modules. Algorithmica, 13(6):573-591, June 1995.
21. HN96 Michel Habib , Lhouari Nourine, Tree structure for distributive lattices and its applications, Theoretical Computer Science, v.165 n.2, p.391-405, Oct. 10, 1996 [doi〉10.1016/0304-3975(95)00232-4]
22. HT84 Dov Harel , Robert Endre Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, v.13 n.2, p.338-355, May 1984 [doi〉10.1137/0213024]
23. JIS93 R. W. Cottingham Jr., R. M. Idury, and A. A. Schaffer. Genetic linkage computations. American Journal of Human Genetics, 53:252-263, 1993.
24. JRJ94 G.-V. Jourdan, J.-X. Rampon, and C. Jard. Computing on-fine the lattice of maximal antichains of posets. Order, 1994. A paraitre.
25. McA86 David McAllester , Ramin Zabih, Boolean classes, ACM SIGPLAN Notices, v.21 n.11, p.417-423, Nov. 1986
26. MN92 M. Morvan and L. Nourine. Generating minimal interval extentions. Research Report No. 92-015, LIRMM Montpellier, 1992.
27. NU94 Matti Nykänen , Esko Ukkonen, Finding lowest common ancestors in arbitrarily directed trees, Information Processing Letters, v.50 n.6, p.307-310, June 27, 1994 [doi〉10.1016/0020-0190(94)00050-6]
28. Par87 D.S. Parker. Partial order programming. Technical Report CSD-870067, Computer Science Department, UCLA, December 1987.
29. Sei92 Raimund Seidel, On the all-pairs-shortest-path problem, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.745-749, May 04-06, 1992, Victoria, British Columbia, Canada [doi〉10.1145/129712. 129784]
30. SGSJ94 A. A. Schffer, S. K. Gupta, K. Shriram, and R. W. Cottingham Jr. Avoiding recomputation in linkage analysis. Human Heredity, 44:225-237, 1994.
31. SV88 Baruch Schieber , Uzi Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM Journal on Computing, v.17 n.6, p.1253-1262, Dec. 1988 [doi〉10.1137/0217079]
32. Tar79 Robert Endre Tarjan, Applications of Path Compression on Balanced Trees, Journal of the ACM (JACM), v.26 n.4, p.690-715, Oct. 1979 [doi〉10.1145/322154.322161]
33. Wen94 Zhaofang Wen, New algorithms for the LCA problem and the binary tree reconstruction problem, Information Processing Letters, v.51 n.1, p.11-16, July 12, 1994 [doi〉10.1016/0020-0190(94)00058-1]
34. WTC99 Biing-Feng Wang , Jiunn-Nan Tsai , Yuan-Cheng Chuang, The lowest common ancestor problem on a tree with an unfixed root, Information Sciences: an International Journal, v.119 n.1-2, p.125-130, Oct. 1, 1999 [doi〉10.1016/S0020-0255(99)00046-8 ]
35. Yuv76 G. Yuval. An algorithm for finding all shortest paths using N TM infinite-precision multiplications. Inf. Process. Lett., 4(6):155-156, March 1976.
36. Zwi98 Uri Zwick, All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.310, November 08-11, 1998
37. Zwi99 Uri Zwick, All pairs lightest shortest paths, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.61-69, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/301250.301271]