Igor Shinkar
Title
Cited by
Cited by
Year
Direct sum testing
R David, I Dinur, E Goldenberg, G Kindler, I Shinkar
SIAM Journal on Computing 46 (4), 1336-1369, 2017
322017
The complexity of DNF of parities
G Cohen, I Shinkar
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
232016
An~ o (n) queries adaptive tester for unateness
S Khot, I Shinkar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
212016
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
192010
Two‐sided error proximity oblivious testing
O Goldreich, I Shinkar
Random Structures & Algorithms 48 (2), 341-383, 2016
152016
Acquaintance time of a graph
I Benjamini, I Shinkar, G Tsur
SIAM Journal on Discrete Mathematics 28 (2), 767-785, 2014
152014
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
122016
A graph-theoretic approach to multitasking
N Alon, JD Cohen, B Dey, T Griffiths, S Musslick, K Ozcimder, ...
arXiv preprint arXiv:1611.02400, 2016
102016
A tight upper bound on acquaintance time of graphs
O Angel, I Shinkar
Graphs and Combinatorics 32 (5), 1667-1673, 2016
102016
On hardness of approximating the parameterized clique problem
S Khot, I Shinkar
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
102016
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
92016
Greedy random walk
T Orenshtein, I Shinkar
arXiv preprint arXiv:1101.5711, 2011
92011
On axis-parallel tests for tensor product codes
A Chiesa, P Manohar, I Shinkar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017
72017
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
62018
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
52020
Zero-fixing extractors for sub-logarithmic entropy
G Cohen, I Shinkar
International Colloquium on Automata, Languages, and Programming, 343-354, 2015
52015
Testing linearity against non-signaling strategies
A Chiesa, P Manohar, I Shinkar
ACM Transactions on Computation Theory (TOCT) 12 (3), 1-51, 2020
42020
Sorting networks on restricted topologies
I Banerjee, D Richards, I Shinkar
International Conference on Current Trends in Theory and Practice of …, 2019
42019
A Note on Subspace Evasive Sets.
A Ben-Aroya, I Shinkar
Electronic Colloquium on Computational Complexity (ECCC) 19 (95), 1, 2012
42012
On percolation and‐hardness
H Bennett, D Reichman, I Shinkar
Random Structures & Algorithms 54 (2), 228-257, 2019
32019
The system can't perform the operation now. Try again later.
Articles 1–20