Rogers Epstein

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Violator Spaces: Structure and Algorithms 2006 Bernd Gärtner
Jiřı́ Matoušek
Leo Rüst
Petr Škovroň
1
+ Constructing Near Spanning Trees with Few Local Inspections 2015 Reut Levi
Guy Moshkovitz
Dana Ron
Ronitt Rubinfeld
A. Shapira
1
+ Graph Sparsification via Refinement Sampling 2010 Ashish Goel
Michael Kapralov
Sanjeev Khanna
1
+ PDF Chat Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs 2015 András A. Benczúr
David R. Karger
1
+ A Linear-time Algorithm for Sparsification of Unweighted Graphs 2010 Ramesh Hariharan
Debmalya Panigrahi
1
+ PDF Chat Graph Sparsification by Effective Resistances 2011 Daniel A. Spielman
Nikhil Srivastava
1
+ Linear fractional transformations in rings and modules 1984 N. J. Young
1
+ PDF Chat How to construct random functions 1986 Oded Goldreich
Shafi Goldwasser
Silvio Micali
1
+ PDF Chat Testing Assignments to Constraint Satisfaction Problems 2016 Hubie Chen
Matthew Valeriote
Yuichi Yoshida
1
+ A Local Algorithm for the Sparse Spanning Graph Problem 2017 Christoph Lenzen
Reut Levi
1
+ Local-access generators for basic random graph models 2017 Amartya Shankha Biswas
Ronitt Rubinfeld
Anak Yodpinyanee
1
+ Local Computation Algorithms for Spanners 2019 Merav Parter
Ronitt Rubinfeld
Ali Vakilian
Anak Yodpinyanee
1
+ Clarksons Algorithm for Violator Spaces 2009 Yves Brise
Bernd Gärtner
1
+ Minimization for Generalized Boolean Formulas 2011 Edith Hemaspaandra
Henning Schnoor
1
+ A Local Algorithm for Constructing Spanners in Minor-Free Graphs 2016 Reut Levi
Dana Ron
Ronitt Rubinfeld
1
+ PDF Chat A General Framework for Graph Sparsification 2019 Wai-Shing Fung
Ramesh Hariharan
Nicholas J. A. Harvey
Debmalya Panigrahi
1