On the lexicographical generation of compressed codes
From MaRDI portal
(Redirected from Publication:2380004)
Recommendations
Cites work
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 1206598 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- Boltzmann sampling of unlabelled structures
- Generating words lexicographically: An average-case analysis
- Lexicographic generation of ordered trees
- Linear probing and graphs
- Mathematical Foundations of Computer Science 2003
- On the Altitude of Nodes in Random Trees
- Random generation of colored trees
- The expected additive weight of trees
- The stack-size of combinatorial tries revisited
- Uniform random generation of decomposable structures using floating-point arithmetic
Cited in
(4)- scientific article; zbMATH DE number 2104766 (Why is no real title available?)
- Integral lexicographic codes
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Interval-based approach to lexicographic representation and compression of numeric data
This page was built for publication: On the lexicographical generation of compressed codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380004)