• Publications
  • Influence
On the complexity of optimal K-anonymity
TLDR
We prove that two general versions of optimal k-anonymization of relations are NP-hard, including the suppression version which amounts to choosing a minimum number of entries to delete from the relation. Expand
  • 811
  • 63
  • PDF
Subcubic Equivalences between Path, Matrix and Triangle Problems
  • V. Williams, R. Williams
  • Mathematics, Computer Science
  • IEEE 51st Annual Symposium on Foundations of…
  • 23 October 2010
TLDR
We define a notion of sub cubic reducibility, and show that many important problems on graphs and matrices solvable in O(n^3) time are equivalent under sub cubic reductions. Expand
  • 305
  • 46
  • PDF
A new algorithm for optimal 2-constraint satisfaction and its implications
  • R. Williams
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 8 December 2005
TLDR
We present a novel method for exactly solving (in fact, counting solutions to) general constraint satisfaction optimization with at most two variables per constraint (e.g. MAX-2-SAT and MAX-CUT). Expand
  • 352
  • 35
  • PDF
Backdoors To Typical Case Complexity
TLDR
We propose a new framework for studying the complexity of reasoning and constraint processing methods on practical problem instances. Expand
  • 342
  • 33
  • PDF
Access to Affordable and Nutritious Food-Measuring and Understanding Food Deserts and Their Consequences: Report to Congress
The Food, Conservation, and Energy Act of 2008 directed the U.S. Department of Agriculture to conduct a 1-year study to assess the extent of areas with limited access to affordable and nutritiousExpand
  • 415
  • 33
  • PDF
Tournament Incentives, Firm Risk, and Corporate Policies
This paper tests the proposition that higher tournament incentives will result in greater risk-taking by senior managers in order to increase their chance of promotion to the rank of CEO. MeasuringExpand
  • 198
  • 28
  • PDF
On the possibility of faster SAT algorithms
TLDR
We describe reductions from the problem of determining the satisfiability of Boolean CNF formulas (CNF-SAT) to several natural algorithmic problems, where attaining any of the following bounds would improve the state of the art in algorithms for SAT. Expand
  • 211
  • 24
  • PDF
Finding paths of length k in O*(2k) time
  • R. Williams
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 18 July 2008
TLDR
We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O∗(2^[email protected]?poly(n)) time. Expand
  • 185
  • 22
  • PDF
Non-uniform ACC Circuit Lower Bounds
  • R. Williams
  • Mathematics, Computer Science
  • IEEE 26th Annual Conference on Computational…
  • 8 June 2011
TLDR
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MOD$m$ gates, where $m > 1$ is an arbitrary constant. Expand
  • 141
  • 19
  • PDF
Faster all-pairs shortest paths via circuit complexity
  • R. Williams
  • Computer Science, Mathematics
  • STOC
  • 23 December 2013
TLDR
We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two n × n matrices, yielding a faster algorithm for solving the all-pairs shortest path problem (APSP) in dense n-node directed graphs with arbitrary edge weights. Expand
  • 152
  • 17
  • PDF