Péter L. Erdős
Péter L. Erdős
Research Professor, A. Renyi Institue of Mathematics, HAS
確認したメール アドレス: renyi.mta.hu - ホームページ
タイトル
引用先
引用先
年
A few logs suffice to build (almost) all trees (I)
PL Erdos, MA Steel, LA Székely, TJ Warnow
Random Structures and Algorithms 14 (2), 153-184, 1999
342*1999
Degree-based graph construction
H Kim, Z Toroczkai, PL Erdős, I Miklós, LA Székely
Journal of Physics A: Mathematical and Theoretical 42, 392001, 2009
95*2009
Fourier calculus on evolutionary trees
MA Steel, LA Székely, PL Erdős
Adv Appl Math 14, 200-216, 1993
881993
A complete family of phylogenetic invariants for any number of taxa under Kimura's 3ST model
M Steel, L Székely, PL Erdös, P Waddell
New Zealand journal of botany 31 (3), 289-296, 1993
741993
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
PL Erdős, I Miklós, Z Toroczkai
arXiv preprint arXiv:0905.4913, 2009
712009
Constructing big trees from short sequences
PL Erdös, MA Steel, LA Székely, TJ Warnow
International Colloquium on Automata, Languages, and Programming, 827-837, 1997
611997
Exordium for DNA codes
AG D'yachkov, PL Erdös, AJ Macula, VV Rykov, DC Torney, CS Tung, ...
Journal of Combinatorial Optimization 7 (4), 369-379, 2003
582003
Towards random uniform sampling of bipartite graphs with given degree sequence
PL Erdös, I Miklós, L Soukup
Electronic Journal of Combinatorics 20 (1), #16, 2013
532013
On weighted multiway cuts in trees
PL Erdős, LA Székely
Mathematical programming 65 (1), 93-105, 1994
521994
Parameterized matching with mismatches
A Apostolico, PL Erdős, M Lewenstein
Journal of Discrete Algorithms 5 (1), 135-140, 2007
472007
Extremal hypergraph problems and convex hulls
PL Erdős, GOH Katona, P Frankl
Combinatorica 5 (1), 11-26, 1985
451985
Intersecting Sperner families and their convex hulls
PL Erdős, P Frankl, GOH Katona
Combinatorica 4 (1), 21-34, 1984
431984
Spectral analysis and a closest tree method for genetic sequences
MA Steel, MD Hendy, LA Székely, PL Erdös
Applied mathematics letters 5 (6), 63-67, 1992
411992
Exact sampling of graphs with prescribed degree correlations
KE Bassler, CI Del Genio, PL Erdős, I Miklós, Z Toroczkai
New Journal of Physics 17 (8), 083052, 2015
402015
Note on the game chromatic index of trees
PL Erdös, U Faigle, W Hochstättler, W Kern
Theoretical Computer Science 313 (3), 371-376, 2004
372004
A group-theoretic setting for some intersecting Sperner families
P Erdős, U Faigle, W Kern
COMBINATORICS PROBABILITY AND COMPUTING 1, 323-334, 1992
361992
Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule
PL Erdos, MA Steel, LA Szekely, T Warnow
Computers and Artificial Intelligence 16 (2), 217-227, 1997
351997
A splitting property of maximal antichains
R Ahlswede, PL Erdős, N Graham
Combinatorica 15 (4), 475-480, 1995
341995
Applications of antilexicographic order. I. An enumerative theory of trees
PL Erdos, LA Székely
Advances in Applied Mathematics 10 (4), 488-496, 1989
321989
Approximate counting of graphical realizations
PL Erdős, SZ Kiss, I Miklós, L Soukup
PLoS One 10 (7), e0131300, 2015
30*2015
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20