Eylon Yogev - Citegraph

Author Info

Name	Affiliation	Papers
EYLON YOGEV	Weizmann Inst Sci, Dept Comp Sci & Appl Math, IL-76100 Rehovot, Israel	30
Collaborators	Citations	PageRank
27	54	11.30
Referers	Referees	References
147	401	355

Search Limit

100401

Publications (30 rows)

Collaborators (27 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A Framework for Adversarially Robust Streaming Algorithms	0	0.34	2022
A Framework for Adversarially Robust Streaming Algorithms	0	0.34	2021
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract	0	0.34	2020
A Framework for Adversarially Robust Streaming Algorithms	2	0.38	2020
Parallel Balanced Allocations: The Heavily Loaded Case.	1	0.35	2019
Secure Distributed Computing Made (Nearly) Optimal	0	0.34	2019
Optimal Short Cycle Decomposition in Almost Linear Time.	0	0.34	2019
Distributional Collision Resistance Beyond One-Way Functions.	0	0.34	2019
Distributed Algorithms Made Secure - A Graph Theoretic Approach.	0	0.34	2019
The Adversarial Robustness of Sampling	2	0.65	2019
CB2CF: a neural multiview content-to-collaborative filtering model for completely cold item recommendations	6	0.39	2019
Low Congestion Cycle Covers and their Applications.	0	0.34	2019
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing	0	0.34	2019
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions.	6	0.42	2018
The Power of Distributed Verifiers in Interactive Proofs.	1	0.35	2018
On Distributional Collision Resistant Hashing.	1	0.35	2018
Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation.	1	0.37	2018
Congested Clique Algorithms for Graph Spanners.	1	0.35	2018
Non-Interactive Multiparty Computation Without Correlated Randomness.	2	0.37	2017
The Journey from NP to TFNP Hardness.	1	0.35	2017
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.	4	0.39	2017
Distributed Computing Made Secure: A New Cycle Cover Theorem.	0	0.34	2017
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.	5	0.40	2016
How to Share a Secret, Infinitely.	1	0.37	2016
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.	7	0.42	2016
Tight Bounds for Sliding Bloom Filters	3	0.38	2015
Secret-Sharing for NP from Indistinguishability Obfuscation.	2	0.42	2014
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.	5	0.43	2014
Secret-Sharing for NP.	2	0.37	2014
Sliding Bloom Filters	1	0.41	2013