Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Orden lexicográfico")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 133

  • Page / 6
Export

Selection :

  • and

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

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

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

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

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

Inequalities characterizing standard Sturmian and episturmian wordsPIRILLO, Giuseppe.Theoretical computer science. 2005, Vol 341, Num 1-3, pp 276-292, issn 0304-3975, 17 p.Article

Theorem proving with sequence variables and flexible arity symbolsKUTSIA, Temur.Lecture notes in computer science. 2002, pp 278-291, issn 0302-9743, isbn 3-540-00010-0, 14 p.Conference Paper

A fully syntactic AC-RPORUBIO, A.Lecture notes in computer science. 1999, pp 133-147, issn 0302-9743, isbn 3-540-66201-4Conference Paper

Nonuniformization results for the projective hierarchyJACKSON, S; MAULDIN, R. D.The Journal of symbolic logic. 1991, Vol 56, Num 2, pp 742-748, issn 0022-4812Article

Small programming exercises 24REM, M.Science of computer programming. 1990, Vol 14, Num 1, pp 97-101, issn 0167-6423, 5 p.Article

On lexicographic semi-commutationsMETIVIER, Y; OCHMANSKI, E.Information processing letters. 1987, Vol 26, Num 2, pp 55-59, issn 0020-0190Article

On the simplest centralizer of a languageMASSAZZA, Paolo; SALMELA, Petri.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 295-301, issn 0988-3754, 7 p.Article

Linear time algorithms on chordal bipartite and strongly chordal graphsUEHARA, Ryuhei.Lecture notes in computer science. 2002, pp 993-1004, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

On distance-preserving and domination elimination orderingsCHEPOI, V.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 3, pp 414-436, issn 0895-4801Article

Reversing is not inherent in lexicographical permutation generationROHL, J. S.Computer journal (Print). 1990, Vol 33, Num 3, pp 274-278, issn 0010-4620, 5 p.Article

Classifying sets of measure zero with respect to their open coversJUST, W; LAFLAMME, C.Transactions of the American Mathematical Society. 1990, Vol 321, Num 2, pp 621-645, issn 0002-9947Article

Classes of admissible permutations that are generatable by depth-first traversals of ordered treesER, M. C.Computer journal (Print). 1989, Vol 32, Num 1, pp 76-85, issn 0010-4620Article

Generating binary trees of bounded heightLEE, C. C; LEE, D. T; WONG, C. K et al.Acta informatica. 1986, Vol 23, Num 5, pp 529-544, issn 0001-5903Article

Convergence theorems for p-norm minimizers with respect to pKIDO, K.Journal of optimization theory and applications. 2005, Vol 125, Num 3, pp 577-589, issn 0022-3239, 13 p.Article

The representation of permutations by treesBHATTACHARYA, P.Computers & mathematics with applications (1987). 1994, Vol 28, Num 9, pp 67-71, issn 0898-1221Article

Crossability of cancellative kleene semigroupsRUPERT, C. P.Informatique théorique et applications (Imprimé). 1992, Vol 26, Num 2, pp 151-161, issn 0988-3754Article

A construction for recursive linear orderingASH, C. J.The Journal of symbolic logic. 1991, Vol 56, Num 2, pp 673-683, issn 0022-4812Article

Ramsey theorems for knots, links and spatial graphsNEGAMI, S.Transactions of the American Mathematical Society. 1991, Vol 324, Num 2, pp 527-541, issn 0002-9947Article

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

  • Page / 6