default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXing Shi Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Gabriel Berzunza Ojeda, Xing Shi Cai, Cecilia Holmgren:
The $k$-Cut Model in Deterministic and Random Trees. Electron. J. Comb. 28(1): 1 (2021)- [i9]Xing Shi Cai, Pietro Caputo, Guillem Perarnau, Matteo Quattropani:
Rankings in directed configuration models with heavy tailed in-degrees. CoRR abs/2104.08389 (2021) - 2020
- [c4]Gabriel Berzunza Ojeda
, Xing Shi Cai, Cecilia Holmgren:
The k-Cut Model in Conditioned Galton-Watson Trees. AofA 2020: 5:1-5:10 - [i8]Xing Shi Cai, Guillem Perarnau:
The diameter of the directed configuration model. CoRR abs/2003.04965 (2020) - [i7]Xing Shi Cai, Guillem Perarnau:
The giant component of the directed configuration model revisited. CoRR abs/2004.04998 (2020) - [i6]Xing Shi Cai, Guillem Perarnau:
Minimum stationary values of sparse random directed graphs. CoRR abs/2010.07246 (2020)
2010 – 2019
- 2019
- [j6]Xing Shi Cai, Cecilia Holmgren:
Cutting Resilient Networks - Complete Binary Trees. Electron. J. Comb. 26(4): 4 (2019) - [j5]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
Inversions in Split Trees and Conditional Galton-Watson Trees. Comb. Probab. Comput. 28(3): 335-364 (2019) - [c3]Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman:
k -cuts on a Path. CIAC 2019: 112-123 - 2018
- [j4]Xing Shi Cai, Svante Janson:
Non-Fringe Subtrees in Conditioned Galton - Watson Trees. Electron. J. Comb. 25(3): 3 (2018) - [c2]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
Inversions in Split Trees and Conditional Galton-Watson Trees. AofA 2018: 15:1-15:12 - [i5]Xing Shi Cai, Cecilia Holmgren:
Cutting resilient networks - complete binary trees. CoRR abs/1811.05673 (2018) - 2017
- [j3]Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms 50(4): 511-533 (2017) - [j2]Xing Shi Cai, Luc Devroye:
The graph structure of a deterministic automaton chosen at random. Random Struct. Algorithms 51(3): 428-458 (2017) - 2015
- [j1]Xing Shi Cai, Luc Devroye:
The Analysis of Kademlia for Random IDs. Internet Math. 11(6): 572-587 (2015) - [i4]Xing Shi Cai, Luc Devroye:
The graph structure of a deterministic automaton chosen at random: full version. CoRR abs/1504.06238 (2015) - 2014
- [i3]Xing Shi Cai, Luc Devroye:
The Analysis of Kademlia for random IDs. CoRR abs/1402.1191 (2014) - [i2]Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. CoRR abs/1411.3047 (2014) - 2013
- [c1]Xing Shi Cai, Luc Devroye:
A Probabilistic Analysis of Kademlia Networks. ISAAC 2013: 711-721 - [i1]Xing Shi Cai, Luc Devroye:
A Probabilistic Analysis of Kademlia Networks. CoRR abs/1309.5866 (2013)
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 2024-04-24 22:49 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:
