( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Constructing Big Trees from Short Sequences.

, , , и . ICALP, том 1256 из Lecture Notes in Computer Science, стр. 827-837. Springer, (1997)

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.

Erwin Erdös

Georg Erdös

György Erdös

Gabor Erdös

Adorján Miklós Erdös

 

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

Balanced vertices in trees and a simpler algorithm to compute the genomic distance., , и . Appl. Math. Lett., 24 (1): 82-86 (2011)Subwords in reverse-complement order., , , и . Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, том 06201 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)Efficient Reconstruction of RC-Equivalent Strings., , и . IWOCA, том 6460 из Lecture Notes in Computer Science, стр. 349-362. Springer, (2010)Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets., , и . Combinatorica, 20 (1): 27-45 (2000)The mixing time of the swap (switch) Markov chains: a unified approach., , , , , и . CoRR, (2019)Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence., , и . Electron. J. Comb., 20 (1): 16 (2013)A Finite Word Poset., , и . Electron. J. Comb., (2001)Fully graphic degree sequences and P-stable degree sequences., , и . CoRR, (2024)Constructing Big Trees from Short Sequences., , , и . ICALP, том 1256 из Lecture Notes in Computer Science, стр. 827-837. Springer, (1997)On Realizations of a Joint Degree Matrix, , , и . CoRR, (2013)