default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmites Sarkar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Ishan Banerjee, Amites Sarkar:
Sums of Two Squares Visualized. Am. Math. Mon. 131(7): 558-565 (2024)- 2022
- [j14]Jacob Richey, Amites Sarkar:
Intersections of random sets. J. Appl. Probab. 59(1): 131-151 (2022) - 2021
- [j13]A. Nicholas Day, Amites Sarkar:
On a Conjecture of Nagy on Extremal Densities. SIAM J. Discret. Math. 35(1): 294-306 (2021)
2010 – 2019
- 2018
- [j12]Shinya Fujita, Henry Liu, Amites Sarkar:
Highly connected subgraphs of graphs with given independence number. Eur. J. Comb. 70: 212-231 (2018) - 2017
- [j11]Daniel Johnston, Cory Palmer
, Amites Sarkar:
Rainbow Turán Problems for Paths and Forests of Stars. Electron. J. Comb. 24(1): 1 (2017) - [j10]Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters:
Sentry selection in sensor networks: theory and algorithms. Int. J. Sens. Networks 24(3): 139-148 (2017) - 2016
- [j9]Shinya Fujita, Henry Liu, Amites Sarkar:
Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract). Electron. Notes Discret. Math. 54: 103-108 (2016) - [j8]Paul Balister, Béla Bollobás, Amites Sarkar:
Barrier Coverage. Random Struct. Algorithms 49(3): 429-478 (2016) - [i2]Martin Haenggi, Amites Sarkar:
Unique coverage in Boolean models. CoRR abs/1608.02032 (2016) - 2014
- [c4]Amites Sarkar:
Secrecy coverage in two dimensions. ITA 2014: 1-6 - 2013
- [j7]Amites Sarkar, Martin Haenggi:
Percolation in the secrecy graph. Discret. Appl. Math. 161(13-14): 2120-2132 (2013) - [j6]Amites Sarkar, Martin Haenggi:
Secrecy Coverage. Internet Math. 9(2-3): 199-216 (2013) - 2011
- [c3]Amites Sarkar, Martin Haenggi:
Percolation in the secrecy graph. ITA 2011: 140-145 - [c2]Amites Sarkar, Martin Haenggi:
Percolation in the secrecy graph: Bounds on the critical probability and impact of power constraints. ITW 2011: 673-677 - [i1]Amites Sarkar, Martin Haenggi:
Percolation in the Secrecy Graph. CoRR abs/1107.4613 (2011) - 2010
- [j5]Paul Balister, Steve Kalikow, Amites Sarkar:
The Linus Sequence. Comb. Probab. Comput. 19(1): 21-46 (2010)
2000 – 2009
- 2009
- [j4]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Highly connected random geometric graphs. Discret. Appl. Math. 157(2): 309-320 (2009) - 2008
- [j3]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Connectivity of a Gaussian network. Int. J. Ad Hoc Ubiquitous Comput. 3(3): 204-213 (2008) - 2007
- [c1]Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar:
Reliable density estimates for coverage and connectivity in thin strips of finite length. MobiCom 2007: 75-86 - 2003
- [j2]Béla Bollobás, Amites Sarkar:
Paths of length four. Discret. Math. 265(1-3): 357-363 (2003)
1990 – 1999
- 1999
- [j1]Béla Bollobás, Paul Erdös, Amites Sarkar:
Extremal graphs for weights. Discret. Math. 200(1-3): 5-19 (1999)
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-08-18 00:31 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:
