O(1) reversible tree navigation without cycles

DOI10.1017/S1471068401001065MaRDI QIDQ4452644zbMATH OpenFDO

Authors Richard A. O'Keefe

Publication date 1 March 2004

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

editing back-link

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 3982557
• Calculating with acyclic and cyclic lists
• Constructing a binary tree from its traversals by reversible recursion and iteration
• A bounded-space tree traversal algorithm
• A tight amortized bound for path reversal

Cited in

(2)

• scientific article; zbMATH DE number 3982557 (Why is no real title available?)
• Representation sharing for Prolog

This page was built for publication: O(1) reversible tree navigation without cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452644)