Travelled to:1 × Australia
1 × Austria
1 × Finland
1 × Iceland
2 × France
2 × Greece
2 × Italy
7 × USA
Collaborated with:∅ V.Vassilevska R.Yuster J.Blocki I.Koutis A.Meyerson B.Kimelfeld J.Vondrák G.E.Blelloch D.V.Gucht D.P.Woodruff Q.Zhang
Talks about:complex (5) problem (4) graph (4) algorithm (3) weight (3) applic (3) lower (3) bound (3) find (3) new (3)
Person: Ryan Williams
DBLP: Williams:Ryan
Contributed to:
2015
2014
201420132011
2011
20102010200920092008200720062006200420042003Wrote 18 papers:
- PODS-2015-GuchtWWZ #communication #complexity #distributed #matrix #multi
- The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication (DVG, RW, DPW, QZ), pp. 199–212.
- LICS-CSL-2014-Williams #first-order #graph #performance
- Faster decision of first-order graph properties (RW), p. 6.
- STOC-2014-Williams #algorithm #bound #linear
- New algorithms and lower bounds for circuits with linear threshold gates (RW), pp. 194–202.
- STOC-2014-Williams14a #complexity #performance
- Faster all-pairs shortest paths via circuit complexity (RW), pp. 664–673.
- STOC-2013-Williams #proving
- Natural proofs versus derandomization (RW), pp. 21–30.
- PODS-2011-KimelfeldVW
- Maximizing conjunctive views in deletion propagation (BK, JV, RW), pp. 187–198.
- SAT-2011-Williams #algorithm #bound #complexity #satisfiability
- Connecting SAT Algorithms and Complexity Lower Bounds (RW), pp. 1–2.
- ICALP-v2-2010-BlockiW #complexity #privacy #problem
- Resolving the Complexity of Some Data Privacy Problems (JB, RW), pp. 393–404.
- STOC-2010-Williams #bound
- Improving exhaustive search implies superpolynomial lower bounds (RW), pp. 231–240.
- ICALP-v1-2009-KoutisW #algebra #problem
- Limits and Applications of Group Algebras for Parameterized Problems (IK, RW), pp. 653–664.
- STOC-2009-VassilevskaW
- Finding, minimizing, and counting weighted subgraphs (VV, RW), pp. 455–464.
- ICALP-A-2008-BlellochVW #approach #combinator #graph #problem
- A New Combinatorial Approach for Sparse Graph Problems (GEB, VV, RW), pp. 108–120.
- STOC-2007-VassilevskaWY #graph
- All-pairs bottleneck paths for general graphs in truly sub-cubic time (VV, RW, RY), pp. 585–589.
- ICALP-v1-2006-VassilevskaWY #graph #problem
- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (VV, RW, RY), pp. 262–273.
- STOC-2006-VassilevskaW #3d
- Finding a maximum weight triangle in n3-Delta time, with applications (VV, RW), pp. 225–231.
- ICALP-2004-Williams #algorithm #constraints
- A New Algorithm for Optimal Constraint Satisfaction and Its Implications (RW), pp. 1227–1237.
- PODS-2004-MeyersonW #complexity #on the
- On the Complexity of Optimal K-Anonymity (AM, RW), pp. 223–228.
- SAT-2003-Williams #on the
- On Computing k-CNF Formula Properties (RW), pp. 330–340.