The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Péter L. Erdös: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow
    Constructing Big Trees from Short Sequences. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:827-837 [Conf]
  2. Péter L. Erdös, László A. Székely
    Algorithms and Min-max Theorems for Certain Multiway Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:334-345 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1997, v:16, n:2, pp:- [Journal]
  4. Rudolf Ahlswede, Péter L. Erdös, Niall Graham
    A Splitting Property of Maximal Antichains. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:475-480 [Journal]
  5. Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
    Intersecting Sperner families and their convex hulls. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:21-34 [Journal]
  6. Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
    Extremal hypergraph problems and convex hulls. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:1, pp:11-26 [Journal]
  7. Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
    Sharpening the LYM inequality. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:287-293 [Journal]
  8. 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. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:1, pp:27-45 [Journal]
  9. Péter L. Erdös, Péter Sziklai, David C. Torney
    A Finite Word Poset. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  10. Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
    Intersecting Systems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:127-137 [Journal]
  11. Péter L. Erdös, Ulrich Faigle, Walter Kern
    A Group-Theoretic Setting for Some Intersecting Sperner Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:323-334 [Journal]
  12. Péter L. Erdös, Ákos Seress, László A. Székely
    On Intersecting Chains in Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:57-62 [Journal]
  13. Péter L. Erdös, András Frank, László A. Székely
    Minimum Multiway Cuts in Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:67-75 [Journal]
  14. Péter L. Erdös, László A. Székely
    Counting Bichromatic Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:1, pp:1-8 [Journal]
  15. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:4, pp:369-379 [Journal]
  16. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:2, pp:158-166 [Journal]
  17. Péter L. Erdös, Gyula O. H. Katona
    All maximum 2-part Sperner families. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:1, pp:58-69 [Journal]
  18. Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein
    Parameterized matching with mismatches. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:135-140 [Journal]
  19. Péter L. Erdös, László A. Székely
    On weighted multiway cuts in trees. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:65, n:, pp:93-105 [Journal]
  20. 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). [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:2, pp:153-184 [Journal]
  21. Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona
    Two-Part and k-Sperner Families: New Proofs Using Permutations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:489-500 [Journal]
  22. Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
    Note on the game chromatic index of trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:371-376 [Journal]
  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: Part II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:77-118 [Journal]
  24. Péter L. Erdös, Lajos Soukup
    How To Split Antichains In Infinite Posets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:147-161 [Journal]
  25. Péter L. Erdös
    Splitting property in infinite posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:251-256 [Journal]
  26. Konrad Engel, Péter L. Erdös
    Polytopes determined by complementfree Sperner families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:2, pp:165-169 [Journal]
  27. Péter L. Erdös
    A new bijection on rooted forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:179-188 [Journal]
  28. Péter L. Erdös, Ulrich Faigle, Walter Kern
    On the average rank of LYM-sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:144, n:1-3, pp:11-22 [Journal]

  29. Subwords in reverse-complement order. [Citation Graph (, )][DBLP]


  30. Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance [Citation Graph (, )][DBLP]


  31. All Maximum Size Two-Part Sperner Systems: In Short. [Citation Graph (, )][DBLP]


  32. Quasi-kernels and quasi-sinks in infinite graphs. [Citation Graph (, )][DBLP]


Search in 0.034secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002