![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Shirshendu Ganguly
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Shirshendu Ganguly, Ella Hiesmayr, Kyeongsik Nam:
Upper Tail Behavior of the Number of Triangles in Random Graphs with Constant Average Degree. Comb. 44(4): 699-740 (2024) - 2022
- [i8]Shirshendu Ganguly, Ella Hiesmayr, Kyeongsik Nam:
Upper tail behavior of the number of triangles in random graphs with constant average degree. CoRR abs/2202.06916 (2022) - 2021
- [i7]Shirshendu Ganguly, Kyeongsik Nam:
Large deviations for the largest eigenvalue of Gaussian networks with constant average degree. CoRR abs/2102.08364 (2021) - [i6]Shirshendu Ganguly, Theo McKenzie, Sidhanth Mohanty, Nikhil Srivastava:
Many nodal domains in random regular graphs. CoRR abs/2109.11532 (2021) - 2020
- [j6]Shirshendu Ganguly, Insuk Seo:
Information percolation and cutoff for the random-cluster model. Random Struct. Algorithms 57(3): 770-822 (2020) - [j5]Bhaswar B. Bhattacharya, Shirshendu Ganguly:
Upper Tails for Edge Eigenvalues of Random Graphs. SIAM J. Discret. Math. 34(2): 1069-1083 (2020) - [i5]Bhaswar B. Bhattacharya, Sohom Bhattacharya, Shirshendu Ganguly:
Spectral Edge in Sparse Random Graphs: Upper and Lower Tail Large Deviations. CoRR abs/2004.00611 (2020)
2010 – 2019
- 2019
- [j4]Shirshendu Ganguly, Fabio Martinelli
:
Upper triangular matrix walk: Cutoff for finitely many columns. Random Struct. Algorithms 55(2): 313-341 (2019) - [i4]Noga Alon, Shirshendu Ganguly, Nikhil Srivastava:
High-girth near-Ramanujan graphs with localized eigenvectors. CoRR abs/1908.03694 (2019) - 2018
- [i3]Shirshendu Ganguly, Nikhil Srivastava:
On Non-localization of Eigenvectors of High Girth Graphs. CoRR abs/1803.08038 (2018) - 2016
- [c3]Shirshendu Ganguly, Elchanan Mossel, Miklós Z. Rácz:
Sequence assembly from corrupted shotgun reads. ISIT 2016: 265-269 - [c2]Gerandy Brito, Ioana Dumitriu, Shirshendu Ganguly, Christopher Hoffman, Linh V. Tran:
Recovery and Rigidity in a Regular Stochastic Block Model. SODA 2016: 1589-1601 - [i2]Shirshendu Ganguly, Elchanan Mossel, Miklós Z. Rácz:
Sequence assembly from corrupted shotgun reads. CoRR abs/1601.07086 (2016) - 2015
- [i1]Sébastien Bubeck, Shirshendu Ganguly:
Entropic CLT and phase transition in high-dimensional Wishart matrices. CoRR abs/1509.03258 (2015) - 2014
- [j3]Bhaswar B. Bhattacharya, Sayantan Das, Shirshendu Ganguly:
Minimum-Weight Edge Discriminators in Hypergraphs. Electron. J. Comb. 21(3): 3 (2014) - [j2]Laura Florescu, Shirshendu Ganguly, Lionel Levine
, Yuval Peres:
Escape Rates for Rotor Walks in Zd. SIAM J. Discret. Math. 28(1): 323-334 (2014) - [c1]Shirshendu Ganguly, Yuval Peres:
Permuted Random Walk Exits Typically in Linear Time. ANALCO 2014: 74-81
2000 – 2009
- 2008
- [j1]Riddhipratim Basu, Shirshendu Ganguly, Subhamoy Maitra, Goutam Paul:
A complete characterization of the evolution of RC4 pseudo random generation algorithm. J. Math. Cryptol. 2(3): 257-289 (2008)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-06 21:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint