Péter L. Erdös

	2012
43		Péter L. Erdös, Claude Tardif, Gábor Tardos: On infinite-finite duality pairs of directed graphs CoRR abs/1203.1257: (2012)
42		Péter L. Erdös, Claude Tardif, Gábor Tardos: Caterpillar dualities and regular languages CoRR abs/1203.1347: (2012)
	2011
41		Péter L. Erdös, Lajos Soukup, Jens Stoye: Balanced vertices in trees and a simpler algorithm to compute the genomic distance. Appl. Math. Lett. 24(1): 82-86 (2011)
40		Harout K. Aydinian, Péter L. Erdös: On two-part Sperner systems for regular posets (Extended Abstract). Electronic Notes in Discrete Mathematics 38: 87-92 (2011)
39		Harout K. Aydinian, Éva Czabarka, Péter L. Erdös, László A. Székely: A tour of M-part L-Sperner families. J. Comb. Theory, Ser. A 118(2): 702-725 (2011)
	2010
38		Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták: Efficient Reconstruction of RC-Equivalent Strings. IWOCA 2010: 349-362
37		Alberto Apostolico, Péter L. Erdös, Alpár Jüttner: Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract). SPIRE 2010: 365-371
36		Péter L. Erdös, Lajos Soukup, Jens Stoye: Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance CoRR abs/1004.2735: (2010)
35		Péter L. Erdös, István Miklós, Zoltán Toroczkai: A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs. Electr. J. Comb. 17(1): (2010)
34		Péter L. Erdös, Lajos Soukup: No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. Order 27(3): 317-325 (2010)
	2009
33		Péter L. Erdös, Lajos Soukup: Quasi-kernels and quasi-sinks in infinite graphs. Discrete Mathematics 309(10): 3040-3048 (2009)
	2007
32		Péter L. Erdös, Lajos Soukup: How To Split Antichains In Infinite Posets. Combinatorica 27(2): 147-161 (2007)
31		Harout K. Aydinian, Péter L. Erdös: All Maximum Size Two-Part Sperner Systems: In Short. Combinatorics, Probability & Computing 16(4): 553-555 (2007)
30		Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein: Parameterized matching with mismatches. J. Discrete Algorithms 5(1): 135-140 (2007)
	2006
29		Péter L. Erdös, Péter Ligeti, Péter Sziklai, David C. Torney: Subwords in reverse-complement order. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006
	2005
28		Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona: Two-Part and k-Sperner Families: New Proofs Using Permutations. SIAM J. Discrete Math. 19(2): 489-500 (2005)
	2004
27		Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern: Note on the game chromatic index of trees. Theor. Comput. Sci. 303(3): 371-376 (2004)
	2003
26		Arkadii G. D'yachkov, Péter L. Erdös, Anthony J. Macula, Vyacheslav V. Rykov, David C. Torney, Chang-Shung Tung, Pavel A. Vilenkin, P. Scott White: Exordium for DNA Codes. J. Comb. Optim. 7(4): 369-379 (2003)
	2001
25		Péter L. Erdös, Péter Sziklai, David C. Torney: A Finite Word Poset. Electr. J. Comb. 8(2): (2001)
	2000
24		Péter L. Erdös, Ákos Seress, László A. Székely: Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. Combinatorica 20(1): 27-45 (2000)
	1999
23		Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow: A few logs suffice to build (almost) all trees (I). Random Struct. Algorithms 14(2): 153-184 (1999)
22		Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow: A Few Logs Suffice to Build (almost) All Trees: Part II. Theor. Comput. Sci. 221(1-2): 77-118 (1999)
	1998
21		Péter L. Erdös, András Frank, László A. Székely: Minimum Multiway Cuts in Trees. Discrete Applied Mathematics 87(1-3): 67-75 (1998)
	1997
20		Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow: Constructing Big Trees from Short Sequences. ICALP 1997: 827-837
19		Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely: Intersecting Systems. Combinatorics, Probability & Computing 6(2): 127-137 (1997)
18		Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow: Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. Computers and Artificial Intelligence 16(2): (1997)
17		Péter L. Erdös: Splitting property in infinite posets. Discrete Mathematics 163(1-3): 251-256 (1997)
	1995
16		Rudolf Ahlswede, Péter L. Erdös, Niall Graham: A Splitting Property of Maximal Antichains. Combinatorica 15(4): 475-480 (1995)
15		Péter L. Erdös, Ulrich Faigle, Walter Kern: On the average rank of LYM-sets. Discrete Mathematics 144(1-3): 11-22 (1995)
	1994
