Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 2002: Algorithm Theory — SWAT 2002 pp 428–438Cite as

An Optimal Algorithm for Finding NCA on Pure Pointer Machines

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2368))

Abstract

We present a simple, arithmetic-free, efficient scheme to compress trees maintaining the nearest common ancestor (NCA) information. We use this compression scheme to provide an O(n + q lg lg n) solution for solving the NCA problem on Pure Pointer Machines (PPMs) (i.e., pointer machines with no arithmetic capabilities) in both the static and dynamic case, where n is the number of add-leaf/delete operations and q is the number of NCA queries. This solution is optimal.

Research is supported by NSF grants CCR-9900320, EIA-0130887, CCR-9875279, CCR-9820852, and EIA-9810732.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Alstrup and M. Thorup. Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Journal of Algorithms, 35:169–188, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  2. A.M. Ben-Amram. What is a Pointer Machine? In SIGACT News, 26(2), 1995.

    Google Scholar 

  3. M.A. Bender and M. Farach-Colton. The LCA Problem Revisited. In Proceedings of LATIN 2000, pages 88–94. Springer Verlag, 2000.

    Google Scholar 

  4. A.L. Buchsbaum et al. Linear-Time Pointer-Machine Algorithms for Least Common Ancestors. In Procs. ACM STOC, ACM Press, 1998.

    Google Scholar 

  5. R. Cole and R. Hariharan. Dynamic LCA Queries on Trees. In Proceedings of the Symposium on Discrete Algorithms (SODA), pages 235–244. ACM/SIAM, 1999.

    Google Scholar 

  6. A. Dal Palù, E. Pontelli, D. Ranjan. An Optimal Algorithm for Finding NCA on Pure Pointer Machines. NMSU-TR-CS-007/2001, http://www.cs.nmsu.edu, 2001.

  7. H.N. Gabow and R. E. Tarjan A linear-time algorithm for a special case of disjoint set union J. Comput. System Sci 30 (1985), 209–221.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge Press, 1999.

    Google Scholar 

  9. D. Harel and R.E. Tarjan. Fast Algorithms for Finding Nearest Common Ancestor. SIAM Journal of Computing, 13(2):338–355, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  10. E. Pontelli and D. Ranjan. A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines. TR-CS-006/2001, New Mexico State U., 2001.

    Google Scholar 

  11. E. Pontelli and D. Ranjan. Ancestor Problems on Pure Pointer Machines. In LATIN, 2002.

    Google Scholar 

  12. D. Ranjan et al. An Optimal Data Structure to Handle Dynamic Environments in Non-deterministic Computations. Computer Languages, (to appear).

    Google Scholar 

  13. D. Ranjan, E. Pontelli, L. Longpre, and G. Gupta. The Temporal Precedence Problem. Algorithmica, 28:288–306, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  14. B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors. SIAM J. Comp., 17:1253–1262, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. Tsakalidis. Maintaining Order in a Generalized Linked List. ACTA Informatica, (21):101–112, 1984.

    Google Scholar 

  16. A.K. Tsakalidis. The Nearest Common Ancestor in a Dynamic Tree. ACTA Informatica, 25:37–54, 1988.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, New Mexico State University, USA

    A. Dal Palú, E. Pontelli & D. Ranjan

Authors
  1. A. Dal Palú
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Pontelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Ranjan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Applied Mathematics, University of Kuopio, P.O. Box 1627, 70211, Kuopio, Finland

    Martti Penttonen

  2. BRICS, University of Aarhus, Department of Computer Science, NY Munkegade, 8000, Aarhus C, Denmark

    Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dal Palú, A., Pontelli, E., Ranjan, D. (2002). An Optimal Algorithm for Finding NCA on Pure Pointer Machines. In: Penttonen, M., Schmidt, E.M. (eds) Algorithm Theory — SWAT 2002. SWAT 2002. Lecture Notes in Computer Science, vol 2368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45471-3_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-45471-3_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43866-3

  • Online ISBN: 978-3-540-45471-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation