Amites Sarkar

According to our database, Amites Sarkar authored at least 19 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of one.

2024

Sums of Two Squares Visualized.

Ishan Banerjee, Amites Sarkar

Am. Math. Mon., August, 2024

2022

Intersections of random sets.

Jacob Richey, Amites Sarkar

J. Appl. Probab., 2022

2021

On a Conjecture of Nagy on Extremal Densities.

A. Nicholas Day, Amites Sarkar

SIAM J. Discret. Math., 2021

2018

Highly connected subgraphs of graphs with given independence number.

Shinya Fujita, Henry Liu, Amites Sarkar

Eur. J. Comb., 2018

2017

Sentry selection in sensor networks: theory and algorithms.

Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters

Int. J. Sens. Networks, 2017

Rainbow Turán Problems for Paths and Forests of Stars.

Daniel Johnston, Cory Palmer, Amites Sarkar

Electron. J. Comb., 2017

2016

Barrier Coverage.

Paul Balister, Béla Bollobás, Amites Sarkar

Random Struct. Algorithms, 2016

Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract).

Shinya Fujita, Henry Liu, Amites Sarkar

Electron. Notes Discret. Math., 2016

Unique coverage in Boolean models.

Martin Haenggi, Amites Sarkar

CoRR, 2016

2014

Secrecy coverage in two dimensions.

Amites Sarkar

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

2013

Secrecy Coverage.

Amites Sarkar, Martin Haenggi

Internet Math., 2013

Percolation in the secrecy graph.

Amites Sarkar, Martin Haenggi

Discret. Appl. Math., 2013

2011

Percolation in the secrecy graph: Bounds on the critical probability and impact of power constraints.

Amites Sarkar, Martin Haenggi

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010

The Linus Sequence.

Paul Balister, Steve Kalikow, Amites Sarkar

Comb. Probab. Comput., 2010

2009

Highly connected random geometric graphs.

Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters

Discret. Appl. Math., 2009

2008

Connectivity of a Gaussian network.

Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters

Int. J. Ad Hoc Ubiquitous Comput., 2008

2007

Reliable density estimates for coverage and connectivity in thin strips of finite length.

Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar

Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

2003

Paths of length four.

Béla Bollobás, Amites Sarkar

Discret. Math., 2003

1999

Extremal graphs for weights.

Béla Bollobás, Paul Erdös, Amites Sarkar

Discret. Math., 1999