14		Péter L. Erdös, Ákos Seress, László A. Székely: On Intersecting Chains in Boolean Algebras. Combinatorics, Probability & Computing 3: 57-62 (1994)
13		Péter L. Erdös, László A. Székely: On weighted multiway cuts in trees. Math. Program. 65: 93-105 (1994)
	1993
12		Péter L. Erdös, László A. Székely: Counting Bichromatic Evolutionary Trees. Discrete Applied Mathematics 47(1): 1-8 (1993)
11		Péter L. Erdös: A new bijection on rooted forests. Discrete Mathematics 111(1-3): 179-188 (1993)
	1992
10		Péter L. Erdös, László A. Székely: Algorithms and Min-max Theorems for Certain Multiway Cuts. IPCO 1992: 334-345
9		Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely: Sharpening the LYM inequality. Combinatorica 12(3): 287-293 (1992)
8		Péter L. Erdös, Ulrich Faigle, Walter Kern: A Group-Theoretic Setting for Some Intersecting Sperner Families. Combinatorics, Probability & Computing 1: 323-334 (1992)
	1990
7		Konrad Engel, Péter L. Erdös: Polytopes determined by complementfree Sperner families. Discrete Mathematics 81(2): 165-169 (1990)
	1989
6		Konrad Engel, Péter L. Erdös: Sperner families satisfying additional conditions and their convex hulls. Graphs and Combinatorics 5(1): 47-56 (1989)
	1986
5		Péter L. Erdös, Gyula O. H. Katona: Convex hulls of more-part Sperner families. Graphs and Combinatorics 2(1): 123-134 (1986)
4		Péter L. Erdös, Gyula O. H. Katona: All maximum 2-part Sperner families. J. Comb. Theory, Ser. A 43(1): 58-69 (1986)
	1985
3		Péter L. Erdös, Peter Frankl, Gyula O. H. Katona: Extremal hypergraph problems and convex hulls. Combinatorica 5(1): 11-26 (1985)
	1984
2		Péter L. Erdös, Peter Frankl, Gyula O. H. Katona: Intersecting Sperner families and their convex hulls. Combinatorica 4(1): 21-34 (1984)
	1982
1		Péter L. Erdös, Peter Frankl, Zoltán Füredi: Families of Finite Sets in Which No Set Is Covered by the Union of Two Others. J. Comb. Theory, Ser. A 33(2): 158-166 (1982)

Coauthor Index

1	Rudolf Ahlswede	[16] [19]
2	Noga Alon	[19]
3	Alberto Apostolico	[30] [37]
4	Harout K. Aydinian	[31] [39] [40]
5	Ferdinando Cicalese	[38]
6	Éva Czabarka	[39]
7	Arkadii G. D'yachkov	[26]
8	Konrad Engel	[6] [7]
9	Ulrich Faigle	[8] [15] [27]
10	András Frank	[21]
11	Peter Frankl	[1] [2] [3] [9]
12	Zoltán Füredi	[1] [28]
13	Niall Graham	[16]
14	Winfried Hochstättler	[27]
15	Alpár Jüttner	[37]
16	Gyula O. H. Katona	[2] [3] [4] [5] [28]
17	Walter Kern	[8] [15] [27]
18	Daniel J. Kleitman	[9]
19	Moshe Lewenstein	[30]
20	Péter Ligeti	[29]
21	Zsuzsanna Lipták	[38]
22	Anthony J. Macula	[26]
23	István Miklós	[35]
24	Miklós Ruszinkó	[19]
25	Vyacheslav V. Rykov	[26]
26	Michael E. Saks (Michael Saks)	[9]
27	Ákos Seress	[14] [24]
28	Lajos Soukup	[32] [33] [34] [36] [41]
29	Mike A. Steel (Michael Anthony Steel)	[18] [20] [22] [23]
30	Jens Stoye	[36] [41]
31	László A. Székely	[9] [10] [12] [13] [14] [18] [19] [20] [21] [22] [23] [24] [39]
32	Péter Sziklai	[25] [29]
33	Claude Tardif	[42] [43]
34	Gábor Tardos	[42] [43]
35	David C. Torney	[25] [26] [29]
36	Zoltán Toroczkai	[35]
37	Chang-Shung Tung	[26]
38	Pavel A. Vilenkin	[26]
39	Tandy Warnow	[18] [20] [22] [23]
40	P. Scott White	[26]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page