( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Generating Necklaces and Strings with Forbidden Substrings.

, и . COCOON, том 1858 из Lecture Notes in Computer Science, стр. 330-339. Springer, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Thomas Gregor Frank

Systemische Inflammationsmarker und Koronarkalzifizierungen im Mehrzeilenspiral-Computertomographen bei Patienten mit Verdacht auf koronare Herzkrankheit. Uni Erlangen-Nürnberg, (2009)

Peter Franke

Designing embodied interactive software agents for e-learning: principles, components, and roles. Uni Marburg, (2008)

Frank Frank

Gottfried Franke

Renate Franke

 

Другие публикации лиц с тем же именем

Generating Binary Trees by Transpositions., и . SWAT, том 318 из Lecture Notes in Computer Science, стр. 199-207. Springer, (1988)Generating Necklaces and Strings with Forbidden Substrings., и . COCOON, том 1858 из Lecture Notes in Computer Science, стр. 330-339. Springer, (2000)Binary bubble languages and cool-lex order., , и . J. Comb. Theory A, 119 (1): 155-169 (2012)An Efficient Algorithm for Generating Necklaces with Fixed Density., и . SODA, стр. 752-758. ACM/SIAM, (1999)A fast algorithm to generate unlabeled necklaces., и . SODA, стр. 256-262. ACM/SIAM, (2000)Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn., и . SIAM J. Discret. Math., 6 (1): 152-166 (1993)A CAT algorithm for generating permutations with a fixed number of inversions., и . Inf. Process. Lett., 86 (2): 107-112 (2003)Shorthand Universal Cycles for Permutations., , и . Algorithmica, 64 (2): 215-245 (2012)Solution of some multi-dimensional lattice path parity difference recurrence relations., и . Discret. Math., 71 (1): 47-56 (1988)Drawing Venn Diagrams.. GD, том 2528 из Lecture Notes in Computer Science, стр. 381. Springer, (2002)