| Direct sum testing R David, I Dinur, E Goldenberg, G Kindler, I Shinkar Proceedings of the 2015 Conference on innovations in theoretical computer …, 2015 | 42 | 2015 |
| The complexity of DNF of parities G Cohen, I Shinkar Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016 | 38 | 2016 |
| An~ o (n) queries adaptive tester for unateness S Khot, I Shinkar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016 | 26 | 2016 |
| On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors I Dinur, I Shinkar International Workshop on Randomization and Approximation Techniques in …, 2010 | 24 | 2010 |
| Two‐sided error proximity oblivious testing O Goldreich, I Shinkar Random Structures & Algorithms 48 (2), 341-383, 2016 | 21 | 2016 |
| Acquaintance time of a graph I Benjamini, I Shinkar, G Tsur SIAM Journal on Discrete Mathematics 28 (2), 767-785, 2014 | 16 | 2014 |
| A graph-theoretic approach to multitasking N Alon, D Reichman, I Shinkar, T Wagner, S Musslick, JD Cohen, ... Advances in neural information processing systems 30, 2017 | 15 | 2017 |
| Relaxed locally correctable codes with nearly-linear block length and constant query complexity A Chiesa, T Gur, I Shinkar SIAM Journal on Computing 51 (6), 1839-1865, 2022 | 14 | 2022 |
| Excited random walk with periodic cookies G Kozma, T Orenshtein, I Shinkar | 14 | 2016 |
| Greedy random walk T Orenshtein, I Shinkar Combinatorics, Probability and Computing 23 (2), 269-289, 2014 | 13 | 2014 |
| Bi-Lipschitz bijection between the Boolean cube and the Hamming ball I Benjamini, G Cohen, I Shinkar Israel Journal of Mathematics 212 (2), 677-703, 2016 | 12 | 2016 |
| On hardness of approximating the parameterized clique problem S Khot, I Shinkar Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016 | 12 | 2016 |
| On axis-parallel tests for tensor product codes A Chiesa, P Manohar, I Shinkar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 11 | 2017 |
| A tight upper bound on acquaintance time of graphs O Angel, I Shinkar Graphs and Combinatorics 32, 1667-1673, 2016 | 11 | 2016 |
| Relaxed locally correctable codes with improved parameters VR Asadi, I Shinkar arXiv preprint arXiv:2009.07311, 2020 | 10 | 2020 |
| A note on subspace evasive sets A Ben-Aroya, I Shinkar Chicago Journal of Theoretical Computer Science 9, 1-11, 2014 | 9 | 2014 |
| Probabilistic checking against non-signaling strategies from linearity testing A Chiesa, P Manohar, I Shinkar 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018 | 8 | 2018 |
| Worst-case to average-case reductions via additive combinatorics VR Asadi, A Golovnev, T Gur, I Shinkar Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 7 | 2022 |
| Meyniel extremal families of Abelian Cayley graphs F Hasiri, I Shinkar Graphs and Combinatorics 38 (3), 61, 2022 | 7 | 2022 |
| Testing linearity against non-signaling strategies A Chiesa, P Manohar, I Shinkar ACM Transactions on Computation Theory (TOCT) 12 (3), 1-51, 2020 | 6 | 2020 |
Alessandro ChiesaEPFLVerified email at epfl.ch
