Clean reversible simulations of ranking binary trees

DOI10.1007/978-3-319-73216-9_11MaRDI QIDQ5112174zbMATH OpenOpenAlexFDO

Authors Yuhi Ohkubo, Tetsuo Yokoyama, Chishun Kanayama

Publication date 28 May 2020

Published in Reversibility and Universality (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-73216-9_11

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Data structures (68P05) Analysis of algorithms (68W40)

Recommendations

• Constructing a binary tree from its traversals by reversible recursion and iteration
• Ranking and unranking trees using regular reductions
• Programming techniques for reversible comparison sorts
• Enumerating, Ranking and Unranking Binary Trees
• Reversible Flowchart Languages and the Structured Reversible Program Theorem

Cites work

• A numbering system for binary trees
• A simple and efficient universal reversible Turing machine
• Combinators for bi-directional tree transformations: a linguistic approach to the view update problem
• Conservative logic
• Enumerating Ordered Trees Lexicographically
• Frugal encoding in reversible \(\mathcal{MOQA}\): a case study for Quicksort
• Functional and Logic Programming
• Garbageless reversible implementation of integer linear transformations
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 1738656 (Why is no real title available?)
• Information effects
• Introduction to algorithms.
• Logical Reversibility of Computation
• Optimizing reversible simulation of injective functions
• Programming techniques for reversible comparison sorts
• Real-time methods in reversible computation
• Reversible Computing
• Reversible computing and cellular automata -- a survey
• Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
• Synthesis and optimization of reversible circuits -- a survey
• Term Rewriting and Applications
• The generation of binary trees as a numerical problem
• Time/Space Trade-Offs for Reversible Computation
• Towards a design flow for reversible logic
• Towards a reversible functional language
• What do reversible programs compute?

Cited in

(3)

• Constructing a binary tree from its traversals by reversible recursion and iteration
• Preference summaries for stochastic tree rollback
• Optimizing reversible simulation of injective functions

Describes a project that uses

Uses Software

• Janus

This page was built for publication: Clean reversible simulations of ranking binary trees

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