Encoding trees by linear recurrence sequences
From MaRDI portal
Publication:1699391
DOI10.1007/s10559-017-9985-8zbMath1387.94065OpenAlexW2770219114MaRDI QIDQ1699391
Publication date: 23 February 2018
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-017-9985-8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an algorithm of Zemlyachenko for subtree isomorphism
- Two-base numeration systems
- Lexicographic generation of ordered trees
- On finding common subtrees
- On a 1-1-correspondence between rooted trees and natural numbers
- Fibonacci linear forms and parallel arithmetic algorithms for large numbers
- Prefix Encoding by Means of the $(2,3)$-Representation of Numbers
- TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
- Enumerating Ordered Trees Lexicographically
- Binary tree gray codes
- Variations on the Common Subexpression Problem
- Generating Binary Trees Lexicographically
- Tree Compression with Top Trees
This page was built for publication: Encoding trees by linear recurrence sequences