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]
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]
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]
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]
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]
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]
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]
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]
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]
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]
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]
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]
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]
The distribution of the root degree of a random permutation. [Citation Graph (, )][DBLP]
How frequently is a system of 2-linear Boolean equations solvable? [Citation Graph (, )][DBLP]
On the Likely Number of Solutions for the Stable Marriage Problem. [Citation Graph (, )][DBLP]