The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Boris Pittel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris Pittel
    Constrained Integer Partitions. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:59-68 [Conf]
  2. Alan M. Frieze, Boris Pittel
    Perfect matchings in random graphs with prescribed minimal degree. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:148-157 [Conf]
  3. Donald E. Knuth, Rajeev Motwani, Boris Pittel
    Stable Husbands. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:397-404 [Conf]
  4. Boris Pittel
    On Likely Solutions of a Stable Matching Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:10-15 [Conf]
  5. Christian Borgs, Jennifer T. Chayes, Boris Pittel
    Sharp threshold and scaling window for the integer partitioning problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:330-336 [Conf]
  6. Arnold Knopfmacher, Andrew M. Odlyzko, Boris Pittel, L. Bruce Richmond, Dudley Stark, G. Szekeres, Nicholas C. Wormald
    The Asymptotic Number of Set Partitions with Unequal Block Sizes. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  7. Boris Pittel
    Where the Typical Set Partitions Meet and Join. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  8. Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris Pittel
    Phase Diagram for the Constrained Integer Partitioning Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  9. Tomasz Luczak, Boris Pittel
    Componenets of Random Forests. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:35-52 [Journal]
  10. Boris Pittel
    On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:53-92 [Journal]
  11. Hosam M. Mahmoud, Boris Pittel
    Analysis of the Space of Search Trees under the Random Insertion Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:1, pp:52-75 [Journal]
  12. Boris Pittel
    Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:2, pp:236-249 [Journal]
  13. Boris Pittel, Robert S. Weishaar
    On-Line Coloring of Sparse Random Graphs and Random Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:1, pp:195-205 [Journal]
  14. Michal Karonski, Boris Pittel
    Existence of a perfect matching in a random (1+e-1)--out bipartite graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:1, pp:1-16 [Journal]
  15. Jeong Han Kim, Boris Pittel
    Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:92, n:2, pp:197-206 [Journal]
  16. Jeong Han Kim, Boris Pittel
    On Tail Distribution of Interpost Distance. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:49-56 [Journal]
  17. Vladimir Lifschitz, Boris Pittel
    The Number of Increasing Subsequences of the Random Permutation. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:31, n:1, pp:1-20 [Journal]
  18. Nathan Lulov, Boris Pittel
    On the Random Young Diagrams and Their Cores. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:86, n:2, pp:245-280 [Journal]
  19. Boris Pittel
    On the Largest Component of the Random Graph at a Nearcritical Stage. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:237-269 [Journal]
  20. Boris Pittel
    On growing a random young tableau. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:2, pp:278-285 [Journal]
  21. Boris Pittel
    Random Set Partitions: Asymptotics of Subset Counts. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:79, n:2, pp:326-359 [Journal]
  22. Boris Pittel
    Confirming Two Conjectures About the Integer Partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:88, n:1, pp:123-135 [Journal]
  23. Boris Pittel, H. Rubin
    How many random questions are necessary to identify n distinct objects? [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:55, n:2, pp:292-312 [Journal]
  24. Boris Pittel, Joel Spencer, Nicholas C. Wormald
    Sudden Emergence of a Giantk-Core in a Random Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:67, n:1, pp:111-151 [Journal]
  25. Boris Pittel, Nicholas C. Wormald
    Asymptotic enumeration of sparse graphs with a minimum degree constraint. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:101, n:2, pp:249-263 [Journal]
  26. Boris Pittel, Nicholas C. Wormald
    Counting connected graphs inside-out. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:127-172 [Journal]
  27. David Aldous, Boris Pittel
    On a random graph with immigrating vertices: Emergence of the giant component. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:2, pp:79-102 [Journal]
  28. Jonathan Aronson, Alan M. Frieze, Boris Pittel
    Maximum matchings in sparse random graphs: Karp-Sipser revisited. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:2, pp:111-177 [Journal]
  29. Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris Pittel
    Phase diagram for the constrained integer partitioning problem. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:3, pp:315-380 [Journal]
  30. Christian Borgs, Jennifer T. Chayes, Boris Pittel
    Phase transition and finite-size scaling for the integer partitioning problem. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:247-288 [Journal]
  31. Sylvie Corteel, Boris Pittel, Carla D. Savage, Herbert S. Wilf
    On the multiplicity of parts in a random partition. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:2, pp:185-197 [Journal]
  32. Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris Pittel
    The Birth of the Giant Component. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:3, pp:233-359 [Journal]
  33. Harry Kesten, Boris Pittel
    A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:8, n:4, pp:243-299 [Journal]
  34. Donald E. Knuth, Rajeev Motwani, Boris Pittel
    Stable Husbands. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:1, pp:1-14 [Journal]
  35. Daniel Panario, Boris Pittel, L. Bruce Richmond, Alfredo Viola
    Analysis of Rabin's irreducibility test for polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:525-551 [Journal]
  36. Boris Pittel
    On Tree Census and the Giant Component in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:311-342 [Journal]
  37. Boris Pittel
    Note on the Heights of Random Recursive Trees and Random m-ary Search Trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:2, pp:337-348 [Journal]
  38. Boris Pittel, Robert W. Irving
    An Upper Bound for the Solvability of a Random Stable Roommates Instance. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:3, pp:465-487 [Journal]
  39. Boris Pittel, R. Tungol
    A phase transition phenomenon in a random directed acyclic graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:2, pp:164-184 [Journal]
  40. Boris Pittel, Robert S. Weishaar
    The random bipartite nearest neighbor graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:279-310 [Journal]
  41. Vladimir Lifschitz, Boris Pittel
    The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:329-346 [Journal]
  42. Boris Pittel, Jenn-Hwa Yu
    On Search Times for Early-Insertion Coalesced Hashing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:492-503 [Journal]
  43. Boris Pittel
    The Average Number of Stable Matchings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:4, pp:530-549 [Journal]
  44. Philippe Flajolet, Donald E. Knuth, Boris Pittel
    The first cycles in an evolving graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:167-215 [Journal]
  45. Boris Pittel
    Limit shape of a random integer partition with a bounded max-to-min ratio of parts sizes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:7, pp:1238-1253 [Journal]

  46. The distribution of the root degree of a random permutation. [Citation Graph (, )][DBLP]


  47. How frequently is a system of 2-linear Boolean equations solvable? [Citation Graph (, )][DBLP]


  48. On the Likely Number of Solutions for the Stable Marriage Problem. [Citation Graph (, )][DBLP]


  49. Corrigendum. [Citation Graph (, )][DBLP]


  50. On the joint distribution of the insertion path length and the number of comparisons in search trees. [Citation Graph (, )][DBLP]


Search in 0.110secs, Finished in 0.114secs
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