default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoris G. Pittel
Person information
- affiliation: Ohio State University, Department of Mathematics, OH, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j77]Miklós Bóna
, Boris G. Pittel:
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves. Random Struct. Algorithms 63(1): 102-129 (2023)- [j76]Boris G. Pittel:
Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree. SIAM J. Discret. Math. 37(1): 1-16 (2023) - 2022
- [j75]Hüseyin Acan, Alan M. Frieze, Boris G. Pittel:
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. J. Appl. Probab. 59(2): 299-324 (2022) - 2021
- [j74]Boris G. Pittel:
One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences. Discret. Appl. Math. 292: 1-18 (2021) - [j73]Xin Chen, Boris G. Pittel:
On sparsity of the solution to a random quadratic optimization problem. Math. Program. 186(1): 309-336 (2021) - [j72]Boris G. Pittel:
On Bollobás-Riordan random pairing model of preferential attachment graph. Random Struct. Algorithms 58(4): 691-725 (2021) - 2020
- [j71]Boris G. Pittel:
On random stable matchings: Cyclic ones with strict preferences and two-sided ones with partially ordered preferences. Adv. Appl. Math. 120: 102061 (2020) - [j70]Michal Karonski, Ed Overman, Boris G. Pittel:
On a perfect matching in a random digraph with average out-degree below two. J. Comb. Theory B 143: 226-258 (2020) - [j69]Hüseyin Acan, Boris G. Pittel:
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph. Random Struct. Algorithms 56(1): 37-62 (2020)
2010 – 2019
- 2019
- [j68]Boris G. Pittel:
On random stable partitions. Int. J. Game Theory 48(2): 433-480 (2019) - [j67]Boris G. Pittel:
On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women. Math. Oper. Res. 44(1): 122-146 (2019) - 2018
- [j66]Boris G. Pittel:
On random quadratic forms: supports of potential local maxima. J. Appl. Probab. 55(4): 1113-1130 (2018) - [j65]Boris G. Pittel:
On random exchange-stable matchings. Math. Soc. Sci. 93: 1-13 (2018) - [j64]Boris G. Pittel:
Counting strongly connected (k1, k2)-directed cores. Random Struct. Algorithms 53(1): 3-14 (2018) - 2017
- [j63]Boris G. Pittel, Daniel J. Poole:
Birth of a giant (k1, k2)-core in the random digraph. Adv. Appl. Math. 86: 132-174 (2017) - [j62]Hüseyin Acan, Boris G. Pittel:
Formation of a giant component in the intersection graph of a random chord diagram. J. Comb. Theory B 125: 33-79 (2017) - [c6]Miklós Bóna, Boris G. Pittel:
On the cycle structure of the product of random maximal cycles. ANALCO 2017: 1-15 - 2016
- [j61]Sergei Chmutov, Boris G. Pittel:
On a surface formed by randomly gluing together polygonal discs. Adv. Appl. Math. 73: 23-42 (2016) - [j60]Boris G. Pittel:
Another Proof of the Harer-Zagier Formula. Electron. J. Comb. 23(1): 1 (2016) - [j59]Boris G. Pittel, Gregory B. Sorkin:
The Satisfiability Threshold for k-XORSAT. Comb. Probab. Comput. 25(2): 236-268 (2016) - [j58]Joel Lebowitz, Boris G. Pittel, D. Ruelle, E. R. Speer:
Central limit theorems, Lee-Yang zeros, and graph-counting polynomials. J. Comb. Theory A 141: 147-183 (2016) - [j57]Matthew Kahle, Boris G. Pittel:
Inside the critical window for cohomology of random k-complexes. Random Struct. Algorithms 48(1): 102-124 (2016) - [j56]Boris G. Pittel, Daniel J. Poole:
Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs. Random Struct. Algorithms 49(1): 3-64 (2016) - 2013
- [j55]Boris G. Pittel:
On z-analogue of Stepanov-Lomonosov-Polesskii inequality. J. Comb. Theory B 103(6): 679-688 (2013) - [j54]Sergei Chmutov, Boris G. Pittel:
The genus of a random chord diagram is asymptotically normal. J. Comb. Theory A 120(1): 102-110 (2013) - [j53]Hüseyin Acan, Boris G. Pittel:
On the connected components of a random permutation graph with a given number of edges. J. Comb. Theory A 120(8): 1947-1975 (2013) - [j52]Boris G. Pittel:
Counting strongly-connected, moderately sparse directed graphs. Random Struct. Algorithms 43(1): 49-79 (2013) - 2010
- [j51]Boris G. Pittel, Ji-A. Yeum:
How Frequently is a System of 2-Linear Boolean Equations Solvable? Electron. J. Comb. 17(1) (2010) - [i2]Boris G. Pittel, Ji-A. Yeum:
How frequently is a system of 2-linear Boolean equations solvable? CoRR abs/1005.1951 (2010)
2000 – 2009
- 2009
- [j50]Béla Bollobás, Boris G. Pittel:
The distribution of the root degree of a random permutation. Comb. 29(2): 131-151 (2009) - [j49]Craig Lennon, Boris G. Pittel:
On the Likely Number of Solutions for the Stable Marriage Problem. Comb. Probab. Comput. 18(3): 371-421 (2009) - 2008
- [j48]Boris G. Pittel, Nicholas C. Wormald:
Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172]. J. Comb. Theory B 98(4): 835-837 (2008) - 2007
- [j47]Boris G. Pittel, Dan Romik:
Limit shapes for random square Young tableaux. Adv. Appl. Math. 38(2): 164-209 (2007) - [j46]Boris G. Pittel:
Limit shape of a random integer partition with a bounded max-to-min ratio of parts sizes. J. Comb. Theory A 114(7): 1238-1253 (2007) - [j45]József Balogh, Boris G. 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) - [j44]József Balogh, Boris G. Pittel:
Bootstrap percolation on the random regular graph. Random Struct. Algorithms 30(1-2): 257-286 (2007) - [j43]Boris G. Pittel, Larry Shepp, Eugene Veklerov:
On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem. SIAM J. Discret. Math. 21(4): 947-958 (2007) - 2005
- [j42]Boris G. Pittel, Nicholas C. Wormald:
Counting connected graphs inside-out. J. Comb. Theory B 93(2): 127-172 (2005) - 2004
- [j41]Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel:
Phase diagram for the constrained integer partitioning problem. Random Struct. Algorithms 24(3): 315-380 (2004) - [c5]Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel:
Constrained Integer Partitions. LATIN 2004: 59-68 - 2003
- [j40]Michal Karonski, Boris G. Pittel:
Existence of a perfect matching in a random (1+e-1)--out bipartite graph. J. Comb. Theory B 88(1): 1-16 (2003) - [j39]Boris G. Pittel, Nicholas C. Wormald:
Asymptotic enumeration of sparse graphs with a minimum degree constraint. J. Comb. Theory A 101(2): 249-263 (2003) - [c4]Alan M. Frieze, Boris G. Pittel:
Perfect matchings in random graphs with prescribed minimal degree. SODA 2003: 148-157 - [i1]Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel:
Phase Diagram for the Constrained Integer Partitioning Problem. CoRR cond-mat/0302536 (2003) - 2002
- [j38]Boris G. Pittel:
On the distribution of the number of Young tableaux for a uniformly random diagram. Adv. Appl. Math. 29(2): 184-214 (2002) - 2001
- [j37]Boris G. Pittel:
On the Largest Component of the Random Graph at a Nearcritical Stage. J. Comb. Theory B 82(2): 237-269 (2001) - [j36]Boris G. Pittel, R. Tungol:
A phase transition phenomenon in a random directed acyclic graph. Random Struct. Algorithms 18(2): 164-184 (2001) - [j35]Christian Borgs, Jennifer T. Chayes, Boris G. Pittel:
Phase transition and finite-size scaling for the integer partitioning problem. Random Struct. Algorithms 19(3-4): 247-288 (2001) - [j34]Daniel Panario, Boris G. 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) - [c3]Christian Borgs, Jennifer T. Chayes, Boris G. Pittel:
Sharp threshold and scaling window for the integer partitioning problem. STOC 2001: 330-336 - 2000
- [j33]Boris G. Pittel:
Where the Typical Set Partitions Meet and Join. Electron. J. Comb. 7 (2000) - [j32]Jeong Han Kim, Boris G. Pittel:
On Tail Distribution of Interpost Distance. J. Comb. Theory B 80(1): 49-56 (2000) - [j31]Jeong Han Kim, Boris G. Pittel:
Confirming the Kleitman-Winston Conjecture on the Largest Coefficient in a q-Catalan Number. J. Comb. Theory A 92(2): 197-206 (2000) - [j30]David J. Aldous, Boris G. Pittel:
On a random graph with immigrating vertices: Emergence of the giant component. Random Struct. Algorithms 17(2): 79-102 (2000)
1990 – 1999
- 1999
- [j29]Arnold Knopfmacher, Andrew M. Odlyzko, Boris G. Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald:
The Asymptotic Number of Set Partitions with Unequal Block Sizes. Electron. J. Comb. 6 (1999) - [j28]Nathan Lulov, Boris G. Pittel:
On the Random Young Diagrams and Their Cores. J. Comb. Theory A 86(2): 245-280 (1999) - [j27]Boris G. Pittel:
Confirming Two Conjectures About the Integer Partitions. J. Comb. Theory A 88(1): 123-135 (1999) - [j26]Sylvie Corteel, Boris G. Pittel, Carla D. Savage, Herbert S. Wilf:
On the multiplicity of parts in a random partition. Random Struct. Algorithms 14(2): 185-197 (1999) - [j25]Boris G. Pittel, Robert S. Weishaar:
The random bipartite nearest neighbor graphs. Random Struct. Algorithms 15(3-4): 279-310 (1999) - 1998
- [j24]Jonathan Aronson, Alan M. Frieze, Boris G. Pittel:
Maximum matchings in sparse random graphs: Karp-Sipser revisited. Random Struct. Algorithms 12(2): 111-177 (1998) - 1997
- [j23]Boris G. Pittel, Robert S. Weishaar:
On-Line Coloring of Sparse Random Graphs and Random Trees. J. Algorithms 23(1): 195-205 (1997) - [j22]Boris G. Pittel:
Random Set Partitions: Asymptotics of Subset Counts. J. Comb. Theory A 79(2): 326-359 (1997) - 1996
- [j21]Boris G. Pittel, Joel Spencer, Nicholas C. Wormald:
Sudden Emergence of a Giantk-Core in a Random Graph. J. Comb. Theory B 67(1): 111-151 (1996) - [j20]Harry Kesten, Boris G. 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
- [j19]Boris G. Pittel:
Note on the Heights of Random Recursive Trees and Random m-ary Search Trees. Random Struct. Algorithms 5(2): 337-348 (1994) - [j18]Boris G. 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
- [j17]Boris G. Pittel:
On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm. Comb. Probab. Comput. 2: 53-92 (1993) - [j16]Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris G. Pittel:
The Birth of the Giant Component. Random Struct. Algorithms 4(3): 233-359 (1993) - 1992
- [j15]Tomasz Luczak, Boris G. Pittel:
Componenets of Random Forests. Comb. Probab. Comput. 1: 35-52 (1992) - [c2]Boris G. Pittel:
On Likely Solutions of a Stable Matching Problem. SODA 1992: 10-15 - 1991
- [j14]Hosam M. Mahmoud, Boris G. Pittel:
Corrigendum. Discret. Appl. Math. 30(1): 91 (1991) - 1990
- [j13]Boris G. Pittel, H. Rubin:
How many random questions are necessary to identify n distinct objects? J. Comb. Theory A 55(2): 292-312 (1990) - [j12]Donald E. Knuth, Rajeev Motwani, Boris G. Pittel:
Stable Husbands. Random Struct. Algorithms 1(1): 1-14 (1990) - [j11]Boris G. Pittel:
On Tree Census and the Giant Component in Sparse Random Graphs. Random Struct. Algorithms 1(3): 311-342 (1990) - [c1]Donald E. Knuth, Rajeev Motwani, Boris G. Pittel:
Stable Husbands. SODA 1990: 397-404
1980 – 1989
- 1989
- [j10]Philippe Flajolet, Donald E. Knuth, Boris G. Pittel:
The first cycles in an evolving graph. Discret. Math. 75(1-3): 167-215 (1989) - [j9]Hosam M. Mahmoud, Boris G. Pittel:
Analysis of the Space of Search Trees under the Random Insertion Algorithm. J. Algorithms 10(1): 52-75 (1989) - [j8]Boris G. Pittel:
The Average Number of Stable Matchings. SIAM J. Discret. Math. 2(4): 530-549 (1989) - 1988
- [j7]Hosam M. Mahmoud, Boris G. Pittel:
On the joint distribution of the insertion path length and the number of comparisons in search trees. Discret. Appl. Math. 20(3): 243-251 (1988) - [j6]Boris G. Pittel, Jenn-Hwa Yu:
On Search Times for Early-Insertion Coalesced Hashing. SIAM J. Comput. 17(3): 492-503 (1988) - 1987
- [j5]Boris G. Pittel:
Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records. J. Algorithms 8(2): 236-249 (1987) - 1986
- [j4]Boris G. Pittel:
On growing a random young tableau. J. Comb. Theory A 41(2): 278-285 (1986) - 1983
- [j3]Vladimir Lifschitz, Boris G. Pittel:
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms. SIAM J. Comput. 12(2): 329-346 (1983) - 1981
- [j2]Vladimir Lifschitz, Boris G. Pittel:
The Number of Increasing Subsequences of the Random Permutation. J. Comb. Theory A 31(1): 1-20 (1981)
1970 – 1979
- 1979
- [j1]Boris G. Pittel:
Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis. Math. Oper. Res. 4(4): 357-378 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
