article

Free access

Algorithm 96: Ancestor

Author:

Robert W. FloydAuthors Info & Claims

Communications of the ACM, Volume 5, Issue 6

Pages 344 - 345

https://doi.org/10.1145/367766.368166

Published: 01 June 1962 Publication History

PDF eReader

Cited By

View all

Dong XLi BLi YZhu XWang W(2024)A segment method of querying shortest distance approximately on encrypted large-scale graphThird International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024)10.1117/12.3031415(352)Online publication date: 19-Jul-2024
https://doi.org/10.1117/12.3031415
Mo YYu LDu H(2024)A Small-Gain Analysis for an All-Pairs Shortest-Path Algorithm: Global Exponential Input-to-State StabilityIEEE Transactions on Control of Network Systems10.1109/TCNS.2023.331454911:2(821-830)Online publication date: Jun-2024
https://doi.org/10.1109/TCNS.2023.3314549
Ma CQiu NXu X(2023)A fully automatic computational framework for beam structure design from continuum structural topology optimizationStructural and Multidisciplinary Optimization10.1007/s00158-023-03704-866:12Online publication date: 29-Nov-2023
https://dl.acm.org/doi/10.1007/s00158-023-03704-8
Show More Cited By

Recommendations

Cognitive Difference of Generations in the 1970s and 1990s Towards Ancestor Worship Culture
Human Aspects of IT for the Aged Population. Technology in Everyday Living
Abstract
Ancestor worship is an important Chinese culture and custom, and it symbolizes the inheritance of tradition and filial piety. However, with the development of the economy and technology, social demographic structure changes which influences the ...
The level ancestor problem simplified
Latin American theorotical informatics

We present a simple algorithm for the Level Ancestor Problem. A Level Ancestor Query LA(v,d) requests the depth d ancestor of node v. The Level Ancestor Problem is to preprocess a given rooted tree T to support level ancestor queries. While optimal ...
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
Abstract
We study the problem of designing a resilient data structure maintaining a tree under the Faulty-RAM model [Finocchi and Italiano, STOC’04] in which up to $δ$ memory words can be corrupted by an adversary. Our data structure stores a rooted dynamic ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 5, Issue 6

June 1962

157 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/367766

Editor:
Alan J. Perlis
Carnegie Institute of Technology, Pittsburgh, PA

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1962

Published in CACM Volume 5, Issue 6

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
326
Total Downloads

Downloads (Last 12 months)69
Downloads (Last 6 weeks)14

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dong XLi BLi YZhu XWang W(2024)A segment method of querying shortest distance approximately on encrypted large-scale graphThird International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024)10.1117/12.3031415(352)Online publication date: 19-Jul-2024
https://doi.org/10.1117/12.3031415
Mo YYu LDu H(2024)A Small-Gain Analysis for an All-Pairs Shortest-Path Algorithm: Global Exponential Input-to-State StabilityIEEE Transactions on Control of Network Systems10.1109/TCNS.2023.331454911:2(821-830)Online publication date: Jun-2024
https://doi.org/10.1109/TCNS.2023.3314549
Ma CQiu NXu X(2023)A fully automatic computational framework for beam structure design from continuum structural topology optimizationStructural and Multidisciplinary Optimization10.1007/s00158-023-03704-866:12Online publication date: 29-Nov-2023
https://dl.acm.org/doi/10.1007/s00158-023-03704-8
Orlowski M(2023)An Empirical Criterion for Transitive Closure of a Searchability MatrixIntelligent Computing10.1007/978-3-031-37963-5_17(236-243)Online publication date: 20-Aug-2023
https://doi.org/10.1007/978-3-031-37963-5_17
Gharebaghi AMostafavi MEdwards GFougeyrollas P(2021)User-Specific Route Planning for People with Motor Disabilities: A Fuzzy ApproachISPRS International Journal of Geo-Information10.3390/ijgi1002006510:2(65)Online publication date: 3-Feb-2021
https://doi.org/10.3390/ijgi10020065
Amarnath Jonniya NSk MKar P(2021)Elucidating specificity of an allosteric inhibitor WNK476 among With‐No‐Lysine kinase isoforms using molecular dynamic simulationsChemical Biology & Drug Design10.1111/cbdd.1386398:3(405-420)Online publication date: 5-Jun-2021
https://doi.org/10.1111/cbdd.13863
Martin MXu XLane T(2021)A multimedia application for location-based semantic retrieval of tattoos2016 IEEE 8th International Conference on Biometrics Theory, Applications and Systems (BTAS)10.1109/BTAS.2016.7791158(1-8)Online publication date: 10-Mar-2021
https://dl.acm.org/doi/10.1109/BTAS.2016.7791158
Chen JLiu JYuan YChen XZhang FPu X(2021)Molecular Mechanisms of Diverse Activation Stimulated by Different Biased Agonists for the β2-Adrenergic ReceptorJournal of Chemical Information and Modeling10.1021/acs.jcim.1c0101662:21(5175-5192)Online publication date: 20-Nov-2021
https://doi.org/10.1021/acs.jcim.1c01016
Tao YLei HLee AMa JSchwartz R(2020)Neural Network Deconvolution Method for Resolving Pathway-Level Progression of Tumor Clonal Expression Programs With Application to Breast Cancer Brain MetastasesFrontiers in Physiology10.3389/fphys.2020.0105511Online publication date: 4-Sep-2020
https://doi.org/10.3389/fphys.2020.01055
Saeed NNam HAl-Naffouri TAlouini M(2019)A State-of-the-Art Survey on Multidimensional Scaling-Based Localization TechniquesIEEE Communications Surveys & Tutorials10.1109/COMST.2019.292197221:4(3565-3583)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.1109/COMST.2019.2921972
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Cognitive Difference of Generations in the 1970s and 1990s Towards Ancestor Worship Culture

The level ancestor problem simplified

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations