A note on combination generatorsGAN, C. T.ACM transactions on mathematical software. 1985, Vol 11, Num 2, pp 154-156, issn 0098-3500Article

Generation of permutations in direct lexicographic ordering by arithmetic methodsSPOLETINI, E.Computer journal (Print). 1985, Vol 28, Num 4, pp 444-445, issn 0010-4620Article

Permutation backtracking in lexicographic orderIRVING, R. W.Computer journal (Print). 1984, Vol 27, Num 4, pp 373-375, issn 0010-4620Article

Address calculation algorithms for ordered sets of combinationsNISHIHARA, S; IKEDA, K.Information processing letters. 1983, Vol 17, Num 5, pp 251-253, issn 0020-0190Article

General algorithms for the address calculation of lexicographically ordered tuplesKOTHARI, S. C; RAMARAO, K. V. S.Information processing letters. 1985, Vol 21, Num 3, pp 113-116, issn 0020-0190Article

Engineering a lightweight suffix array construction algorithm: (Extended abstract)MANZINI, Giovanni; FERRAGINA, Paolo.Lecture notes in computer science. 2002, pp 698-710, issn 0302-9743, isbn 3-540-44180-8, 13 p.Conference Paper

Lexicographic ordering, ranking and uranking of combinationsER, M. C.International journal of computer mathematics. 1985, Vol 17, Num 3, pp 277-283, issn 0020-7160Article

Representable P. Martin-Löf testsSTAIGER, L.Kybernetika. 1985, Vol 21, Num 3, pp 235-243, issn 0023-5954Article

Strightening codeterminantsWOODCOCK, D. J.Journal of pure and applied algebra. 1993, Vol 88, Num 1-3, pp 317-320, issn 0022-4049Article

CorrigendumOTERO, M.The Journal of symbolic logic. 1991, Vol 56, Num 3, pp 811-812, issn 0022-4812Article

The jump number of suborders of the power set orderFUREDI, Z; REUTER, K.Order (Dordrecht). 1989, Vol 6, Num 1, pp 101-103, issn 0167-8094, 3 p.Article

The exact isoperimetric inequality for ternary and quaternary cubesSLIVNIK, Tomaz.Discrete mathematics. 2002, Vol 244, Num 1-3, pp 455-460, issn 0012-365XConference Paper

LEXICOGRAPHIC MATCHING IN BOOLEAN ALGEBRASAIGNER M.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 3; PP. 187-194; BIBL. 3 REF.Serial Issue

Polyhedral graphs with restricted number of faces of the same typeVOIGT, M; WALTHER, H.Discrete mathematics. 2002, Vol 244, Num 1-3, pp 473-478, issn 0012-365XConference Paper

Permutation representation of k-ary treesRAMANAN, P. V; LIU, C. L.Theoretical computer science. 1985, Vol 38, Num 1, pp 83-98, issn 0304-3975Article

GENERATING TREES AND OTHER COMBINATORIAL OBJECTS LEXICOGRAPHICALLYZAKS S; RICHARDS D.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 1; PP. 73-81; BIBL. 16 REF.Article

ORDRE LEXICOGRAPHIQUE DES ARBRESVOLOSHINA AA.1977; DOKL. AKAD. NAUK B.S.S.R.; S.S.S.R.; DA. 1977; VOL. 21; NO 3; PP. 213-215; BIBL. 1 REF.Article

PROBLEME MULTICRITERE D'AFFECTATIONKHMEL'NIK SI.1977; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1977; NO 4; PP. 64-66; BIBL. 4 REF.Article

Iterative Lexicographic Path OrdersWILLEM KLOP, Jan; VAN OOSTROM, Vincent; DE VRIJER, Roel et al.Algebra, meaning, and computation (essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday). Lecture notes in computer science. 2006, pp 541-554, issn 0302-9743, isbn 3-540-35462-X, 1Vol, 14 p.Book Chapter

A new algorithm for generation of exactly M-block set partitions in associative modelKOKOSINSKI, Zbigniew.Lecture notes in computer science. 2006, pp 67-74, issn 0302-9743, isbn 3-540-34141-2, 1Vol, 8 p.Conference Paper

Termination of S-expression rewriting systems: Lexicographic path ordering for higher-order termsTOYAMA, Yoshihito.Lecture notes in computer science. 2004, pp 40-54, issn 0302-9743, isbn 3-540-22153-0, 15 p.Conference Paper

Average cost of Duval's algorithm for generating Lyndon wordsBERSTEL, J; POCCHIOLA, M.Theoretical computer science. 1994, Vol 132, Num 1-2, pp 415-425, issn 0304-3975Article

Piecewise lexicographic programming : a new model for practical decision problemsPREMOLI, A; UKOVICH, W.Journal of optimization theory and applications. 1992, Vol 72, Num 1, pp 113-142, issn 0022-3239Article

A simple systolic algorithm for generating combinations in lexicographic orderSTOJMENOVIC, I.Computers & mathematics with applications (1987). 1992, Vol 24, Num 4, pp 61-64, issn 0898-1221Article

A systolic generation of combinationsCHAU-JY LIN; JONG-CHUANG TSAY.BIT (Nordisk Tidskrift for Informationsbehandling). 1989, Vol 29, Num 1, pp 23-36, issn 0006-3835Article