Get started
Author

Igor Shinkar

Observed names: IGOR SHINKAR, Shinkar, Igor
Observed institutions: University of British Columbia, Simon Fraser University, Princeton University, Cornell University, Courant Institute of Mathematical Sciences, Weizmann Institute of Science, New York University, University of California, Berkeley
ORCID: 0000-0001-5013-6422
Observed ORCID: 0000-0001-5013-6422
OpenAlex ID: A5028165107
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors
2010 · Irit Dinur, Igor Shinkar · Lecture notes in computer science · 18
The Complexity of DNF of Parities
2016 · Gil Cohen, Igor Shinkar · 16
PDF
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
2019 · Alessandro Chiesa, Tom Gur, et al. · Society for Industrial and Applied Mathematics eBooks · 14
PDF
Direct Sum Testing
2015 · Roee David, Irit Dinur, et al. · Conference on Innovations in Theoretical Computer Science · 13
A Graph-Theoretic Approach to Multitasking
2016 · Alon, Noga, Cohen, Jonathan D., et al. · arXiv (Cornell University) · 10
PDF
Acquaintance Time of a Graph
2014 · Itai Benjamini, Igor Shinkar, et al. · SIAM Journal on Discrete Mathematics · 10
PDF
Direct Sum Testing
2017 · Roee David, Irit Dinur, et al. · SIAM Journal on Computing · 9
An e O(n) Queries Adaptive Tester for Unateness
2016 · Subhash Khot, Igor Shinkar · 9
Worst-case to average-case reductions via additive combinatorics
2022 · Vahid R. Asadi, Alexander Golovnev, et al. · ACM SIGACT Symposium on Theory of Computing (STOC) · 8
Relaxed Locally Correctable Codes with Improved Parameters
2020 · Asadi, Vahid R., Shinkar, Igor · arXiv (Cornell University) · 7
PDF
A counterexample to monotonicity of relative mass in random walks
2016 · Oded Regev, Igor Shinkar · Electronic Communications in Probability · 7
PDF
Two-Sided Error Proximity Oblivious Testing - (Extended Abstract).
2012 · Oded Goldreich, Igor Shinkar · International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 7
A Tight Upper Bound on Acquaintance Time of Graphs
2016 · Omer Angel, Igor Shinkar · Graphs and Combinatorics · 6
An ~O(n) Queries Adaptive Tester for Unateness
2016 · Khot, Subhash, Shinkar, Igor · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 6
PDF
Two-sided error proximity oblivious testing
2014 · Oded Goldreich, Igor Shinkar · Random Structures and Algorithms · 6
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball
2014 · Itai Benjamini, Gil Cohen, et al. · Annual Symposium on Foundations of Computer Science · 6
Two-Sided Error Proximity Oblivious Testing
2012 · Oded Goldreich, Igor Shinkar · Lecture notes in computer science · 6
Multitasking Capacity: Hardness Results and Improved Constructions
2020 · Noga Alon, Jonathan D. Cohen, et al. · SIAM Journal on Discrete Mathematics · 5
PDF
The Complexity of DNF of Parities.
2014 · Gil Cohen, Igor Shinkar · CaltechAUTHORS (California Institute of Technology) · 5
A Note on Subspace Evasive Sets.
2012 · Avraham Ben-Aroya, Igor Shinkar · Chicago Journal of Theoretical Computer Science · 5
On the Power of Interactive Proofs for Learning
2024 · Tom Gur, Mohammad Mahdi Jahanara, et al. · ACM Symposium on Theory of Computing (STOC) · 4
Quantum Worst-Case to Average-Case Reductions for All Linear Problems
2024 · Vahid R. Asadi, Alexander Golovnev, et al. · Society for Industrial and Applied Mathematics eBooks · 4
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
2022 · Alessandro Chiesa, Tom Gur, et al. · SIAM Journal on Computing · 4
An Entropy Lower Bound for Non-Malleable Extractors
2019 · Tom Gur, Igor Shinkar · IEEE Transactions on Information Theory · 4
PDF
On percolation and ‐hardness
2018 · Huck Bennett, Daniel Reichman, et al. · Random Structures and Algorithms · 4
Works count: 71
Citation count: 245
H-index: 8
I10-index: 6
Year
Topic
Type