B. Pittel

发表

On spreading a rumor

B. Pittel, 1987 .

The average performance of the greedy matching algorithm

B. Pittel, A. Frieze, M. Dyer, 1993 .

Asymptotical Growth of a Class of Random Trees

B. Pittel, 1985 .

A recurrence related to trees

D. Knuth, B. Pittel, 1989 .

Paths in a random digital tree: limiting distributions

B. Pittel, 1986, Advances in Applied Probability.

On the probable behaviour of some algorithms for finding the stability number of a graph

B. Pittel, 1982, Mathematical Proceedings of the Cambridge Philosophical Society.

The Satisfiability Threshold for $k$-XORSAT, using an alternative proof

B. Pittel, G. Sorkin, 2012, 1212.3822.

Normal convergence problem? Two moments and a recurrence may be the clues

B. Pittel, 1999 .

ON A DALEY-KENDALL MODEL OF RANDOM RUMOURS

B. Pittel, 1990 .

Maximum matchings in sparse random graphs: Karp-Sipser revisited

B. Pittel, A. Frieze, Jonathan Aronson, 1998 .

On Likely Solutions of a Stable Marriage Problem

B. Pittel, 1992 .

On growing random binary trees

B. Pittel, 1984 .

The structure of a random graph at the point of the phase transition

B. Pittel, Tomasz Łuczak, J. Wierman, 1994 .

Edge percolation on a random regular graph of low degree

Boris Pittel, B. Pittel, 2008, 0808.3516.

Limiting Behavior of a Process of Runs

B. Pittel, 1981 .

Digital Kenyon: Research, Scholarship, and Creative Exchange

B. Pittel, J. Verducci, B. D. Jones, 2019 .

An Upper Bound for the Solvability Probability of a Random Stable Roommates Instance

Boris G. Pittel, B. Pittel, 2006 .

Random permutations and stable matchings

B. Pittel, 1992, Advances in Applied Probability.

On Dimensions of a Random Solid Diagram

Boris Pittel, B. Pittel, 2005, Combinatorics, Probability and Computing.

On a sparse random graph with minimum degree three: Likely Pósa sets are large

B. Pittel, A. Frieze, 2011, 1107.4944.

On a perfect matching in a random bipartite digraph with average out-degree below two

Boris Pittel, B. Pittel, E. Overman, 2019, 1903.05764.

On Bollobás‐Riordan random pairing model of preferential attachment graph

B. Pittel, 2018, Random Struct. Algorithms.

Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle

B. Pittel, J. Balogh, G. Salazar, 2005 .

Size of the largest cluster under zero-range invariant measures

B. Pittel, P. March, Intae Jeon, 2000 .

Random Tree-Type Partitions as a Model for Acyclic Polymerization: Holtsmark (3/2-Stable) Distribution of the Supercritical Gel

B. Pittel, W. Woyczynski, J. Mann, 1990 .

Accuracy and limitations of the pseudopotential method

B. Pittel, P. Habitz, T. C. Chang, 1974 .

Correlation energies from pseudo-potential calculations

B. Pittel, W. Schwarz, 1977 .

Limit shapes for random square Young tableaux and plane partitions

B. Pittel, D. Romik, 2004, math/0405190.

On random stable matchings: cyclic matchings with strict preferences and two-side matchings with partially ordered preferences

B. Pittel, 2019, 1911.07425.

On the Likelihood of Comparability in Bruhat Order

B. Pittel, Adam Hammett, 2006, math/0605490.

Elementary Problems: E3409-E3414

Robert McNaughton, Donald E. Knuth, Gerald Myerson, 1990 .

On a Daley-Kendall model of random rumours

B. Pittel, 1990, Journal of Applied Probability.

The Average Number of Stable _ l / latchings

B. Pittel, 1998 .

Limit shapes for random square Young tableaux and plane partitions

B. Pittel, D. Romik, 2004, math/0405190.

Stable husbands

D. Knuth, B. Pittel, R. Motwani, 1990, SODA '90.

On the Likelihood of Comparability in Bruhat Order

B. Pittel, Adam Hammett, 2006, math/0605490.

Perfect partitions of a random set of integers

B. Pittel, 2022, 2210.00656.

Expected coalescence time for a nonuniform allocation process

B. Pittel, John K. McSweeney, 2008, Advances in Applied Probability.

Random increasing plane trees: asymptotic enumeration of vertices by distance from leaves

B. Pittel, Mikl'os B'ona, 2021, 2108.04989.

Giant descendant trees and matching sets in the preferential attachment graph

B. Pittel, A. Frieze, Hüseyin Acan, 2019, 1908.02407.

Semiempirical determination of ionisation potentials, term values and correlation energies of third-row transition-metal atoms by vertical analysis

B. Pittel, W. Schwarz, 1978 .

On random stable partitions

B. Pittel, 2018, International Journal of Game Theory.

The Birth of the Giant Component

S. Janson, D. Knuth, B. Pittel, 1993, Random Struct. Algorithms.

