Skip to main content

and
  1. No Access

    Chapter

    Clean Reversible Simulations of Ranking Binary Trees

    We propose clean reversible simulations of ranking binary trees and unranking as reversible algorithms for reversible computing systems, which are useful for enumerating and randomly generating binary trees. A...

    Yuhi Ohkubo, Tetsuo Yokoyama, Chishun Kanayama in Reversibility and Universality (2018)