default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPu Gao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Pu Gao:
Triangles and Subgraph Probabilities in Random Regular Graphs. Electron. J. Comb. 31(1) (2024)- 2023
- [j34]Amin Coja-Oghlan, Alperen Ali Ergür
, Pu Gao, Samuel Hetterich, Maurice Rolvien:
The rank of sparse random matrices. Random Struct. Algorithms 62(1): 68-130 (2023) - [j33]Pu Gao, Yuval Ohapkin:
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity. Random Struct. Algorithms 62(4): 911-934 (2023) - [j32]Pu Gao:
The number of perfect matchings, and the nesting properties, of random regular graphs. Random Struct. Algorithms 62(4): 935-955 (2023) - [j31]Lochlan Brick, Pu Gao, Angus Southwell:
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences. SIAM J. Discret. Math. 37(1): 94-113 (2023) - [i15]Alan M. Frieze, Pu Gao, Calum MacRury, Pawel Pralat, Gregory B. Sorkin:
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds. CoRR abs/2311.05533 (2023) - 2022
- [j30]Pu Gao, Bogumil Kaminski, Calum MacRury, Pawel Pralat:
Hamilton cycles in the semi-random graph process. Eur. J. Comb. 99: 103423 (2022) - [j29]Pu Gao, Calum MacRury, Pawel Pralat:
Perfect Matchings in the Semirandom Graph Process. SIAM J. Discret. Math. 36(2): 1274-1290 (2022) - [c9]Pu Gao, Calum MacRury, Pawel Pralat:
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. APPROX/RANDOM 2022: 29:1-29:22 - [i14]Pu Gao, Calum MacRury, Pawel Pralat:
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. CoRR abs/2205.02350 (2022) - 2021
- [j28]Yuanxun Zheng, Zhanlin Cao, Pan Guo, Pu Gao, Peng Zhang:
Fatigue Performance of Steel-Concrete Composite Continuous Box Girder Bridge Deck. Complex. 2021: 6610830:1-6610830:15 (2021) - [j27]Pu Gao, Reshma Ramadurai, Ian M. Wanless, Nick Wormald:
Full rainbow matchings in graphs and hypergraphs. Comb. Probab. Comput. 30(5): 762-780 (2021) - [j26]Pu Gao, Catherine S. Greenhill:
Mixing time of the switch Markov chain and stable degree sequences. Discret. Appl. Math. 291: 143-162 (2021) - [j25]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast uniform generation of random graphs with given degree sequences. Random Struct. Algorithms 59(3): 291-314 (2021) - [j24]Michael Anastos, Alan M. Frieze, Pu Gao:
Hamiltonicity of Random Graphs in the Stochastic Block Model. SIAM J. Discret. Math. 35(3): 1854-1880 (2021) - [i13]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Linear-time uniform generation of random sparse contingency tables with specified marginals. CoRR abs/2104.09413 (2021) - [i12]Pu Gao, Calum MacRury, Pawel Pralat:
Perfect Matchings in the Semi-random Graph Process. CoRR abs/2105.13455 (2021) - [i11]Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien:
The full rank condition for sparse random matrices. CoRR abs/2112.14090 (2021) - 2020
- [j23]Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller:
The Satisfiability Threshold For Random Linear Equations. Comb. 40(2): 179-235 (2020) - [j22]Pu Gao, Remco van der Hofstad, Angus Southwell, Clara Stegehuis:
Counting Triangles in Power-Law Uniform Random Graphs. Electron. J. Comb. 27(3): 3 (2020) - [c8]Amin Coja-Oghlan, Alperen Ali Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien:
The rank of sparse random matrices. SODA 2020: 579-591 - [c7]Pu Gao, Mikhail Isaev, Brendan D. McKay:
Sandwiching random regular graphs between binomial random graphs. SODA 2020: 690-701
2010 – 2019
- 2019
- [j21]Pu Gao, Catherine S. Greenhill:
Uniform Generation of Spanning Regular Subgraphs of a Dense Graph. Electron. J. Comb. 26(4): 4 (2019) - [c6]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast Uniform Generation of Random Graphs with Given Degree Sequences. FOCS 2019: 1371-1379 - [i10]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast uniform generation of random graphs with given degree sequences. CoRR abs/1905.03446 (2019) - 2018
- [j20]Pu Gao, Michael Molloy:
Inside the clustering window for random linear equations. Random Struct. Algorithms 52(2): 197-218 (2018) - [j19]Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato:
Arboricity and spanning-tree packing in random graphs. Random Struct. Algorithms 52(3): 495-535 (2018) - [j18]Pu Gao, Michael Molloy:
The stripping process can be slow: Part I. Random Struct. Algorithms 53(1): 76-139 (2018) - [j17]Pu Gao:
The Stripping Process Can be Slow: Part II. SIAM J. Discret. Math. 32(2): 1159-1188 (2018) - [c5]Pu Gao, Nicholas C. Wormald:
Uniform generation of random graphs with power-law degree sequences. SODA 2018: 1741-1758 - [i9]Pu Gao, Catherine S. Greenhill:
Uniform generation of spanning regular subgraphs of a dense graph. CoRR abs/1807.00964 (2018) - [i8]Amin Coja-Oghlan, Pu Gao:
The rank of random matrices over finite fields. CoRR abs/1810.07390 (2018) - 2017
- [j16]Pu Gao, Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs. SIAM J. Comput. 46(4): 1395-1427 (2017) - [i7]Pu Gao, Nicholas C. Wormald:
Uniform generation of random graphs with power-law degree sequences. CoRR abs/1709.02674 (2017) - [i6]Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller:
The satisfiability threshold for random linear equations. CoRR abs/1710.07497 (2017) - 2016
- [j15]Pu Gao:
On the geometric Ramsey numbers of trees. Discret. Math. 339(1): 375-381 (2016) - [j14]Pu Gao, Cristiane M. Sato:
A transition of limiting distributions of large matchings in random graphs. J. Comb. Theory B 116: 57-86 (2016) - 2015
- [j13]Pu Gao, Nicholas C. Wormald:
Orientability Thresholds for Random Hypergraphs. Comb. Probab. Comput. 24(5): 774-824 (2015) - [j12]Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr:
On the Geometric Ramsey Number of Outerplanar Graphs. Discret. Comput. Geom. 53(1): 64-79 (2015) - [j11]Pu Gao:
Sandwiching a densest subgraph by consecutive cores. Random Struct. Algorithms 47(2): 341-360 (2015) - [c4]Pu Gao, Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs. FOCS 2015: 1218-1230 - [i5]Pu Gao, Nicholas C. Wormald:
Uniform generation of random regular graphs. CoRR abs/1511.01175 (2015) - [i4]Pu Gao, Michael Molloy:
Inside the clustering window for random linear equations. CoRR abs/1512.06657 (2015) - 2014
- [j10]Pu Gao:
The First k-Regular Subgraph is Large. Comb. Probab. Comput. 23(3): 412-433 (2014) - [j9]Pu Gao:
Uniform Generation of d-Factors in Dense Host Graphs. Graphs Comb. 30(3): 581-589 (2014) - [j8]Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung:
On longest paths and diameter in random apollonian network. Random Struct. Algorithms 45(4): 703-725 (2014) - [c3]Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato:
Arboricity and spanning-tree packing in random graphs with an application to load balancing. SODA 2014: 317-326 - 2013
- [j7]Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung:
On the Longest Paths and the Diameter in Random Apollonian Networks. Electron. Notes Discret. Math. 43: 355-365 (2013) - [j6]Pu Gao:
Distribution of the number of spanning regular subgraphs in random graphs. Random Struct. Algorithms 43(3): 338-353 (2013) - [j5]Pu Gao:
Distributions of Sparse Spanning Subgraphs in Random Graphs. SIAM J. Discret. Math. 27(1): 386-401 (2013) - [i3]Pu Gao, Michael Molloy:
Inside the clustering threshold for random linear equations. CoRR abs/1309.6651 (2013) - [i2]Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr:
On the Geometric Ramsey Number of Outerplanar Graphs. CoRR abs/1310.7004 (2013) - 2012
- [j4]Pu Gao, Yi Su, Nicholas C. Wormald:
Induced subgraphs in sparse random graphs with given degree sequences. Eur. J. Comb. 33(6): 1142-1166 (2012) - [c2]Pu Gao, Hong P. Liu, David P. Gluch:
On Modelling, Simulating and Verifying a Decentralized Mission Control Algorithm for a Fleet of Collaborative UAVs. ICCS 2012: 792-801 - 2010
- [j3]Pu Gao:
Connectivity of random regular graphs generated by the pegging algorithm. J. Graph Theory 65(3): 185-197 (2010) - [c1]Pu Gao, Nicholas C. Wormald:
Load balancing and orientability thresholds for random hypergraphs. STOC 2010: 97-104 - [i1]Pu Gao, Nicholas C. Wormald:
Orientability thresholds for random hypergraphs. CoRR abs/1009.5489 (2010)
2000 – 2009
- 2009
- [j2]Pu Gao, Nicholas C. Wormald:
Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging. Electron. J. Comb. 16(1) (2009) - [j1]Pu Gao, Nicholas C. Wormald:
Short cycle distribution in random regular graphs recursively generated by pegging. Random Struct. Algorithms 34(1): 54-86 (2009)
Coauthor Index
aka: Nick Wormald
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 2024-06-10 21:20 CEST 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:
