On the lexicographical generation of compressed codes

DOI10.1016/J.IPL.2007.05.011MaRDI QIDQ2380004zbMATH OpenOpenAlexFDO

Authors Markus E. Nebel

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.05.011

zbMATH Keywords

analysis of algorithmscombinatorial problemslexicographical generation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Generating words lexicographically: An average-case analysis
• scientific article; zbMATH DE number 1206598
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
• scientific article; zbMATH DE number 617583
• scientific article; zbMATH DE number 2104766

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)