On sparsity of the solution to a random quadratic optimization problem

B. Pittel, Xin Chen, 2019, Mathematical Programming.

Central limit theorems, Lee-Yang zeros, and graph-counting polynomials

Boris G. Pittel, Joel Lebowitz, D. Ruelle, 2014, J. Comb. Theory, Ser. A.

Phase transition and finite‐size scaling for the integer partitioning problem

Christian Borgs, Jennifer T. Chayes, Boris G. Pittel, 2001, Random Struct. Algorithms.

Probabilistic Analysis of an Algorithm in the Theory of Markets in Indivisible Goods

Boris Pittel, Alan Frieze, B. Pittel, 1995 .

How often are two permutations comparable

Boris Pittel, Adam J. Hammett, B. Pittel, 2008 .

Bootstrap percolation on the random regular graph

József Balogh, Boris G. Pittel, B. Pittel, 2007, Random Struct. Algorithms.

On Tree Census and the Giant Component in Sparse Random Graphs

Boris G. Pittel, B. Pittel, 1990, Random Struct. Algorithms.

A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree

Boris G. Pittel, Harry Kesten, B. Pittel, 1996, Random Struct. Algorithms.

On sparsity of the solution to a random quadratic optimization problem

Xin Chen, Boris Pittel, B. Pittel, 2018, Math. Program..

On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women

Boris G. Pittel, B. Pittel, 2017, Math. Oper. Res..

On random quadratic forms: supports of potential local maxima

Boris G. Pittel, B. Pittel, 2017, Journal of Applied Probability.

Formation of a giant component in the intersection graph of a random chord diagram

Boris G. Pittel, Hüseyin Acan, B. Pittel, 2014, J. Comb. Theory, Ser. B.

On a surface formed by randomly gluing together polygonal discs

Boris Pittel, Sergei Chmutov, B. Pittel, 2015, Adv. Appl. Math..

On the connected components of a random permutation graph with a given number of edges

Boris G. Pittel, Hüseyin Acan, B. Pittel, 2012, J. Comb. Theory, Ser. A.

On the Likely Number of Solutions for the Stable Marriage Problem

Boris G. Pittel, Craig Lennon, B. Pittel, 2009, Combinatorics, Probability and Computing.

Overlapping core to valence and core to Rydberg transitions and resonances in the XUV spectra of SiF4

B. Pittel, W. Schwarz, P. Rabe, 1980 .

A graph-valued Markov process as rings-allowed polymerization model: subcritical behavior

B. Pittel, W. Woyczynski, W. A. Woyczynski, 1990 .

Random permutations and Brownian motion

Boris Pittel, B. Pittel, J. DeLaurentis, 1985 .

On Distributions Related to Transitive Closures of Random Finite Mappings

Boris Pittel, B. Pittel, 1983 .

Distance between two random k-out digraphs, with and without preferential attachment

Boris Pittel, B. Pittel, Nicholas R. Peterson, 2013, Advances in Applied Probability.

Limit shapes for random square Young tableaux

Dan Romik, Boris Pittel, B. Pittel, 2007, Adv. Appl. Math..

Maximum matchings in sparse random graphs: Karp-Sipser revisited

Alan M. Frieze, Boris G. Pittel, Jonathan Aronson, 1998, Random Struct. Algorithms.

Analysis of the Space of Search Trees under the Random Insertion Algorithm

Hosam M. Mahmoud, Boris G. Pittel, H. Mahmoud, 1989, J. Algorithms.

Sudden Emergence of a Giantk-Core in a Random Graph

Joel H. Spencer, Nicholas C. Wormald, Boris G. Pittel, 1996, J. Comb. Theory, Ser. B.

The first cycles in an evolving graph

Donald E. Knuth, Boris G. Pittel, Philippe Flajolet, 1989, Discret. Math..

Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records

Boris G. Pittel, B. Pittel, 1987, J. Algorithms.

On a Likely Shape of the Random Ferrers Diagram

Boris Pittel, B. Pittel, 1997 .

Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis

Boris G. Pittel, B. Pittel, 1979, Math. Oper. Res..

An urn model for cannibal behavior

B. Pittel, B. Pittel, 1987, Journal of Applied Probability.

How many random questions are necessary to identify n distinct objects?

Boris G. Pittel, H. Rubin, B. Pittel, 1990, J. Comb. Theory, Ser. A.

The Average Number of Stable Matchings

Boris G. Pittel, B. Pittel, 1989, SIAM J. Discret. Math..

Tight Markov chains and random compositions

B. Pittel, 2010, 1005.1957.

TIGHT MARKOV CHAINS AND RANDOM COMPOSITIONS 1

B. Pittel, P. Flajolet, 2012 .

C O ] 1 1 M ay 2 01 0 TIGHT MARKOV CHAINS AND RANDOM

B. Pittel, 2010 .

Inside the critical window for cohomology of random k‐complexes

Boris G. Pittel, Matthew Kahle, B. Pittel, 2013, Random Struct. Algorithms.

