Igor Shinkar - Citegraph

Author Info

Name	Affiliation	Papers
IGOR SHINKAR	Weizmann Inst Sci, Dept Math, IL-76100 Rehovot, Israel	24
Collaborators	Citations	PageRank
30	24	8.97
Referers	Referees	References
51	172	97

Search Limit

100172

Publications (24 rows)

Collaborators (30 rows)

Referers (51 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity.	0	0.34	2020
Testing Linearity against Non-signaling Strategies	0	0.34	2020
On Local Testability in the Non-Signaling Setting.	0	0.34	2019
On Mappings on the Hypercube with Small Average Stretch.	0	0.34	2019
Probabilistic Checking against Non-Signaling Strategies from Linearity Testing.	0	0.34	2019
MULTITASKING CAPACITY: HARDNESS RESULTS AND IMPROVED CONSTRUCTIONS	0	0.34	2018
An Entropy Lower Bound for Non-Malleable Extractors	2	0.36	2018
Testing Linearity against Non-Signaling Strategies.	0	0.34	2018
Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem.	0	0.34	2017
On Axis-Parallel Tests for Tensor Product Codes	0	0.34	2017
A graph-theoretic approach to multitasking.	1	0.36	2017
An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness.	0	0.34	2016
On Coloring Random Subgraphs of a Fixed Graph.	0	0.34	2016
On Percolation and NP-Hardness.	0	0.34	2016
An ~O(n) Queries Adaptive Tester for Unateness.	2	0.39	2016
On Percolation and NP-Hardness.	0	0.34	2015
A Note on Subspace Evasive Sets.	0	0.34	2014
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball	0	0.34	2014
Greedy Random Walk	0	0.34	2014
Acquaintance Time of a Graph.	5	0.61	2013
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors	6	0.48	2013
A Tight Upper Bound on Acquaintance Time of Graphs.	3	0.57	2013
Two-Sided Error Proximity Oblivious Testing - (Extended Abstract).	2	0.37	2012
Two-Sided Error Proximity Oblivious Testing.	3	0.41	2012