Inhomogeneous sorting
From MaRDI portal
Publication:5904229
DOI10.1007/BF00993053zbMath0423.68027OpenAlexW4256498606MaRDI QIDQ5904229
Anatoly V. Anisimov, Donald E. Knuth
Publication date: 1979
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00993053
Related Items (11)
Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids ⋮ Solving trace equations using lexicographical normal forms ⋮ Solving word equations modulo partial commutations ⋮ Finding k Partially Disjoint Paths in a Directed Planar Graph ⋮ Logical definability on infinite traces ⋮ On the length of fully commutative elements ⋮ Structure and enumeration of \((3+1)\)-free posets ⋮ Operational semantics with semicommutations ⋮ Algebraic Structure of Step Traces and Interval Traces ⋮ SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE ⋮ Number of prefixes in trace monoids: clique polynomials and dependency graphs
Cites Work
This page was built for publication: Inhomogeneous sorting
