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