• Publications
  • Influence
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
TLDR
We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Expand
  • 2,043
  • 109
  • PDF
The smallest grammar problem
This paper addresses the smallest grammar problem: What is the smallest context-free grammar that generates exactly one given string /spl sigma/? This is a natural question about a fundamental objectExpand
  • 340
  • 53
  • PDF
Complexity classification of network information flow problems
TLDR
We address the network information flow problem, in which messages available to a set of sources must be passed through a network to another set of sinks with specified demands. Expand
  • 253
  • 21
Monotonicity testing over general poset domains
TLDR
We show that in its most general setting, testing that Boolean functions are close to monotone is equivalent, with respect to the number of required queries, to several other testing problems in logic and graph theory. Expand
  • 191
  • 16
  • PDF
Approximation algorithms for grammar-based compression
TLDR
Several recently-proposed data compression algorithms are based on the idea of representing a string by a context-free grammar. Expand
  • 103
  • 10
  • PDF
ERASER: A Benchmark to Evaluate Rationalized NLP Models
TLDR
We propose the Evaluating Rationales And Simple English Reasoning (ERASER) benchmark to advance research on interpretable models in NLP that reveal the `reasoning' behind model outputs. Expand
  • 38
  • 10
  • PDF
Testing Monotonicity
TLDR
We present a randomized algorithm for testing the monotonicity property whose query complexity and running time are linear in n. Expand
  • 208
  • 8
  • PDF
Inferring Which Medical Treatments Work from Reports of Clinical Trials
How do we know if a particular medical treatment actually works? Ideally one would consult all available evidence from relevant clinical trials. Unfortunately, such results are primarily disseminatedExpand
  • 24
  • 5
  • PDF
Improved Testing Algorithms for Monotonicity
We present improved algorithms for testing monotonicity of functions. Namely, given the ability to query an unknown function f: Σ n ↦ Ξ, where Σ and Ξ are finite ordered sets, the test always acceptsExpand
  • 159
  • 4
  • PDF
Logic decomposition during technology mapping
TLDR
We propose a procedure which performs logic decomposition and technology mapping simultaneously, while the run time is logarithmic in the number of decompositions. Expand
  • 62
  • 4
  • PDF