Igor Shinkar

Available identifiers

zbMath Open shinkar.igorMaRDI QIDQ287780

List of research outcomes

Publication	Date of Publication	Type
Quantum worst-case to average-case reductions for all linear problems	2024-11-28	Paper
Erratum to: ``Multitasking capacity: hardness results and improved constructions	2024-07-16	Paper
Derandomization of cell sampling	2024-05-14	Paper
Worst-case to average-case reductions via additive combinatorics	2023-12-08	Paper
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity	2023-04-04	Paper
On mappings on the hypercube with small average stretch	2023-04-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875720	2023-02-03	Paper
String Matching: Communication, Circuits, and Learning.	2023-02-03	Paper
Testing linearity against non-signaling strategies	2022-12-05	Paper
Probabilistic checking against non-signaling strategies from linearity testing	2022-07-18	Paper
Meyniel extremal families of abelian Cayley graphs	2022-03-21	Paper
On axis-parallel tests for tensor product codes	2021-07-28	Paper
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity	2021-02-02	Paper
On axis-parallel tests for tensor product codes	2020-12-17	Paper
Sorting networks on restricted topologies	2020-10-22	Paper
An Entropy Lower Bound for Non-Malleable Extractors	2020-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q5121905	2020-09-22	Paper
Multitasking capacity: hardness results and improved constructions	2020-03-26	Paper
On Mappings on the Hypercube with Small Average Stretch	2019-05-27	Paper
On percolation and \(\mathcal{NP}\)-hardness	2019-05-02	Paper
On Lipschitz bijections between Boolean functions	2018-04-23	Paper
An \(\widetilde O(n)\) queries adaptive tester for unateness	2018-04-19	Paper
On percolation and NP-hardness	2017-12-19	Paper
Direct sum testing	2017-08-16	Paper
Direct sum testing (extended abstract)	2017-05-19	Paper
On Coloring Random Subgraphs of a Fixed Graph	2016-12-13	Paper
A tight upper bound on acquaintance time of graphs	2016-11-29	Paper
Excited random walk with periodic cookies	2016-10-26	Paper
Bi-Lipschitz bijection between the Boolean cube and the Hamming ball	2016-07-25	Paper
A counterexample to monotonicity of relative mass in random walks	2016-05-23	Paper
On hardness of approximating the parameterized clique problem	2016-04-15	Paper
The complexity of DNF of parities	2016-04-15	Paper
Two-sided error proximity oblivious testing	2016-03-22	Paper
Zero-fixing extractors for sub-logarithmic entropy	2015-10-27	Paper
A note on subspace evasive sets	2015-02-09	Paper
Acquaintance time of a graph	2014-09-26	Paper
Greedy Random Walk	2014-04-16	Paper
Two-sided error proximity oblivious testing (extended abstract)	2012-11-02	Paper
On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors	2010-09-10	Paper

Research outcomes over time

This page was built for person: Igor Shinkar