Clean Reversible Simulations of Ranking Binary Trees
From MaRDI portal
Publication:5112174
DOI10.1007/978-3-319-73216-9_11zbMath1434.68749OpenAlexW2788600268MaRDI QIDQ5112174
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
Analysis of algorithms (68W40) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Data structures (68P05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Reversible computing and cellular automata -- a survey
- Conservative logic
- Real-Time Methods in Reversible Computation
- Synthesis and optimization of reversible circuits—a survey
- Towards a Reversible Functional Language
- Information effects
- What Do Reversible Programs Compute?
- A Simple and Efficient Universal Reversible Turing Machine
- Reversible Computing
- Frugal Encoding in Reversible $\mathcal{MOQA}$ : A Case Study for Quicksort
- Garbageless Reversible Implementation of Integer Linear Transformations
- Programming Techniques for Reversible Comparison Sorts
- Towards a Design Flow for Reversible Logic
- Enumerating Ordered Trees Lexicographically
- Time/Space Trade-Offs for Reversible Computation
- A numbering system for binary trees
- The generation of binary trees as a numerical problem
- Combinators for bi-directional tree transformations
- Functional and Logic Programming
- Logical Reversibility of Computation
- Term Rewriting and Applications
This page was built for publication: Clean Reversible Simulations of Ranking Binary Trees
