Παρακολούθηση
Sourav Chakraborty
Sourav Chakraborty
Indian Statistical Institute, Kolkata
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα isical.ac.in - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Hardness and algorithms for rainbow connection
S Chakraborty, E Fischer, A Matsliah, R Yuster
Journal of Combinatorial Optimization 21, 330-347, 2011
2672011
On the power of conditional samples in distribution testing
S Chakraborty, E Fischer, Y Goldhirsh, A Matsliah
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
792013
Monotonicity testing and shortest-path routing on the cube
J Briët, S Chakraborty, D García-Soriano, A Matsliah
Combinatorica 32 (1), 35-53, 2012
792012
Improved competitive ratio for the matroid secretary problem
S Chakraborty, O Lachish
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
612012
On the sensitivity of cyclically-invariant boolean functions
S Chakraborty
20th Annual IEEE Conference on Computational Complexity (CCC'05), 163-167, 2005
44*2005
New results on quantum property testing
S Chakraborty, E Fischer, A Matsliah, R de Wolf
Arxiv preprint arXiv:1005.0523, 2010
422010
On testing of uniform samplers
S Chakraborty, KS Meel
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7777-7784, 2019
392019
Property testing of joint distributions using conditional samples
R Bhattacharyya, S Chakraborty
ACM Transactions on Computation Theory (TOCT) 10 (4), 1-20, 2018
382018
Efficient sample extractors for juntas with applications
S Chakraborty, D García-Soriano, A Matsliah
International Colloquium on Automata, Languages, and Programming, 545-556, 2011
352011
Two new results about exact quantum learning
S Arunachalam, S Chakraborty, T Lee, M Paraashar, RD Wolf
International Colloquium on Automata, Languages, and Programming, 2019
33*2019
Nearly tight bounds for testing function isomorphism
S Chakraborty, D García-Soriano, A Matsliah
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011
332011
Designing samplers is easy: The boon of testers
P Golia, M Soos, S Chakraborty, KS Meel
2021 Formal Methods in Computer Aided Design (FMCAD), 222-230, 2021
292021
Junto-symmetric functions, hypergraph isomorphism and crunching
S Chakraborty, E Fischer, D GacíaSoriano, A Matsliah
2012 IEEE 27th Conference on Computational Complexity, 148-158, 2012
282012
Improved bounds on Fourier entropy and min-entropy
S Arunachalam, S Chakraborty, M Koucký, N Saurabh, R De Wolf
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-40, 2021
232021
Testing st-Connectivity
S Chakraborty, E Fischer, O Lachish, A Matsliah, I Newman
International Workshop on Approximation Algorithms for Combinatorial …, 2007
232007
Upper bounds on Fourier entropy
S Chakraborty, R Kulkarni, SV Lokam, N Saurabh
Theoretical Computer Science 654, 92-112, 2016
212016
Bounds for error reduction with few quantum queries
S Chakraborty, J Radhakrishnan, N Raghunathan
International Workshop on Approximation Algorithms for Combinatorial …, 2005
21*2005
Nearly tight bounds for testing function isomorphism
N Alon, E Blais, S Chakraborty, D García-Soriano, A Matsliah
SIAM Journal on Computing 42 (2), 459-493, 2013
202013
On testing of samplers
KS Meel, YP Pote, S Chakraborty
Advances in Neural Information Processing Systems 33, 5753-5763, 2020
152020
Market equilibrium with transaction costs
S Chakraborty, NR Devanur, C Karande
Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010
152010
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20