dblp.uni-trier.dewww.uni-trier.de

Ryan Williams

R. Ryan Williams

Carnegie Mellon University

List of publications from the DBLP Bibliography Server - FAQ

other persons with the same name:


Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
24EEGuy E. Blelloch, Virginia Vassilevska, Ryan Williams: A New Combinatorial Approach for Sparse Graph Problems. ICALP (1) 2008: 108-120
23EERyan Williams: Maximum Two-Satisfiability. Encyclopedia of Algorithms 2008
22EERyan Williams: Finding paths of length k in O*(2^k) time CoRR abs/0807.3026: (2008)
21EERyan Williams: Applying Practice to Theory CoRR abs/0811.1305: (2008)
20EER. Ryan Williams: Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. Computational Complexity 17(2): 179-219 (2008)
19EERyan Williams: Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas. Electronic Colloquium on Computational Complexity (ECCC) 15(076): (2008)
2007
18EERyan Williams: Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. IEEE Conference on Computational Complexity 2007: 70-82
17EERyan Williams: Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). SODA 2007: 995-1001
16EEVirginia Vassilevska, Ryan Williams, Raphael Yuster: All-pairs bottleneck paths for general graphs in truly sub-cubic time. STOC 2007: 585-589
15EERyan Williams: Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. Electronic Colloquium on Computational Complexity (ECCC) 14(036): (2007)
2006
14EEVirginia Vassilevska, Ryan Williams, Raphael Yuster: Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. ICALP (1) 2006: 262-273
13EEVirginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo: Confronting hardness using a hybrid approach. SODA 2006: 1-10
12EEVirginia Vassilevska, Ryan Williams: Finding a maximum weight triangle in n3-Delta time, with applications. STOC 2006: 225-231
11EEVirginia Vassilevska, Ryan Williams, Raphael Yuster: Finding heaviest H-subgraphs in real weighted graphs, with applications CoRR abs/cs/0609009: (2006)
10EERyan Williams: Inductive Time-Space Lower Bounds for Sat and Related Problems. Computational Complexity 15(4): 433-470 (2006)
2005
9EERyan Williams: Better Time-Space Lower Bounds for SAT and Related Problems. IEEE Conference on Computational Complexity 2005: 40-49
8EERyan Williams: Parallelizing time with polynomial circuits. SPAA 2005: 171-175
7EERyan Williams: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348(2-3): 357-365 (2005)
2004
6EERyan Williams: A New Algorithm for Optimal Constraint Satisfaction and Its Implications. ICALP 2004: 1227-1237
5EEAdam Meyerson, Ryan Williams: On the Complexity of Optimal K-Anonymity. PODS 2004: 223-228
4EERyan 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
2EERyan Williams: On Computing k-CNF Formula Properties. SAT 2003: 330-340
2002
1EERyan Williams: Algorithms for quantified Boolean formulas. SODA 2002: 299-307

Coauthor Index

1Guy E. Blelloch [24]
2Carla P. Gomes [3]
3Adam Meyerson [5]
4Bart Selman [3]
5Virginia Vassilevska [11] [12] [13] [14] [16] [24]
6Shan Leung Maverick Woo [13]
7Raphael Yuster [11] [14] [16]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)