scientific article; zbMATH DE number 2127730

zbMATH Open1094.68113MaRDI QIDQ3154677FDOQ3154677

Authors: Conrado Martínez, Xavier Molinero 

Publication date: 14 January 2005

Title of this publication is not available (Why is that?)

Recommendations

• Mathematical Foundations of Computer Science 2003
• A generic approach for the unranking of labeled combinatorial classes
• Publication:4952625
• Random and exhaustive generation of permutations and cycles
• A calculus for the random generation of labelled combinatorial structures

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (4)

• Efficient iteration in admissible combinatorial classes
• Mathematical Foundations of Computer Science 2003
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence

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 Q3154677)