Citation Impact
Citing Papers
Practical Byzantine fault tolerance
1999 Standout
The backtracking survey propagation algorithm for solving random K-SAT problems
2016 StandoutNobel
USING CIRCUIT THEORY TO MODEL CONNECTIVITY IN ECOLOGY, EVOLUTION, AND CONSERVATION
2008 Standout
An information-based sequence distance and its application to whole mitochondrial genome phylogeny
2001 Standout
Software-Defined Networking: A Comprehensive Survey
2014 Standout
Theory and Practice of Bloom Filters for Distributed Systems
2011
Genome Rearrangements and Sorting by Reversals
1996
Improved decoding of Reed-Solomon and algebraic-geometry codes
1999 Standout
A threshold of ln n for approximating set cover
1998 Standout
A privacy threat analysis framework: supporting the elicitation and fulfillment of privacy requirements
2010 Standout
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
2006
Communication Complexity and Secure Function Evaluation
2001
Laplace eigenvalues of graphs—a survey
1992
A guided tour to approximate string matching
2001 Standout
Complex networks: Structure and dynamics
2006 Standout
Trains of Thought
2007
List Decoding of Error-Correcting Codes
2005
Probabilistic checking of proofs
1998
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
2011 Standout
Hierarchical Peer-to-Peer Networks Using Lightweight SuperPeer Topologies
2005
Bell nonlocality
2014 Standout
A Dynamic-Bayesian-Network-Based Fault Diagnosis Methodology Considering Transient and Intermittent Faults
2016 Standout
Watermarking, tamper-proofing, and obfuscation - tools for software protection
2002
The Nature of Computation
2011
A comparative study of cuckoo search and bat algorithm for Bloom filter optimisation in spam filtering
2012
The electrical resistance of a graph captures its commute and cover times
1996
Lunar–Solar Rhythmpatterns: Towards the Material Cultures of Tides
2011 Standout
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
2008 Standout
Intermittent Failures in Hardware and Software
2014
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation
2007 Standout
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
1995
A survey on security issues in service delivery models of cloud computing
2010 Standout
Transforming cabbage into turnip
1999 Standout
Data Streams: Algorithms and Applications
2005
Proof verification and the hardness of approximation problems
1998
Bat algorithm: literature review and applications
2013 Standout
Network Applications of Bloom Filters: A Survey
2004 Standout
Works of Ronitt Rubinfeld being referenced
Sublinear-time approximation of Euclidean minimum spanning tree
2003
The Bloomier filter: an efficient data structure for static support lookup tables
2004
Self-testing polynomial functions efficiently and over rational domains
1992
Robust Characterizations of Polynomials and Their Applications to Program Testing
1993
Sublinear Time Algorithms
2011
Robust Characterizations of Polynomials with Applications to Program Testing
1996
Reconstructing Algebraic Functions from Mixed Data
1998
The cover time of a regular expander is O(n log n)
1990
Batch checking with applications to linear functions
1992
Reversing trains: A turn of the century sorting problem
1989
Self-testing/correcting with applications to numerical problems
1993