Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("68R05")

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

Author Country

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

Results 1 to 25 of 155

  • Page / 7
Export

Selection :

  • and

On the combinatorics of the Pfaff identityCHEN, William Y. C; PANG, Sabrina X. M.Discrete mathematics. 2009, Vol 309, Num 8, pp 2190-2196, issn 0012-365X, 7 p.Article

Three-element codes with one d-primitive wordLI, Zheng-Zhu; TSAI, Y. S.Acta informatica. 2004, Vol 41, Num 2-3, pp 171-180, issn 0001-5903, 10 p.Article

Long binary patterns are Abelian 2-avoidableCURRIE, James D; VISENTIN, Terry I.Theoretical computer science. 2008, Vol 409, Num 3, pp 432-437, issn 0304-3975, 6 p.Article

Reconstruction of a word from a multiset of its factorsPINA, Claribet; UZCATEGUI, Carlos.Theoretical computer science. 2008, Vol 400, Num 1-3, pp 70-83, issn 0304-3975, 14 p.Article

A note on the Burrows-Wheeler transformationCROCHEMORE, Maxime; DESARMENIEN, Jacques; PERRIN, Dominique et al.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 567-572, issn 0304-3975, 6 p.Article

The covolume of discrete subgroups of Iso(H2m)ZEHRT, Thomas.Discrete mathematics. 2009, Vol 309, Num 8, pp 2284-2291, issn 0012-365X, 8 p.Article

SMALL DIAMETERS OF DUALSNESETRIL, Jaroslav; SVEJDAROVA, Ida.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 2, pp 374-384, issn 0895-4801, 11 p.Article

HOW HARD IS IT TO APPROXIMATE THE BEST NASH EQUILIBRIUM?HAZAN, Elad; KRAUTHGAMER, Robert.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 79-91, issn 0097-5397, 13 p.Article

ANALYSIS OF DELAYS CAUSED BY LOCAL SYNCHRONIZATIONLIPMAN, Julia; STOUT, Quentin F.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3860-3884, issn 0097-5397, 25 p.Article

Improved bounds for separating hash familiesBAZRAFSHAN, Marjan; VAN TRUNG, Tran.Designs, codes and cryptography. 2013, Vol 69, Num 3, pp 369-382, issn 0925-1022, 14 p.Article

Planes and processesJOHNSON, Norman L.Discrete mathematics. 2009, Vol 309, Num 2, pp 430-461, issn 0012-365X, 32 p.Conference Paper

PARIKH TEST SETS FOR COMMUTATIVE LANGUAGESHOLUB, Stepean.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 3, pp 525-538, issn 0988-3754, 14 p.Conference Paper

COMBINATORICS AND GENUS OF TROPICAL INTERSECTIONS AND EHRHART THEORYSTEFFENS, Reinhard; THEOBALD, Thorsten.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 1, pp 17-32, issn 0895-4801, 16 p.Article

More on the Magnus-Derek gameCHEN, Li-Jui; LIN, Jinn-Jy; SHIEH, Min-Zheng et al.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 339-344, issn 0304-3975, 6 p.Article

ON ADDITIVE DOUBLING AND ENERGYHAWK KATZ, Nets; KOESTER, Paul.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 4, pp 1684-1693, issn 0895-4801, 10 p.Article

A sufficient condition for the bicolorability of a hypergraphDEFOSSEZ, David.Discrete mathematics. 2008, Vol 308, Num 11, pp 2265-2268, issn 0012-365X, 4 p.Article

A TWO-SET PROBLEM ON COLORING THE INTEGERSRYAN, Jeffrey A.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 3, pp 731-736, issn 0895-4801, 6 p.Article

Sparse distance preservers and additive spannersBOLLOBAS, Béla; COPPERSMITH, Don; ELKIN, Michael et al.SIAM journal on discrete mathematics (Print). 2006, Vol 19, Num 4, pp 1029-1055, issn 0895-4801, 27 p.Article

Updatable timed automataBOUYER, Patricia; DUFOURD, Catherine; FLEURY, Emmanuel et al.Theoretical computer science. 2004, Vol 321, Num 2-3, pp 291-345, issn 0304-3975, 55 p.Article

A NOTE ON THE NUMBER OF SQUARES IN A PARTIAL WORD WITH ONE HOLEBLANCHET-SADRI, Francine; MERCAS, Robert.Informatique théorique et applications (Imprimé). 2009, Vol 43, Num 4, pp 767-774, issn 0988-3754, 8 p.Article

On systems of word equations over three unknowns with at most six occurrences of one of the unknownsCZEIZLER, Elena; PLANDOWSKI, Wojciech.Theoretical computer science. 2009, Vol 410, Num 30-32, pp 2889-2909, issn 0304-3975, 21 p.Article

A probabilistic approach to the dichotomy problemLUCZAK, Tomasz; NESETRIL, Jaroslav.SIAM journal on computing (Print). 2007, Vol 36, Num 3, pp 835-843, issn 0097-5397, 9 p.Article

Irreducible (v3) configurations and graphsBOBEN, Marko.Discrete mathematics. 2007, Vol 307, Num 3-5, pp 331-344, issn 0012-365X, 14 p.Article

Deterministic extractors for bit-fixing sources by obtaining an independent seedGABIZON, Ariel; RAZ, Ran; SHALTIEL, Ronen et al.SIAM journal on computing (Print). 2007, Vol 36, Num 4, pp 1072-1094, issn 0097-5397, 23 p.Article

h-FOLD SUMS FROM A SET WITH FEW PRODUCTSCROOT, Ernie; HART, Derrick; ELEKES, György et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 505-519, issn 0895-4801, 15 p.Article

  • Page / 7