受强制性开放获取政策约束的文章 - Igor Shinkar了解详情
可在其他位置公开访问的文章：23 篇
The complexity of DNF of parities
G Cohen, I Shinkar
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
强制性开放获取政策： US National Science Foundation
Direct sum testing
R David, I Dinur, E Goldenberg, G Kindler, I Shinkar
Proceedings of the 2015 Conference on innovations in theoretical computer …, 2015
强制性开放获取政策： European Commission
An~ o (n) queries adaptive tester for unateness
S Khot, I Shinkar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： UK Research & Innovation
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
强制性开放获取政策： Hewlett Foundation, US Department of Defense
Acquaintance time of a graph
I Benjamini, I Shinkar, G Tsur
SIAM Journal on Discrete Mathematics 28 (2), 767-785, 2014
强制性开放获取政策： European Commission
Greedy random walk
T Orenshtein, I Shinkar
Combinatorics, Probability and Computing 23 (2), 269-289, 2014
强制性开放获取政策： European Commission
Excited random walk with periodic cookies
G Kozma, T Orenshtein, I Shinkar
强制性开放获取政策： European Commission
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
强制性开放获取政策： European Commission
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
强制性开放获取政策： UK Research & Innovation
A tight upper bound on acquaintance time of graphs
O Angel, I Shinkar
Graphs and Combinatorics 32, 1667-1673, 2016
强制性开放获取政策： US National Science Foundation, Natural Sciences and Engineering Research …
On hardness of approximating the parameterized clique problem
S Khot, I Shinkar
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
强制性开放获取政策： US National Science Foundation
A note on subspace evasive sets
A Ben-Aroya, I Shinkar
Chicago Journal of Theoretical Computer Science 9, 1-11, 2014
强制性开放获取政策： European Commission
Meyniel extremal families of Abelian Cayley graphs
F Hasiri, I Shinkar
Graphs and Combinatorics 38 (3), 61, 2022
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
On the Power of Interactive Proofs for Learning
T Gur, MM Jahanara, MM Khodabandeh, N Rajgopal, B Salamatian, ...
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1063-1070, 2024
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, UK Research & Innovation
Multitasking capacity: Hardness results and improved constructions
N Alon, JD Cohen, TL Griffiths, P Manurangsi, D Reichman, I Shinkar, ...
SIAM Journal on Discrete Mathematics 34 (1), 885-903, 2020
强制性开放获取政策： US National Science Foundation
An entropy lower bound for non-malleable extractors
T Gur, I Shinkar
IEEE Transactions on Information Theory 66 (5), 2904-2911, 2019
强制性开放获取政策： UK Research & Innovation
A counterexample to monotonicity of relative mass in random walks
O Regev, I Shinkar
强制性开放获取政策： US National Science Foundation
On axis-parallel tests for tensor product codes
A Chiesa, P Manohar, I Shinkar
Theory of Computing 16 (1), 1-34, 2020
强制性开放获取政策： US National Science Foundation, Natural Sciences and Engineering Research …
On Lipschitz bijections between boolean functions
S Rao, I Shinkar
Combinatorics, Probability and Computing 27 (3), 411-426, 2018
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定