5 citations · 6 across the 2 of their papers we have counts for
5 papers
Relaxed Locally Correctable Codes with Improved Parameters
Vahid R. Asadi, Igor Shinkar
Locally decodable codes (LDCs) are error-correcting codes that admit a local decoding algorithm that recovers each individual bit of the message by querying only…
Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality
Mohammad Mahdi Jahanara, Sajin Koroth, Igor Shinkar
Non-signaling strategies are a generalization of quantum strategies that have been studied in physics over the past three decades. Recently, they have found applications in theoret…
Meyniel Extremal Families of Abelian Cayley Graphs
Fatemeh Hasiri, Igor Shinkar
We study the game of Cops and Robbers, where cops try to capture a robber on the vertices of a graph. Meyniel's conjecture states that for every connected graph on vertices…
Multitasking Capacity: Hardness Results and Improved Constructions
Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths +5
We consider the problem of determining the maximal such that every matching of size (or at most ) in a bipartite graph contains an induced matching of s…
An Entropy Lower Bound for Non-Malleable Extractors
Tom Gur, Igor Shinkar
A -non-malleable extractor is a function that takes two inputs, a weak source of min-entr…