Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis. - Boris G. Pittel (Math. Oper. Res., 1979)

The Number of Increasing Subsequences of the Random Permutation. - Vladimir Lifschitz; Boris G. Pittel (J. Comb. Theory A, 1981)

The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms. - Vladimir Lifschitz; Boris G. Pittel (SIAM J. Comput., 1983)

On growing a random young tableau. - Boris G. Pittel (J. Comb. Theory A, 1986)

Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records. - Boris G. Pittel (J. Algorithms, 1987)

On the joint distribution of the insertion path length and the number of comparisons in search trees. - Hosam M. Mahmoud; Boris G. Pittel (Discret. Appl. Math., 1988)

On Search Times for Early-Insertion Coalesced Hashing. - Boris G. Pittel; Jenn-Hwa Yu (SIAM J. Comput., 1988)

The first cycles in an evolving graph. - Philippe Flajolet; Donald E. Knuth; Boris G. Pittel (Discret. Math., 1989)

Analysis of the Space of Search Trees under the Random Insertion Algorithm. - Hosam M. Mahmoud; Boris G. Pittel (J. Algorithms, 1989)

The Average Number of Stable Matchings. - Boris G. Pittel (SIAM J. Discret. Math., 1989)

How many random questions are necessary to identify n distinct objects? - Boris G. Pittel; H. Rubin (J. Comb. Theory A, 1990)

Stable Husbands. - Donald E. Knuth; Rajeev Motwani 001; Boris G. Pittel (Random Struct. Algorithms, 1990)

On Tree Census and the Giant Component in Sparse Random Graphs. - Boris G. Pittel (Random Struct. Algorithms, 1990)

Corrigendum. - Hosam M. Mahmoud; Boris G. Pittel (Discret. Appl. Math., 1991)

On Likely Solutions of a Stable Matching Problem. - Boris G. Pittel (SODA, 1992)

Componenets of Random Forests. - Tomasz Luczak 001; Boris G. Pittel (Comb. Probab. Comput., 1992)

On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm. - Boris G. Pittel (Comb. Probab. Comput., 1993)

The Birth of the Giant Component. - Svante Janson; Donald E. Knuth; Tomasz Luczak 001; Boris G. Pittel (Random Struct. Algorithms, 1993)

Note on the Heights of Random Recursive Trees and Random m-ary Search Trees. - Boris G. Pittel (Random Struct. Algorithms, 1994)

An Upper Bound for the Solvability of a Random Stable Roommates Instance. - Boris G. Pittel; Robert W. Irving (Random Struct. Algorithms, 1994)

Sudden Emergence of a Giantk-Core in a Random Graph. - Boris G. Pittel; Joel Spencer; Nicholas C. Wormald (J. Comb. Theory B, 1996)

A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree. - Harry Kesten; Boris G. Pittel (Random Struct. Algorithms, 1996)

On-Line Coloring of Sparse Random Graphs and Random Trees. - Boris G. Pittel; Robert S. Weishaar (J. Algorithms, 1997)

Random Set Partitions: Asymptotics of Subset Counts. - Boris G. Pittel (J. Comb. Theory A, 1997)

Maximum matchings in sparse random graphs: Karp-Sipser revisited. - Jonathan Aronson; Alan M. Frieze; Boris G. Pittel (Random Struct. Algorithms, 1998)

The Asymptotic Number of Set Partitions with Unequal Block Sizes. - Arnold Knopfmacher; Andrew M. Odlyzko; Boris G. Pittel; L. Bruce Richmond; Dudley Stark; George Szekeres; Nicholas C. Wormald (Electron. J. Comb., 1999)

On the Random Young Diagrams and Their Cores. - Nathan Lulov; Boris G. Pittel (J. Comb. Theory A, 1999)

Confirming Two Conjectures About the Integer Partitions. - Boris G. Pittel (J. Comb. Theory A, 1999)

On the multiplicity of parts in a random partition. - Sylvie Corteel; Boris G. Pittel; Carla D. Savage; Herbert S. Wilf (Random Struct. Algorithms, 1999)

The random bipartite nearest neighbor graphs. - Boris G. Pittel; Robert S. Weishaar (Random Struct. Algorithms, 1999)

Where the Typical Set Partitions Meet and Join. - Boris G. Pittel (Electron. J. Comb., 2000)

Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number. - Jeong Han Kim; Boris G. Pittel (J. Comb. Theory A, 2000)

On Tail Distribution of Interpost Distance. - Jeong Han Kim; Boris G. Pittel (J. Comb. Theory B, 2000)

On a random graph with immigrating vertices: Emergence of the giant component. - David J. Aldous; Boris G. Pittel (Random Struct. Algorithms, 2000)

Sharp threshold and scaling window for the integer partitioning problem. - Christian Borgs; Jennifer T. Chayes; Boris G. Pittel (STOC, 2001)

On the Largest Component of the Random Graph at a Nearcritical Stage. - Boris G. Pittel (J. Comb. Theory B, 2001)

Phase transition and finite-size scaling for the integer partitioning problem. - Christian Borgs; Jennifer T. Chayes; Boris G. Pittel (Random Struct. Algorithms, 2001)

Analysis of Rabin's irreducibility test for polynomials over finite fields. - Daniel Panario; Boris G. Pittel; L. Bruce Richmond; Alfredo Viola (Random Struct. Algorithms, 2001)

A phase transition phenomenon in a random directed acyclic graph. - Boris G. Pittel; R. Tungol (Random Struct. Algorithms, 2001)

On the distribution of the number of Young tableaux for a uniformly random diagram. - Boris G. Pittel (Adv. Appl. Math., 2002)

