Boris G. Pittel

85 papers A* 4B 1Journal 79Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree.
SIAM J. Discret. Math.
Boris G. Pittel
2023 J jnl
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves.
Random Struct. Algorithms
Miklós Bóna, Boris G. Pittel
2022 J jnl
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs.
J. Appl. Probab.
Hüseyin Acan, Alan M. Frieze, Boris G. Pittel
2021 J jnl
On Bollobás-Riordan random pairing model of preferential attachment graph.
Random Struct. Algorithms
Boris G. Pittel
2021 J jnl
On sparsity of the solution to a random quadratic optimization problem.
Math. Program.
Xin Chen, Boris G. Pittel
2021 J jnl
One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences.
Discret. Appl. Math.
Boris G. Pittel
2020 J jnl
On a perfect matching in a random digraph with average out-degree below two.
J. Comb. Theory B
Michal Karonski, Ed Overman, Boris G. Pittel
2020 J jnl
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph.
Random Struct. Algorithms
Hüseyin Acan, Boris G. Pittel
2020 J jnl
On random stable matchings: Cyclic ones with strict preferences and two-sided ones with partially ordered preferences.
Adv. Appl. Math.
Boris G. Pittel
2019 J jnl
On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women.
Math. Oper. Res.
Boris G. Pittel
2019 J jnl
On random stable partitions.
Int. J. Game Theory
Boris G. Pittel
2018 J jnl
Counting strongly connected (k1, k2)-directed cores.
Random Struct. Algorithms
Boris G. Pittel
2018 J jnl
On random exchange-stable matchings.
Math. Soc. Sci.
Boris G. Pittel
2018 J jnl
On random quadratic forms: supports of potential local maxima.
J. Appl. Probab.
Boris G. Pittel
2017 J jnl
Birth of a giant (
Adv. Appl. Math.
Boris G. Pittel, Daniel J. Poole
2017 J jnl
Formation of a giant component in the intersection graph of a random chord diagram.
J. Comb. Theory B
Hüseyin Acan, Boris G. Pittel
2017 — conf
On the cycle structure of the product of random maximal cycles.
ANALCO
Miklós Bóna, Boris G. Pittel
2016 J jnl
Another Proof of the Harer-Zagier Formula.
Electron. J. Comb.
Boris G. Pittel
2016 J jnl
Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs.
Random Struct. Algorithms
Boris G. Pittel, Daniel J. Poole
2016 J jnl
Central limit theorems, Lee-Yang zeros, and graph-counting polynomials.
J. Comb. Theory A
Joel Lebowitz, Boris G. Pittel, D. Ruelle, E. R. Speer
2016 J jnl
Inside the critical window for cohomology of random
Random Struct. Algorithms
Matthew Kahle, Boris G. Pittel
2016 J jnl
On a surface formed by randomly gluing together polygonal discs.
Adv. Appl. Math.
Sergei Chmutov, Boris G. Pittel
2016 J jnl
The Satisfiability Threshold for
Comb. Probab. Comput.
Boris G. Pittel, Gregory B. Sorkin
2013 J jnl
Counting strongly-connected, moderately sparse directed graphs.
Random Struct. Algorithms
Boris G. Pittel
2013 J jnl
On the connected components of a random permutation graph with a given number of edges.
J. Comb. Theory A
Hüseyin Acan, Boris G. Pittel
2013 J jnl
On z-analogue of Stepanov-Lomonosov-Polesskii inequality.
J. Comb. Theory B
Boris G. Pittel
2013 J jnl
The genus of a random chord diagram is asymptotically normal.
J. Comb. Theory A
Sergei Chmutov, Boris G. Pittel
2010 J jnl
How Frequently is a System of 2-Linear Boolean Equations Solvable?
Electron. J. Comb.
Boris G. Pittel, Ji-A. Yeum
2010 J jnl
How frequently is a system of 2-linear Boolean equations solvable?
CoRR
Boris G. Pittel, Ji-A. Yeum
2009 J jnl
On the Likely Number of Solutions for the Stable Marriage Problem.
Comb. Probab. Comput.
Craig Lennon, Boris G. Pittel
2009 J jnl
The distribution of the root degree of a random permutation.
Comb.
Béla Bollobás, Boris G. Pittel
2008 J jnl
Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172].
J. Comb. Theory B
Boris G. Pittel, Nicholas C. Wormald
2007 J jnl
Bootstrap percolation on the random regular graph.
Random Struct. Algorithms
József Balogh, Boris G. Pittel
2007 J jnl
Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position.
Random Struct. Algorithms
József Balogh, Boris G. Pittel, Gelasio Salazar
2007 J jnl
Limit shape of a random integer partition with a bounded max-to-min ratio of parts sizes.
J. Comb. Theory A
Boris G. Pittel
2007 J jnl
Limit shapes for random square Young tableaux.
Adv. Appl. Math.
Boris G. Pittel, Dan Romik
2007 J jnl
On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem.
SIAM J. Discret. Math.
Boris G. Pittel, Larry Shepp, Eugene Veklerov
2005 J jnl
Counting connected graphs inside-out.
J. Comb. Theory B
Boris G. Pittel, Nicholas C. Wormald
2004 B conf
Constrained Integer Partitions.
LATIN
Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel
2004 J jnl
Phase diagram for the constrained integer partitioning problem.
Random Struct. Algorithms
Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel
2003 J jnl
Asymptotic enumeration of sparse graphs with a minimum degree constraint.
J. Comb. Theory A
Boris G. Pittel, Nicholas C. Wormald
2003 J jnl
Existence of a perfect matching in a random (1+e
J. Comb. Theory B
Michal Karonski, Boris G. Pittel
2003 A* conf
Perfect matchings in random graphs with prescribed minimal degree.
SODA
Alan M. Frieze, Boris G. Pittel
2003 J jnl
Phase Diagram for the Constrained Integer Partitioning Problem
CoRR
Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel
2002 J jnl
On the distribution of the number of Young tableaux for a uniformly random diagram.
Adv. Appl. Math.
Boris G. Pittel
2001 J jnl
A phase transition phenomenon in a random directed acyclic graph.
Random Struct. Algorithms
Boris G. Pittel, R. Tungol
2001 J jnl
Analysis of Rabin's irreducibility test for polynomials over finite fields.
Random Struct. Algorithms
Daniel Panario, Boris G. Pittel, L. Bruce Richmond, Alfredo Viola
2001 J jnl
On the Largest Component of the Random Graph at a Nearcritical Stage.
J. Comb. Theory B
Boris G. Pittel
2001 J jnl
Phase transition and finite-size scaling for the integer partitioning problem.
Random Struct. Algorithms
Christian Borgs, Jennifer T. Chayes, Boris G. Pittel
2001 A* conf
Sharp threshold and scaling window for the integer partitioning problem.
STOC
Christian Borgs, Jennifer T. Chayes, Boris G. Pittel
2000 J jnl
Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number.
J. Comb. Theory A
Jeong Han Kim, Boris G. Pittel
2000 J jnl
On Tail Distribution of Interpost Distance.
J. Comb. Theory B
Jeong Han Kim, Boris G. Pittel
2000 J jnl
On a random graph with immigrating vertices: Emergence of the giant component.
Random Struct. Algorithms
David J. Aldous, Boris G. Pittel
2000 J jnl
Where the Typical Set Partitions Meet and Join.
Electron. J. Comb.
Boris G. Pittel
1999 J jnl
Confirming Two Conjectures About the Integer Partitions.
J. Comb. Theory A
Boris G. Pittel
1999 J jnl
On the Random Young Diagrams and Their Cores.
J. Comb. Theory A
Nathan Lulov, Boris G. Pittel
1999 J jnl
On the multiplicity of parts in a random partition.
Random Struct. Algorithms
Sylvie Corteel, Boris G. Pittel, Carla D. Savage, Herbert S. Wilf
1999 J jnl
The Asymptotic Number of Set Partitions with Unequal Block Sizes.
Electron. J. Comb.
Arnold Knopfmacher, Andrew M. Odlyzko, Boris G. Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald
1999 J jnl
The random bipartite nearest neighbor graphs.
Random Struct. Algorithms
Boris G. Pittel, Robert S. Weishaar
1998 J jnl
Maximum matchings in sparse random graphs: Karp-Sipser revisited.
Random Struct. Algorithms
Jonathan Aronson, Alan M. Frieze, Boris G. Pittel
1997 J jnl
On-Line Coloring of Sparse Random Graphs and Random Trees.
J. Algorithms
Boris G. Pittel, Robert S. Weishaar
1997 J jnl
Random Set Partitions: Asymptotics of Subset Counts.
J. Comb. Theory A
Boris G. Pittel
1996 J jnl
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
Harry Kesten, Boris G. Pittel
1996 J jnl
Sudden Emergence of a Giant
J. Comb. Theory B
Boris G. Pittel, Joel Spencer, Nicholas C. Wormald
1994 J jnl
An Upper Bound for the Solvability of a Random Stable Roommates Instance.
Random Struct. Algorithms
Boris G. Pittel, Robert W. Irving
1994 J jnl
Note on the Heights of Random Recursive Trees and Random m-ary Search Trees.
Random Struct. Algorithms
Boris G. Pittel
1993 J jnl
On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm.
Comb. Probab. Comput.
Boris G. Pittel
1993 J jnl
The Birth of the Giant Component.
Random Struct. Algorithms
Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris G. Pittel
1992 J jnl
Componenets of Random Forests.
Comb. Probab. Comput.
Tomasz Luczak, Boris G. Pittel
1992 A* conf
On Likely Solutions of a Stable Matching Problem.
SODA
Boris G. Pittel
1991 J jnl
Corrigendum.
Discret. Appl. Math.
Hosam M. Mahmoud, Boris G. Pittel
1990 J jnl
How many random questions are necessary to identify
J. Comb. Theory A
Boris G. Pittel, H. Rubin
1990 J jnl
On Tree Census and the Giant Component in Sparse Random Graphs.
Random Struct. Algorithms
Boris G. Pittel
1990 A* conf
Stable Husbands.
SODA
Donald E. Knuth, Rajeev Motwani, Boris G. Pittel
1990 J jnl
Stable Husbands.
Random Struct. Algorithms
Donald E. Knuth, Rajeev Motwani, Boris G. Pittel
1989 J jnl
Analysis of the Space of Search Trees under the Random Insertion Algorithm.
J. Algorithms
Hosam M. Mahmoud, Boris G. Pittel
1989 J jnl
The Average Number of Stable Matchings.
SIAM J. Discret. Math.
Boris G. Pittel
1989 J jnl
The first cycles in an evolving graph.
Discret. Math.
Philippe Flajolet, Donald E. Knuth, Boris G. Pittel
1988 J jnl
On Search Times for Early-Insertion Coalesced Hashing.
SIAM J. Comput.
Boris G. Pittel, Jenn-Hwa Yu
1988 J jnl
On the joint distribution of the insertion path length and the number of comparisons in search trees.
Discret. Appl. Math.
Hosam M. Mahmoud, Boris G. Pittel
1987 J jnl
Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records.
J. Algorithms
Boris G. Pittel
1986 J jnl
On growing a random young tableau.
J. Comb. Theory A
Boris G. Pittel
1983 J jnl
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms.
SIAM J. Comput.
Vladimir Lifschitz, Boris G. Pittel
1981 J jnl
The Number of Increasing Subsequences of the Random Permutation.
J. Comb. Theory A
Vladimir Lifschitz, Boris G. Pittel
1979 J jnl
Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis.
Math. Oper. Res.
Boris G. Pittel