#### Filter Results:

- Full text PDF available (61)

#### Publication Year

1995

2018

- This year (1)
- Last 5 years (38)
- Last 10 years (79)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Adam Meyerson, Ryan Williams
- PODS
- 2004

The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We prove that twoâ€¦ (More)

- Virginia Vassilevska Williams, Ryan Williams
- 2010 IEEE 51st Annual Symposium on Foundations ofâ€¦
- 2010

We say an algorithm on <i>n</i> Ã— <i>n</i> matrices with integer entries in [âˆ’<i>M</i>,<i>M</i>] (or <i>n</i>-node graphs with edge weights from [âˆ’<i>M</i>,<i>M</i>]) is <i>truly subcubic</i> if itâ€¦ (More)

- Ryan Williams, Carla P. Gomes, Bart Selman
- IJCAI
- 2003

There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can handle combinatorialâ€¦ (More)

- Mihai Patrascu, Ryan Williams
- SODA
- 2010

We describe reductions from the problem of determining the satisfiability of Boolean CNF formulas (CNF-SAT) to several natural algorithmic problems. We show that attaining any of the following boundsâ€¦ (More)

- Ryan Williams
- Inf. Process. Lett.
- 2009

The k-path problem is to determine if a given graph contains a simple path of length at least k, and if so, produce such a path. When k is given as a part of the input, the problem is wellknown to beâ€¦ (More)

- Ioannis Koutis, Ryan Williams
- ICALP
- 2009

The fastest known randomized algorithms for several parameterized problems use reductions to the k-MlD problem: detection of multilinear monomials of degree k in polynomials presented as circuits.â€¦ (More)

- Ryan Williams
- STOC
- 2014

We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two <i>n</i> Ã— <i>n</i> matrices, yielding a faster algorithm for solving the all-pairs shortestâ€¦ (More)

- Ryan Williams
- STOC
- 2010

The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We still do not know if even a slight algorithmic improvement overâ€¦ (More)

- Ryan Williams
- 2011 IEEE 26th Annual Conference on Computationalâ€¦
- 2011

The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MOD<sub>m</sub> gates, where <i>m</i> > 1 is an arbitrary constant. We prove the following.
â€¦ (More)

For a pattern graph H on k nodes, we consider the problems of finding and counting the number of (not necessarily induced) copies of H in a given large graph G on n nodes, as well as finding minimumâ€¦ (More)