Perfect matchings in random graphs with prescribed minimal degree. - Alan M. Frieze; Boris G. Pittel (SODA, 2003)

Existence of a perfect matching in a random (1+e-1)–out bipartite graph. - Michal Karonski; Boris G. Pittel (J. Comb. Theory B, 2003)

Asymptotic enumeration of sparse graphs with a minimum degree constraint. - Boris G. Pittel; Nicholas C. Wormald (J. Comb. Theory A, 2003)

Constrained Integer Partitions. - Christian Borgs; Jennifer T. Chayes; Stephan Mertens; Boris G. Pittel (LATIN, 2004)

Phase diagram for the constrained integer partitioning problem. - Christian Borgs; Jennifer T. Chayes; Stephan Mertens; Boris G. Pittel (Random Struct. Algorithms, 2004)

Counting connected graphs inside-out. - Boris G. Pittel; Nicholas C. Wormald (J. Comb. Theory B, 2005)

Limit shapes for random square Young tableaux. - Boris G. Pittel; Dan Romik (Adv. Appl. Math., 2007)

Limit shape of a random integer partition with a bounded max-to-min ratio of parts sizes. - Boris G. Pittel (J. Comb. Theory A, 2007)

Bootstrap percolation on the random regular graph. - József Balogh; Boris G. Pittel (Random Struct. Algorithms, 2007)

Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position. - József Balogh; Boris G. Pittel; Gelasio Salazar (Random Struct. Algorithms, 2007)

On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem. - Boris G. Pittel; Larry Shepp; Eugene Veklerov (SIAM J. Discret. Math., 2007)

Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172]. - Boris G. Pittel; Nicholas C. Wormald (J. Comb. Theory B, 2008)

The distribution of the root degree of a random permutation. - Béla Bollobás; Boris G. Pittel (Comb., 2009)

On the Likely Number of Solutions for the Stable Marriage Problem. - Craig Lennon; Boris G. Pittel (Comb. Probab. Comput., 2009)

How Frequently is a System of 2-Linear Boolean Equations Solvable? - Boris G. Pittel; Ji-A. Yeum (Electron. J. Comb., 2010)

On the connected components of a random permutation graph with a given number of edges. - Hüseyin Acan; Boris G. Pittel (J. Comb. Theory A, 2013)

The genus of a random chord diagram is asymptotically normal. - Sergei Chmutov; Boris G. Pittel (J. Comb. Theory A, 2013)

On z-analogue of Stepanov-Lomonosov-Polesskii inequality. - Boris G. Pittel (J. Comb. Theory B, 2013)

Counting strongly-connected, moderately sparse directed graphs. - Boris G. Pittel (Random Struct. Algorithms, 2013)

On a surface formed by randomly gluing together polygonal discs. - Sergei Chmutov; Boris G. Pittel (Adv. Appl. Math., 2016)

Another Proof of the Harer-Zagier Formula. - Boris G. Pittel (Electron. J. Comb., 2016)

The Satisfiability Threshold for k-XORSAT. - Boris G. Pittel; Gregory B. Sorkin (Comb. Probab. Comput., 2016)

Central limit theorems, Lee-Yang zeros, and graph-counting polynomials. - Joel Lebowitz; Boris G. Pittel; D. Ruelle; E. R. Speer (J. Comb. Theory A, 2016)

Inside the critical window for cohomology of random k-complexes. - Matthew Kahle; Boris G. Pittel (Random Struct. Algorithms, 2016)

Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs. - Boris G. Pittel; Daniel J. Poole (Random Struct. Algorithms, 2016)

On the cycle structure of the product of random maximal cycles. - Miklós Bóna; Boris G. Pittel (ANALCO, 2017)

Birth of a giant (k1, k2)-core in the random digraph. - Boris G. Pittel; Daniel J. Poole (Adv. Appl. Math., 2017)

Formation of a giant component in the intersection graph of a random chord diagram. - Hüseyin Acan; Boris G. Pittel (J. Comb. Theory B, 2017)

On random quadratic forms: supports of potential local maxima. - Boris G. Pittel (J. Appl. Probab., 2018)

On random exchange-stable matchings. - Boris G. Pittel (Math. Soc. Sci., 2018)

Counting strongly connected (k1, k2)-directed cores. - Boris G. Pittel (Random Struct. Algorithms, 2018)

On random stable partitions. - Boris G. Pittel (Int. J. Game Theory, 2019)

On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women. - Boris G. Pittel (Math. Oper. Res., 2019)

On random stable matchings: Cyclic ones with strict preferences and two-sided ones with partially ordered preferences. - Boris G. Pittel (Adv. Appl. Math., 2020)

On a perfect matching in a random digraph with average out-degree below two. - Michal Karonski; Ed Overman 001; Boris G. Pittel (J. Comb. Theory B, 2020)

On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph. - Hüseyin Acan; Boris G. Pittel (Random Struct. Algorithms, 2020)

One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences. - Boris G. Pittel (Discret. Appl. Math., 2021)

On sparsity of the solution to a random quadratic optimization problem. - Xin Chen 026; Boris G. Pittel (Math. Program., 2021)

On Bollobás-Riordan random pairing model of preferential attachment graph. - Boris G. Pittel (Random Struct. Algorithms, 2021)

Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. - Hüseyin Acan; Alan M. Frieze; Boris G. Pittel (J. Appl. Probab., 2022)

Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree. - Boris G. Pittel (SIAM J. Discret. Math., 2023)

Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves. - Miklós Bóna; Boris G. Pittel (Random Struct. Algorithms, 2023)