Two-Sided Error Proximity Oblivious Testing - (Extended Abstract). - Oded Goldreich 001; Igor Shinkar (APPROX-RANDOM, 2012)

Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. - Itai Benjamini; Gil Cohen; Igor Shinkar (Electron. Colloquium Comput. Complex., 2013)

On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant Number of Colors. - Irit Dinur; Igor Shinkar (Electron. Colloquium Comput. Complex., 2013)

A Note on Subspace Evasive Sets. - Avraham Ben-Aroya; Igor Shinkar (Chic. J. Theor. Comput. Sci., 2014)

Greedy Random Walk. - Tal Orenshtein; Igor Shinkar (Comb. Probab. Comput., 2014)

The Complexity of DNF of Parities. - Gil Cohen; Igor Shinkar (Electron. Colloquium Comput. Complex., 2014)

Zero-Fixing Extractors for Sub-Logarithmic Entropy. - Gil Cohen; Igor Shinkar (Electron. Colloquium Comput. Complex., 2014)

Acquaintance Time of a Graph. - Itai Benjamini; Igor Shinkar; Gilad Tsur (SIAM J. Discret. Math., 2014)

On Hardness of Approximating the Parameterized Clique Problem. - Subhash Khot; Igor Shinkar (Electron. Colloquium Comput. Complex., 2015)

On Percolation and NP-Hardness. - Daniel Reichman 001; Igor Shinkar (Electron. Colloquium Comput. Complex., 2015)

On Percolation and NP-Hardness. - Huck Bennett; Daniel Reichman 001; Igor Shinkar (ICALP, 2016)

A Graph-Theoretic Approach to Multitasking. - Jonathan D. Cohen 003; Biswadip Dey; Tom Griffiths 001; Sebastian Musslick; Kayhan Özcimder; Daniel Reichman 001; Igor Shinkar; Tal Wagner (CoRR, 2016)

An $ widetilde{O}(n)$ Queries Adaptive Tester for Unateness. - Subhash Khot; Igor Shinkar (CoRR, 2016)

On Coloring Random Subgraphs of a Fixed Graph. - Igor Shinkar (CoRR, 2016)

An Õ(n) Queries Adaptive Tester for Unateness. - Subhash Khot; Igor Shinkar (Electron. Colloquium Comput. Complex., 2016)

A Tight Upper Bound on Acquaintance Time of Graphs. - Omer Angel; Igor Shinkar (Graphs Comb., 2016)

Two-sided error proximity oblivious testing. - Oded Goldreich 001; Igor Shinkar (Random Struct. Algorithms, 2016)

A graph-theoretic approach to multitasking. - Noga Alon; Daniel Reichman 001; Igor Shinkar; Tal Wagner; Sebastian Musslick; Jonathan D. Cohen 003; Tom Griffiths 001; Biswadip Dey; Kayhan Özcimder (NIPS, 2017)

Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem. - Alexander Golovnev; Daniel Reichman 001; Igor Shinkar (CoRR, 2017)

On Axis-Parallel Tests for Tensor Product Codes. - Alessandro Chiesa; Peter Manohar; Igor Shinkar (Electron. Colloquium Comput. Complex., 2017)

Direct Sum Testing. - Roee David; Irit Dinur; Elazar Goldenberg; Guy Kindler; Igor Shinkar (SIAM J. Comput., 2017)

On Lipschitz Bijections Between Boolean Functions. - Shravas Rao; Igor Shinkar (Comb. Probab. Comput., 2018)

Testing Linearity against Non-Signaling Strategies. - Alessandro Chiesa; Peter Manohar; Igor Shinkar (Electron. Colloquium Comput. Complex., 2018)

Probabilistic Checking against Non-Signaling Strategies from Linearity Testing. - Alessandro Chiesa; Peter Manohar; Igor Shinkar (Electron. Colloquium Comput. Complex., 2018)

An Entropy Lower Bound for Non-Malleable Extractors. - Tom Gur; Igor Shinkar (Electron. Colloquium Comput. Complex., 2018)

String Matching: Communication, Circuits, and Learning. - Alexander Golovnev; Mika Göös; Daniel Reichman 001; Igor Shinkar (APPROX-RANDOM, 2019)

Sorting Networks on Restricted Topologies. - Indranil Banerjee; Dana Richards; Igor Shinkar (SOFSEM, 2019)

On Local Testability in the Non-Signaling Setting. - Alessandro Chiesa; Peter Manohar; Igor Shinkar (Electron. Colloquium Comput. Complex., 2019)

On percolation and -hardness. - Huck Bennett; Daniel Reichman 001; Igor Shinkar (Random Struct. Algorithms, 2019)

Relaxed Locally Correctable Codes with Improved Parameters. - Vahid R. Asadi; Igor Shinkar (Electron. Colloquium Comput. Complex., 2020)

Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality. - Mohammad Mahdi Jahanara; Sajin Koroth; Igor Shinkar (Electron. Colloquium Comput. Complex., 2020)

Multitasking Capacity: Hardness Results and Improved Constructions. - Noga Alon; Jonathan D. Cohen 003; Thomas L. Griffiths 001; Pasin Manurangsi; Daniel Reichman 001; Igor Shinkar; Tal Wagner; Alexander Y. Ku (SIAM J. Discret. Math., 2020)

Worst-Case to Average-Case Reductions via Additive Combinatorics. - Vahid R. Asadi; Alexander Golovnev; Tom Gur; Igor Shinkar (Electron. Colloquium Comput. Complex., 2022)

Quantum Worst-Case to Average-Case Reductions for All Linear Problems. - Vahid R. Asadi; Alexander Golovnev; Tom Gur; Igor Shinkar; Sathyawageeswar Subramanian (Electron. Colloquium Comput. Complex., 2022)

Meyniel Extremal Families of Abelian Cayley Graphs. - Fatemeh Hasiri; Igor Shinkar (Graphs Comb., 2022)

Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity. - Alessandro Chiesa; Tom Gur; Igor Shinkar (SIAM J. Comput., 2022)

Derandomization of Cell Sampling. - Alexander Golovnev; Tom Gur; Igor Shinkar (SOSA, 2023)

On mappings on the hypercube with small average stretch. - Lucas Boczkowski; Igor Shinkar (Comb. Probab. Comput., 2023)

Matrix Multiplication Reductions. - Ashish Gola; Igor Shinkar; Harsimran Singh (APPROX/RANDOM, 2024)

On the Power of Interactive Proofs for Learning. - Tom Gur; Mohammad Mahdi Jahanara; Mohammad Mahdi Khodabandeh; Ninad Rajgopal; Bahar Salamatian; Igor Shinkar (STOC, 2024)

Erratum: Multitasking Capacity: Hardness Results and Improved Constructions. - Noga Alon; Jonathan D. Cohen 003; Thomas L. Griffiths 001; Pasin Manurangsi; Daniel Reichman 001; Igor Shinkar; Tal Wagner (SIAM J. Discret. Math., 2024)