| Hardness and algorithms for rainbow connection S Chakraborty, E Fischer, A Matsliah, R Yuster Journal of Combinatorial Optimization 21, 330-347, 2011 | 259 | 2011 |
| 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 | 78 | 2012 |
| 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 | 74 | 2013 |
| Improved competitive ratio for the matroid secretary problem S Chakraborty, O Lachish Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 58 | 2012 |
| On the sensitivity of cyclically-invariant boolean functions S Chakraborty 20th Annual IEEE Conference on Computational Complexity (CCC'05), 163-167, 2005 | 42* | 2005 |
| New results on quantum property testing S Chakraborty, E Fischer, A Matsliah, R de Wolf Arxiv preprint arXiv:1005.0523, 2010 | 39 | 2010 |
| On testing of uniform samplers S Chakraborty, KS Meel Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7777-7784, 2019 | 36 | 2019 |
| 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 | 34 | 2011 |
| Property testing of joint distributions using conditional samples R Bhattacharyya, S Chakraborty ACM Transactions on Computation Theory (TOCT) 10 (4), 1-20, 2018 | 33 | 2018 |
| 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 | 33 | 2011 |
| 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 | 31* | 2019 |
| 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 | 26 | 2012 |
| Testing st-Connectivity S Chakraborty, E Fischer, O Lachish, A Matsliah, I Newman International Workshop on Approximation Algorithms for Combinatorial …, 2007 | 23 | 2007 |
| 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 | 21 | 2021 |
| 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 | 19 | 2021 |
| Upper bounds on Fourier entropy S Chakraborty, R Kulkarni, SV Lokam, N Saurabh Theoretical Computer Science 654, 92-112, 2016 | 19 | 2016 |
| 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 | 19 | 2013 |
| Bounds for error reduction with few quantum queries S Chakraborty, J Radhakrishnan, N Raghunathan International Workshop on Approximation Algorithms for Combinatorial …, 2005 | 19* | 2005 |
| Market equilibrium with transaction costs S Chakraborty, NR Devanur, C Karande Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010 | 15 | 2010 |
| On testing of samplers KS Meel, YP Pote, S Chakraborty Advances in Neural Information Processing Systems 33, 5753-5763, 2020 | 14 | 2020 |
Arie MatsliahPrinceton University在 princeton.edu 的电子邮件经过验证
