On the lexicographical generation of compressed codes

DOI10.1016/J.IPL.2007.05.011zbMATH Open1184.68325OpenAlexW2026760016MaRDI QIDQ2380004FDOQ2380004

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear probing and graphs
• Title not available (Why is that?)
• Random generation of colored trees
• Lexicographic generation of ordered trees
• On the Altitude of Nodes in Random Trees
• Title not available (Why is that?)
• Uniform random generation of decomposable structures using floating-point arithmetic
• Boltzmann sampling of unlabelled structures
• Title not available (Why is that?)
• Generating words lexicographically: An average-case analysis
• The expected additive weight of trees
• The stack-size of combinatorial tries revisited
• Mathematical Foundations of Computer Science 2003

Cited In (4)

• Interval-based approach to lexicographic representation and compression of numeric data
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Integral lexicographic codes
• Title not available (Why is that?)

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)