Citation Impact
Citing Papers
Clique is hard to approximate within n1−ε
1999
Two-Prover Protocols---Low Error at Affordable Rates
2000
A threshold of ln n for approximating set cover
1998 Standout
Small-Bias Probability Spaces: Efficient Constructions and Applications
1993
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
2006
Randomness is Linear in Space
1996
CasADi: a software framework for nonlinear optimization and optimal control
2018 Standout
Visual cryptography
1995 Standout
Bell nonlocality
2014 Standout
Constant-time distributed dominating set approximation
2003
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
2005
HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
2004 Standout
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
2008 Standout
Entanglement detection
2009 Standout
PSPACE has constant-round quantum interactive proof systems
2003
Most Tensor Problems Are NP-Hard
2013 Standout
Works of John Rompel being referenced
Efficient NC algorithms for set cover with applications to learning and geometry
1994
Simulating (log c n )-wise independence in NC
1991
A better performance guarantee for approximate graph coloring
1990
On the power of multi-prover interactive protocols
1994