Ryan Williams

R. Ryan Williams

Carnegie Mellon University

other persons with the same name:

• Ryan Williams

	2009
29		Scott Diehl, Dieter van Melkebeek, Ryan Williams: An Improved Time-Space Lower Bound for Tautologies. COCOON 2009: 429-438
28		Ioannis Koutis, Ryan Williams: Limits and Applications of Group Algebras for Parameterized Problems. ICALP (1) 2009: 653-664
27		Virginia Vassilevska, Ryan Williams: Finding, minimizing, and counting weighted subgraphs. STOC 2009: 455-464
26		Ryan Williams: Finding paths of length k in O*(2k) time. Inf. Process. Lett. 109(6): 315-318 (2009)
	2008
25		Guy E. Blelloch, Virginia Vassilevska, Ryan Williams: A New Combinatorial Approach for Sparse Graph Problems. ICALP (1) 2008: 108-120
24		Ryan Williams: Maximum Two-Satisfiability. Encyclopedia of Algorithms 2008
23		Ryan Williams: Finding paths of length k in O*(2^k) time CoRR abs/0807.3026: (2008)
22		Ryan Williams: Applying Practice to Theory CoRR abs/0811.1305: (2008)
21		R. Ryan Williams: Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. Computational Complexity 17(2): 179-219 (2008)
20		Ryan Williams: Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas. Electronic Colloquium on Computational Complexity (ECCC) 15(076): (2008)
19		Ryan Williams: Applying practice to theory. SIGACT News 39(4): 37-52 (2008)
	2007
18		Ryan Williams: Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. IEEE Conference on Computational Complexity 2007: 70-82
17		Ryan Williams: Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). SODA 2007: 995-1001
16		Virginia Vassilevska, Ryan Williams, Raphael Yuster: All-pairs bottleneck paths for general graphs in truly sub-cubic time. STOC 2007: 585-589
15		Ryan Williams: Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. Electronic Colloquium on Computational Complexity (ECCC) 14(036): (2007)
	2006
14		Virginia Vassilevska, Ryan Williams, Raphael Yuster: Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. ICALP (1) 2006: 262-273
13		Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo: Confronting hardness using a hybrid approach. SODA 2006: 1-10
12		Virginia Vassilevska, Ryan Williams: Finding a maximum weight triangle in n3-Delta time, with applications. STOC 2006: 225-231
11		Virginia Vassilevska, Ryan Williams, Raphael Yuster: Finding heaviest H-subgraphs in real weighted graphs, with applications CoRR abs/cs/0609009: (2006)
10		Ryan Williams: Inductive Time-Space Lower Bounds for Sat and Related Problems. Computational Complexity 15(4): 433-470 (2006)
	2005
9		Ryan Williams: Better Time-Space Lower Bounds for SAT and Related Problems. IEEE Conference on Computational Complexity 2005: 40-49
8		Ryan Williams: Parallelizing time with polynomial circuits. SPAA 2005: 171-175
7		Ryan Williams: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348(2-3): 357-365 (2005)
	2004
6		Ryan Williams: A New Algorithm for Optimal Constraint Satisfaction and Its Implications. ICALP 2004: 1227-1237
5		Adam Meyerson, Ryan Williams: On the Complexity of Optimal K-Anonymity. PODS 2004: 223-228
4		Ryan Williams: A new algorithm for optimal constraint satisfaction and its implications Electronic Colloquium on Computational Complexity (ECCC)(032): (2004)
	2003
3		Ryan Williams, Carla P. Gomes, Bart Selman: Backdoors To Typical Case Complexity. IJCAI 2003: 1173-1178
2		Ryan Williams: On Computing k-CNF Formula Properties. SAT 2003: 330-340
	2002
1		Ryan Williams: Algorithms for quantified Boolean formulas. SODA 2002: 299-307

Coauthor Index

1	Guy E. Blelloch	[25]
2	Scott Diehl	[29]
3	Carla P. Gomes	[3]
4	Ioannis Koutis	[28]
5	Dieter van Melkebeek	[29]
6	Adam Meyerson	[5]
7	Bart Selman	[3]
8	Virginia Vassilevska	[11] [12] [13] [14] [16] [25] [27]
9	Shan Leung Maverick Woo	[13]
10	Raphael Yuster	[11] [14] [16]

Colors in the list of coauthors