Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSourav Chakraborty 0001
Person information
- affiliation: Indian Statistical Institute, Kolkata, India
- affiliation (former): Chennai Mathematical Institute, Chennai, India
Other persons with the same name
- Sourav Chakraborty 0002 — University of Delhi, Delhi, India
- Sourav Chakraborty 0003 — Ohio State University, Columbus, OH, USA
- Sourav Chakraborty 0004 — Simon Fraser University
- Sourav Chakraborty 0005 — Boston University, MA, USA
- Sourav Chakraborty 0006
![[0000-0001-6866-9374]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-6866-9374")
— Cooch Behar Government Engineering College, India (and 1 more) - Sourav Chakraborty 0008 — National Institute of Technology Rourkela, Department of Electrical Engineering, India
- Sourav Chakraborty 0009 — University of Colorado Boulder, CO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c52]Rishiraj Bhattacharyya, Sourav Chakraborty, Yash Pote, Uddalok Sarkar, Sayantan Sen:
Testing Self-Reducible Samplers. AAAI 2024: 7952-7960- [c51]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Equivalence Testing: The Power of Bounded Adaptivity. AISTATS 2024: 3592-3600 - [c50]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar:
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. SODA 2024: 4371-4394 - [i52]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Equivalence Testing: The Power of Bounded Adaptivity. CoRR abs/2403.04230 (2024) - 2023
- [c49]Ansuman Banerjee, Shayak Chakraborty, Sourav Chakraborty, Kuldeep S. Meel, Uddalok Sarkar, Sayantan Sen:
Testing of Horn Samplers. AISTATS 2023: 1301-1330 - [c48]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Composition of Randomized Query Complexity and Approximate Degree. APPROX/RANDOM 2023: 63:1-63:23 - [c47]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. COLT 2023: 3065-3136 - [c46]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? ICALP 2023: 123:1-123:17 - [c45]Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski:
Engineering an Efficient Approximate DNF-Counter. IJCAI 2023: 2031-2038 - [c44]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate Games. ITCS 2023: 32:1-32:24 - [c43]Sourav Chakraborty, Avijeet Ghosh, Sujata Ghosh, François Schwarzentruber:
On Simple Expectations and Observations of Intelligent Agents: A Complexity Study. KR 2023: 136-145 - [i51]Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
Distinct Elements in Streams: An Algorithm for the (Text) Book. CoRR abs/2301.10191 (2023) - [i50]Sourav Chakraborty, Avijeet Ghosh, Sujata Ghosh, François Schwarzentruber:
On simple expectations and observations of intelligent agents: A complexity study. CoRR abs/2306.02769 (2023) - [i49]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle? CoRR abs/2306.10281 (2023) - [i48]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Composition of Randomized Query Complexity and Approximate Degree. CoRR abs/2307.03900 (2023) - [i47]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar:
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. CoRR abs/2308.11558 (2023) - [i46]Rishiraj Bhattacharyya, Sourav Chakraborty, Yash Pote, Uddalok Sarkar, Sayantan Sen:
Testing Self-Reducible Samplers. CoRR abs/2312.10999 (2023) - [i45]Kuldeep S. Meel, Sourav Chakraborty, Umang Mathur:
A faster FPRAS for #NFA. CoRR abs/2312.13320 (2023) - [i44]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Composition of Randomized Query Complexity and Approximate Degree. Electron. Colloquium Comput. Complex. TR23 (2023) - [i43]Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar:
Separations between Combinatorial Measures for Transitive Functions. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j14]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Comput. Complex. 31(2): 9 (2022) - [j13]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem. Discret. Appl. Math. 319: 111-120 (2022) - [c42]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. APPROX/RANDOM 2022: 27:1-27:23 - [c41]Mate Soos, Priyanka Golia, Sourav Chakraborty, Kuldeep S. Meel:
On Quantitative Testing of Samplers. CP 2022: 36:1-36:16 - [c40]Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
Distinct Elements in Streams: An Algorithm for the (Text) Book. ESA 2022: 34:1-34:6 - [c39]Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar:
Separations Between Combinatorial Measures for Transitive Functions. ICALP 2022: 36:1-36:20 - [c38]Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran:
A Scalable t-wise Coverage Estimator. ICSE 2022: 36-47 - [c37]Sourav Chakraborty, Avijeet Ghosh, Sujata Ghosh, François Schwarzentruber:
On Verifying Expectations and Observations of Intelligent Agents. IJCAI 2022: 2568-2574 - [c36]Kuldeep S. Meel, Sourav Chakraborty, N. V. Vinodchandran:
Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. PODS 2022: 41-52 - [c35]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-To-Communication Simulation. STACS 2022: 20:1-20:23 - [i42]Sourav Chakraborty, Avijeet Ghosh, Sujata Ghosh, François Schwarzentruber:
On verifying expectations and observations of intelligent agents. CoRR abs/2205.00784 (2022) - [i41]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. CoRR abs/2207.12514 (2022) - [i40]Sourav Chakraborty, Arijit Ghosh, Soumi Nandi:
Colorful Helly Theorem for Piercing Boxes with Two Points. CoRR abs/2207.14368 (2022) - [i39]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. CoRR abs/2211.03396 (2022) - [i38]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. Electron. Colloquium Comput. Complex. TR22 (2022) - [i37]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j12]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf:
Two new results about quantum exact learning. Quantum 5: 587 (2021) - [j11]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory 13(4): 22:1-22:40 (2021) - [c34]Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds. APPROX-RANDOM 2021: 34:1-34:23 - [c33]Priyanka Golia, Mate Soos, Sourav Chakraborty, Kuldeep S. Meel:
Designing Samplers is Easy: The Boon of Testers. FMCAD 2021: 222-230 - [c32]Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal:
Tight Chang's-Lemma-Type Bounds for Boolean Functions. FSTTCS 2021: 10:1-10:22 - [c31]Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty:
Estimating the Size of Union of Sets in Streaming Models. PODS 2021: 126-137 - [i36]Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar:
Separations between Combinatorial Measures for Transitive Functions. CoRR abs/2103.12355 (2021) - [i35]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Exploring the Gap between Tolerant and Non-tolerant Distribution Testing. CoRR abs/2110.09972 (2021) - 2020
- [c30]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. APPROX-RANDOM 2020: 23:1-23:15 - [c29]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. CCC 2020: 32:1-32:15 - [c28]Kuldeep S. Meel, Yash Pote, Sourav Chakraborty:
On Testing of Samplers. NeurIPS 2020 - [c27]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-Entropy. STACS 2020: 45:1-45:19 - [i34]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. CoRR abs/2006.13712 (2020) - [i33]Kuldeep S. Meel, Yash Pote, Sourav Chakraborty:
On Testing of Samplers. CoRR abs/2010.12918 (2020) - [i32]Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal:
Tight Chang's-lemma-type bounds for Boolean functions. CoRR abs/2012.02335 (2020) - [i31]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-to-Communication Simulation. CoRR abs/2012.05233 (2020) - [i30]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Electron. Colloquium Comput. Complex. TR20 (2020) - [i29]Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Estimation of Graph Isomorphism Distance in the Query World. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c26]Sourav Chakraborty, Kuldeep S. Meel:
On Testing of Uniform Samplers. AAAI 2019: 7777-7784 - [c25]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CALDAM 2019: 201-215 - [c24]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf:
Two New Results About Quantum Exact Learning. ICALP 2019: 16:1-16:15 - [i28]Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh:
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. CoRR abs/1903.11635 (2019) - [i27]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. CoRR abs/1909.10428 (2019) - [i26]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j10]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. Int. J. Comput. Geom. Appl. 28(4): 365-379 (2018) - [j9]Rishiraj Bhattacharyya, Sourav Chakraborty:
Property Testing of Joint Distributions using Conditional Samples. ACM Trans. Comput. Theory 10(4): 16:1-16:20 (2018) - [c23]Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh:
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. LATIN 2018: 275-289 - [i25]Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy:
Maximal and maximum transitive relation contained in a given binary relation. CoRR abs/1805.08953 (2018) - [i24]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CoRR abs/1809.08856 (2018) - [i23]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved bounds on Fourier entropy and Min-entropy. CoRR abs/1809.09819 (2018) - [i22]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Ronald de Wolf:
Two new results about quantum exact learning. CoRR abs/1810.00481 (2018) - [i21]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved bounds on Fourier entropy and Min-entropy. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i20]Rishiraj Bhattacharyya, Sourav Chakraborty:
Property Testing of Joint Distributions using Conditional Samples. CoRR abs/1702.01454 (2017) - 2016
- [j8]Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap:
Testing whether the uniform distribution is a stationary distribution. Inf. Process. Lett. 116(7): 475-480 (2016) - [j7]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. SIAM J. Comput. 45(4): 1261-1296 (2016) - [j6]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper bounds on Fourier entropy. Theor. Comput. Sci. 654: 92-112 (2016) - [i19]Sourav Chakraborty, Shamik Ghosh, Sanchita Paul, Malay K. Sen:
Characterization and recognition of proper tagged probe interval graphs. CoRR abs/1607.02922 (2016) - 2015
- [c22]Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy:
Maximal and Maximum Transitive Relation Contained in a Given Binary Relation. COCOON 2015: 587-600 - [c21]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. COCOON 2015: 771-782 - 2014
- [j5]Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. Theory Comput. 10: 515-533 (2014) - [c20]Rupam Acharyya, Sourav Chakraborty, Nitesh Jha:
Counting Popular Matchings in House Allocation Problems. CSR 2014: 39-51 - [c19]Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni:
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. CSR 2014: 97-110 - [c18]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. LATIN 2014: 306-317 - 2013
- [j4]Noga Alon, Eric Blais, Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. SIAM J. Comput. 42(2): 459-493 (2013) - [c17]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the power of conditional samples in distribution testing. ITCS 2013: 561-580 - [i18]Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap:
Testing uniformity of stationary distribution. CTW 2013: 47-50 - [i17]Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap:
Testing Uniformity of Stationary Distribution. CoRR abs/1302.5366 (2013) - [i16]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. CoRR abs/1307.8268 (2013) - [i15]Rupam Acharyya, Sourav Chakraborty, Nitesh Jha:
Counting Popular Matchings in House Allocation Problems. CoRR abs/1312.3552 (2013) - [i14]Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni:
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. Electron. Colloquium Comput. Complex. TR13 (2013) - [i13]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j3]Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Monotonicity testing and shortest-path routing on the cube. Comb. 32(1): 35-53 (2012) - [c16]Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah:
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. CCC 2012: 148-158 - [c15]Sourav Chakraborty, Oded Lachish:
Improved competitive ratio for the matroid secretary problem. SODA 2012: 1702-1712 - [i12]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. CoRR abs/1210.8338 (2012) - [i11]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j2]Sourav Chakraborty:
On the sensitivity of cyclically-invariant Boolean functions. Discret. Math. Theor. Comput. Sci. 13(4): 51-60 (2011) - [j1]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3): 330-347 (2011) - [c14]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Efficient Sample Extractors for Juntas with Applications. ICALP (1) 2011: 545-556 - [c13]Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. ICS 2011: 264-274 - [c12]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Cycle Detection, Order Finding and Discrete Log with Jumps. ICS 2011: 284-297 - [c11]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. SODA 2011: 1683-1702 - 2010
- [c10]Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Monotonicity Testing and Shortest-Path Routing on the Cube. APPROX-RANDOM 2010: 462-475 - [c9]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
New Results on Quantum Property Testing. FSTTCS 2010: 145-156 - [c8]Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster:
Two-phase Algorithms for the Parametric Shortest Path Problem. STACS 2010: 167-178 - [c7]Sourav Chakraborty, Nikhil R. Devanur, Chinmay Karande:
Market Equilibrium with Transaction Costs. WINE 2010: 496-504 - [i10]Sourav Chakraborty, Nikhil R. Devanur, Chinmay Karande:
Market Equilibrium with Transaction Costs. CoRR abs/1001.0393 (2010) - [i9]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
New Results on Quantum Property Testing. CoRR abs/1005.0523 (2010) - [i8]Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i7]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. Electron. Colloquium Comput. Complex. TR10 (2010) - [i6]David García-Soriano, Arie Matsliah, Sourav Chakraborty, Jop Briët:
Monotonicity Testing and Shortest-Path Routing on the Cube. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c6]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity. STACS 2009: 243-254 - [c5]Sourav Chakraborty, Nikhil R. Devanur:
An Online Multi-unit Auction with Improved Competitive Ratio. WINE 2009: 79-88 - [i5]Sourav Chakraborty, Nikhil R. Devanur:
An Online Multi-unit Auction with Improved Competitive Ratio. CoRR abs/0901.1427 (2009) - [i4]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity. CoRR abs/0902.1255 (2009) - 2008
- [i3]Sourav Chakraborty, László Babai:
Property Testing of Equivalence under a Permutation Group Action. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c4]Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman:
Testing st -Connectivity. APPROX-RANDOM 2007: 380-394 - 2006
- [c3]Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte:
Zero Error List-Decoding Capacity of the q/(q-1) Channel. FSTTCS 2006: 129-138 - 2005
- [c2]Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan:
Bounds for Error Reduction with Few Quantum Queries. APPROX-RANDOM 2005: 245-256 - [c1]Sourav Chakraborty:
On the Sensitivity of Cyclically-Invariant Boolean Functions. CCC 2005: 163-167 - [i2]Sourav Chakraborty:
On the Sensitivity of Cyclically-Invariant Boolean Functions. CoRR abs/cs/0501026 (2005) - [i1]Sourav Chakraborty:
On the Sensitivity of Cyclically-Invariant Boolean Functions. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
a service of 
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-05-17 00:41 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:
