scientific article; zbMATH DE number 3435566
From MaRDI portal
Publication:4402005
zbMATH Open0277.10011MaRDI QIDQ4402005FDOQ4402005
Authors: A. V. Aho, N. J. A. Sloane 
Publication date: 1973
Title of this publication is not available (Why is that?)
Cited In (31)
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- On the continued fraction expansion of certain Engel series
- Trees with minimum number of infima closed sets
- Tree-shifts: the entropy of tree-shifts of finite type
- On the mean number of encryptions for tree-based broadcast encryption schemes
- Continued fractions for strong Engel series and Lüroth series with signs
- The number of subuniverses, congruences, weak congruences of semilattices defined by trees
- Continued fractions and irrationality exponents for modified Engel and Pierce series
- Irrationality of growth constants associated with polynomial recursions
- On subtrees of trees
- Infinite labeled trees: from rational to Sturmian trees
- Sums of four and more unit fractions and approximate parametrizations
- The algebraic entropy of classical mechanics
- A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees
- On the number of non-equivalent ancestral configurations for matching gene trees and species trees
- On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees
- Transcendency of local conjugacies in complex dynamics and transcendency of their values
- An asymptotic independence theorem for the number of matchings in graphs
- On integrality and asymptotic behavior of the \((k, l)\)-Göbel sequences
- Continued fractions for some alternating series
- On the maximum number of cycles in outerplanar and series-parallel graphs
- Surreal Birthdays and Their Arithmetic
- A conjecture on different central parts of binary trees
- On locally finite ordered rooted trees and their rooted subtrees
- Transcendency of some constants related to integer sequences of polynomial iterations
- On the number of unary-binary tree-like structures with restrictions on the unary height
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings
- On the maximum number of cycles in outerplanar and series-parallel graphs
- Enumeration problems for classes of self-similar graphs
- Unavoidable regularities in long words with bounded number of symbol occurrences
- Growth of bilinear maps
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4402005)
