Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(119)
Virginia Vassilevska Williams (Virginia Vassilevska)
8
Bart Selman
6
Carla P. Gomes
5
Dieter Van Melkebeek
4
Raphael Yuster
4
Conferences
(11)
CCC
5
ICALP
4
SODA
4
STOC
4
Theory and Applications of Satisfiability Testing
3
Journals
(13)
CORR
6
ECCC
3
IPL
2
Microelectronics Reliability
2
JCO
1
Keywords
(140)
Embed
Subscribe
Academic
Authors
Richard Ryan Williams
Edit
Richard Ryan Williams (Ryan Williams)
IBM
Publications: 73
|
Citations: 804
|
G-Index: 27
|
H-Index: 12
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Algorithms & Theory
,
Scientific Computing
,
Artificial Intelligence
View FAQ about top research area and research interests
Collaborated with
119 co-authors
from 1989 to 2011
; Cited by
989 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(73)
BibTeX
|
RIS
|
RefWorks
Download
Non-uniform ACC Circuit Lower Bounds
(
Citations: 6
)
Ryan Williams
Conference:
Annual IEEE Conference on Computational Complexity - CCC
, pp. 115-125, 2011
Limits on Alternation-Trading Proofs for Time-Space Lower Bounds
Sam Buss
,
Ryan Williams
Journal:
Electronic Colloquium on Computational Complexity - ECCC
, vol. 18, 2011
Parallelizing Time with Polynomial Circuits
Ryan Williams
Journal:
Theory of Computing Systems / Mathematical Systems Theory - MST
, vol. 48, no. 1, pp. 150-169, 2011
Improving exhaustive search implies superpolynomial lower bounds
(
Citations: 8
)
Ryan Williams
Conference:
ACM Symposium on Theory of Computing - STOC
, pp. 231-240, 2010
Resolving the Complexity of Some Data Privacy Problems
(
Citations: 5
)
Jeremiah Blocki
,
Ryan Williams
Conference:
International Colloquium on Automata, Languages and Programming - ICALP
, pp. 393-404, 2010
Order by:
Citations
(804 times by 649 publications)
Non-uniform ACC Circuit Lower Bounds
(
Citations: 6
)
Ryan Williams
Conference:
Annual IEEE Conference on Computational Complexity - CCC
, pp. 115-125, 2011
The k -anonymity and l -diversity approaches for privacy preservation in social networks against neighborhood attacks
(
Citations: 2
)
Bin Zhou
,
Jian Pei
Journal:
Knowledge and Information Systems - KAIS
, vol. 28, no. 1, pp. 47-77, 2011
Improved deterministic algorithms for weighted matching and packing problems
(
Citations: 1
)
Jianer Chen
,
Qilong Feng
,
Yang Liu
,
Songjian Lu
,
Jianxin Wang
Journal:
Theoretical Computer Science - TCS
, vol. 412, no. 23, pp. 2503-2512, 2011
Local and global recoding methods for anonymizing set-valued data
(
Citations: 2
)
Manolis Terrovitis
,
Nikos Mamoulis
,
Panos Kalnis
Journal:
The Vldb Journal - VLDB
, vol. 20, no. 1, pp. 83-106, 2011
k-Anonymization in the Presence of Publisher Preferences
Rinku Dewri
,
Indrajit Ray
,
Indrakshi Ray
,
Darrell Whitley
Journal:
IEEE Transactions on Knowledge and Data Engineering - TKDE
, vol. 23, no. 11, pp. 1678-1690, 2011
Comments