{# # This file is part of Invenio. # Copyright (C) 2015 CERN. # # Invenio is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; either version 2 of the # License, or (at your option) any later version. # # Invenio is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with Invenio; if not, write to the Free Software Foundation, Inc., # 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA. #} {% extends config.GROBID_BASE_TEMPLATE %} {%- block css %} {{ super() }} {%- assets "invenio_grobid_css" %} {%- endassets %} {%- endblock css %} {% block javascript %} {{ super() }} {% assets "invenio_grobid_js" %} {% endassets %} {%- endblock javascript %} {% block body %}

GROBID

Choose File
Title
The LCA Problem Revisited
Authors
  • Michael A. Bender (SUNY Stony Brook)
  • Martín Farach-Colton (Rutgers University)
Abstract
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable. Interestingly, this algorithm is a sequentialization of a previously known PRAM algorithm of Berkman, Breslauer, Galil, Schieber, and Vishkin.
Keywords
  • Data Structures
  • Least Common Ancestor (LCA)
  • Range Minimum Query (RMQ)
  • Cartesian Tree
References
  1. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin. Highly parallelizable problems. In Proc. of the 21st Ann. ACM Symp on Theory of Computing, pages 309-319, 1989.
  2. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput.,, 13(2):338-355, 1984.
  3. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput., 17:1253-1262, 1988.
{% endblock %}