Counting strongly connected (k1, k2)‐directed cores

Boris G. Pittel, B. Pittel, 2016, Random Struct. Algorithms.

Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs

Boris G. Pittel, Daniel J. Poole, B. Pittel, 2014, Random Struct. Algorithms.

Perfect matchings in random graphs with prescribed minimal degree

Alan M. Frieze, Boris G. Pittel, B. Pittel, 2003, SODA '03.

Phase diagram for the constrained integer partitioning problem

Christian Borgs, Jennifer T. Chayes, Boris G. Pittel, 2003, Random Struct. Algorithms.

On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase

B. Pittel, B. G. Pittel, 2008, 0808.2907.

On the multiplicity of parts in a random partition

Boris G. Pittel, Sylvie Corteel, Herbert S. Wilf, 1999, Random Struct. Algorithms.

How Frequently is a System of 2-Linear Boolean Equations Solvable?

Boris G. Pittel, Ji-A. Yeum, B. Pittel, 2010, Electron. J. Comb..

The Satisfiability Threshold for k-XORSAT

Boris G. Pittel, Gregory B. Sorkin, B. Pittel, 2012, Combinatorics, Probability and Computing.

The genus of a random chord diagram is asymptotically normal

Boris G. Pittel, Sergei Chmutov, B. Pittel, 2011, J. Comb. Theory, Ser. A.

Counting connected graphs inside-out

Nicholas C. Wormald, Boris G. Pittel, B. Pittel, 2005, J. Comb. Theory, Ser. B.

Asymptotic enumeration of sparse graphs with a minimum degree constraint

Nicholas C. Wormald, Boris G. Pittel, B. Pittel, 2003, J. Comb. Theory A.

On random exchange-stable matchings

Boris G. Pittel, B. Pittel, 2017, Math. Soc. Sci..

An Upper Bound for the Solvability of a Random Stable Roommates Instance

Robert W. Irving, Boris G. Pittel, B. Pittel, 1994, Random Struct. Algorithms.

The stable roommates' problem with random preferences

Boris Pittel, B. Pittel, 1993 .

Note on the Heights of Random Recursive Trees and Random m-ary Search Trees

Boris G. Pittel, B. Pittel, 1994, Random Struct. Algorithms.

Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves

B. Pittel, M. Bóna, 2022, Random Struct. Algorithms.

Giant descendant trees, matchings, and independent sets in age-biased attachment graphs

B. Pittel, A. Frieze, Hüseyin Acan, 2019, Journal of Applied Probability.

On connectivity, conductance and bootstrap percolation for a random k‐out, age‐biased graph

Boris Pittel, Huseyin Acan, B. Pittel, 2018, Random Struct. Algorithms.

Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree

B. Pittel, 2021, SIAM J. Discret. Math..

EXPECTED NUMBER OF INDUCED SUBTREES SHARED BY TWO INDEPENDENT COPIES OF THE TERMINAL TREE IN A CRITICAL BRANCHING PROCESS

B. Pittel, 2021 .

On the Largest Component of the Random Graph at a Nearcritical Stage

Boris G. Pittel, B. Pittel, 2001, J. Comb. Theory, Ser. B.

The structure of a random graph at the point of the phase transition

B. Pittel, Tomasz Łuczak, J. Wierman, 1994 .

On a perfect matching in a random digraph with average out-degree below two

Boris Pittel, Michał Karoński, Ed Overman, 2020, J. Comb. Theory, Ser. B.

Random Set Partitions: Asymptotics of Subset Counts

Boris G. Pittel, B. Pittel, 1997, J. Comb. Theory, Ser. A.

Counting subsets of the random partition and the 'Brownian Bridge' process

J. M. DeLaurentis, B. Pittel, J. DeLaurentis, 1983 .

Components of Random Forests

Boris G. Pittel, Tomasz Luczak, B. Pittel, 1992, Combinatorics, Probability and Computing.

On the Random Young Diagrams and Their Cores

Nathan Lulov, Boris Pittel, B. Pittel, 1999, J. Comb. Theory, Ser. A.

On the distribution of the number of Young tableaux for a uniformly random diagram

Boris Pittel, B. Pittel, 2002, Adv. Appl. Math..

Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions

Boris Pittel, B. Pittel, 2016, 1603.00923.

Tree and forest weights and their application to nonuniform random graphs

B. Pittel, J. Verducci, B. D. Jones, 1999 .

On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem

Boris G. Pittel, Larry A. Shepp, Eugene Veklerov, 2007, SIAM J. Discret. Math..

Sudden Emergence of a Giantk-Core in a Random Graph

J. Spencer, B. Pittel, N. Wormald, 1996, J. Comb. Theory B.

Birth of a giant (k1, k2)-core in the random digraph

Boris Pittel, Dan Poole, B. Pittel, 2016, Adv. Appl. Math..

On a random graph with immigrating vertices: Emergence of the giant component

Boris G. Pittel, David Aldous, B. Pittel, 2000, Random Struct. Algorithms.