Obserwuj
Igor Shinkar
Tytuł
Cytowane przez
Cytowane przez
Rok
Direct sum testing
R David, I Dinur, E Goldenberg, G Kindler, I Shinkar
SIAM Journal on Computing 46 (4), 1336-1369, 2017
362017
The complexity of DNF of parities
G Cohen, I Shinkar
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
322016
An~ o (n) queries adaptive tester for unateness
S Khot, I Shinkar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
242016
On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors
I Dinur, I Shinkar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010
212010
Two‐sided error proximity oblivious testing
O Goldreich, I Shinkar
Random Structures & Algorithms 48 (2), 341-383, 2016
182016
Acquaintance time of a graph
I Benjamini, I Shinkar, G Tsur
SIAM Journal on Discrete Mathematics 28 (2), 767-785, 2014
172014
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
152017
Excited random walk with periodic cookies
G Kozma, T Orenshtein, I Shinkar
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 52 (3 …, 2016
132016
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
132016
A tight upper bound on acquaintance time of graphs
O Angel, I Shinkar
Graphs and Combinatorics 32 (5), 1667-1673, 2016
122016
On hardness of approximating the parameterized clique problem
S Khot, I Shinkar
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
122016
Greedy random walk
T Orenshtein, I Shinkar
Combinatorics, Probability and Computing 23 (2), 269-289, 2014
122014
On axis-parallel tests for tensor product codes
A Chiesa, P Manohar, I Shinkar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017
102017
Relaxed locally correctable codes with nearly-linear block length and constant query complexity
A Chiesa, T Gur, I Shinkar
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
92020
A note on subspace evasive sets
A Ben-Aroya, I Shinkar
Chicago Journal of Theoretical Computer Science 9, 1-11, 2014
82014
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
72018
A counterexample to monotonicity of relative mass in random walks
O Regev, I Shinkar
Electronic Communications in Probability 21, 1-8, 2016
62016
MS Thesis
I Banerjee, D Richards, D Richards, I Shinkar, C Numerantium
61997
Relaxed locally correctable codes with improved parameters
VR Asadi, I Shinkar
arXiv preprint arXiv:2009.07311, 2020
52020
Testing linearity against non-signaling strategies
A Chiesa, P Manohar, I Shinkar
ACM Transactions on Computation Theory (TOCT) 12 (3), 1-51, 2020
52020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20