The nearest colored node in a tree
- 1 February 2018
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 710, 66-73
Abstract
No abstract availableKeywords
Funding Information
- Israel Science Foundation (794/13, 571/14)
- BSF (2014028)
This publication has 11 references indexed in Scilit:
- Optimal Lower and Upper Bounds for Representing SequencesACM Transactions on Algorithms, 2015
- Random Access to Grammar-Compressed Strings and TreesSIAM Journal on Computing, 2015
- Lowest common ancestors in trees and directed acyclic graphsJournal of Algorithms, 2005
- Maintaining information in fully dynamic trees with top treesACM Transactions on Algorithms, 2005
- Dynamic Perfect Hashing: Upper and Lower BoundsSIAM Journal on Computing, 1994
- Recursive Star-Tree Parallel Data StructureSIAM Journal on Computing, 1993
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Log-logarithmic worst-case range queries are possible in space Θ(N)Information Processing Letters, 1983
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976