38:
962:
206:
1089:
210:
1012:
647:
1028:
1002:
942:
158:
1064:
324:
202:
640:
601:
412:
186:
1084:
514:, and Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) San Diego, California, June 13-March 16,
1079:
290:
1038:
519:
511:
1094:
633:
185:. From Fall 2011 to Fall 2016, he was a professor at Stanford University. In January 2017, he joined the faculty at
198:
990:
142:
88:
275:
Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on
Principles of Database Systems (PODS '04)
232:
has called the result "one of the most spectacular of the decade". In 2024, for this work
Williams was awarded
20:
506:
Proceedings of 20th Annual IEEE Conference on
Computational Complexity (CCC'05) San Jose, CA June 11-June 15,
471:
255:
806:
228:
received the best paper award at the
Conference on Computational Complexity in 2011. Complexity theorist
182:
106:
174:
102:
71:
395:
700:
201:
in 2011 and various other conferences. He won the Ron V. Book best student paper award at the IEEE
786:
1069:
902:
390:
886:
567:
764:
1074:
1042:
162:
532:
8:
928:
606:
110:
848:
418:
366:
296:
166:
67:
322:(2005), "A New Algorithm for Optimal 2-Constraint Satisfaction and Its Implications",
898:
814:
710:
668:
515:
507:
408:
286:
966:
834:
756:
672:
422:
400:
370:
358:
333:
300:
278:
117:
37:
1034:
952:
906:
862:
802:
796:
684:
1006:
892:
690:
976:
956:
858:
768:
738:
726:
716:
610:
558:
229:
656:
381:
362:
338:
233:
1058:
984:
972:
882:
876:
868:
852:
828:
780:
748:
742:
696:
676:
467:
349:(2008), "Time-Space Lower Bounds for Counting NP Solutions Modulo Integers",
910:
282:
980:
938:
932:
872:
842:
838:
824:
772:
760:
680:
562:
1024:
792:
776:
752:
720:
706:
444:
240:
178:
122:
625:
404:
1016:
996:
918:
914:
810:
732:
310:(2005), "Better Time-Space Lower Bounds for SAT and Related Problems",
146:
92:
615:
546:
141:(born 1979), is an American theoretical computer scientist working in
946:
924:
820:
483:
269:
Meyerson, Adam; Williams, Ryan (2004), "On the complexity of optimal
597:
218:
1020:
535:. European Association for Theoretical Computer Science (EATCS).
207:
International
Colloquium on Automata, Languages and Programming
563:"State of circuit lower bounds now slightly less humiliating"
205:
in 2005 and 2007, and at the best student paper award at the
239:
Williams has also worked on the computational complexity of
197:
Williams has been a member of the program committee for the
181:. From 2010 to 2012, he was a member of the Theory Group of
619:
575:
224:
170:
211:
484:"Ryan Williams | MIT CSAIL Theory of Computation"
383:IEEE Conference on Computational Complexity (CCC)
312:IEEE Conference on Computational Complexity (CCC)
1056:
581:
380:(2011), "Non-Uniform ACC Circuit Lower Bounds",
268:
1090:Massachusetts Institute of Technology faculty
641:
277:, New York, NY, USA: ACM, pp. 223–228,
216:Williams’s result that the complexity class
648:
634:
36:
19:For other people named Ryan Williams, see
655:
394:
337:
258:, also a theoretical computer scientist.
159:Alabama School of Mathematics and Science
557:
376:
345:
318:
306:
261:
1057:
203:Conference on Computational Complexity
629:
547:http://computationalcomplexity.org/
13:
165:in math and computer science from
14:
1106:
591:
173:in computer science in 2007 from
249:
199:Symposium on Theory of Computing
1065:Theoretical computer scientists
143:computational complexity theory
89:Computational complexity theory
582:Meyerson & Williams (2004)
551:
539:
525:
500:
476:
461:
437:
21:Ryan Williams (disambiguation)
1:
472:Mathematics Genealogy Project
430:
256:Virginia Vassilevska Williams
325:Theoretical Computer Science
157:Williams graduated from the
152:
7:
1085:Stanford University faculty
192:
183:IBM Almaden Research Center
107:IBM Almaden Research Center
51:1979 (age 44–45)
10:
1111:
533:"Best Student ICALP Paper"
175:Carnegie Mellon University
103:Carnegie Mellon University
72:Carnegie Mellon University
18:
1080:Cornell University alumni
664:
363:10.1007/s00037-008-0248-y
339:10.1016/j.tcs.2005.09.023
177:under the supervision of
128:
116:
98:
84:
77:
63:
55:
47:
35:
28:
609:publications indexed by
351:Computational Complexity
42:Williams (November 2010)
598:Ryan William’s homepage
545:Program for CCC2011 at
283:10.1145/1055558.1055591
1095:Gödel Prize laureates
568:MIT Technology Review
262:Selected publications
161:before receiving his
135:Richard Ryan Williams
561:(November 8, 2010),
389:, pp. 115–125,
222:is not contained in
622:Bibliography Server
405:10.1109/CCC.2011.36
254:Ryan is married to
111:Stanford University
167:Cornell University
68:Cornell University
16:Computer scientist
1052:
1051:
488:toc.csail.mit.edu
414:978-1-4577-0179-5
209:in 2004 from the
163:bachelor's degree
132:
131:
79:Scientific career
1102:
650:
643:
636:
627:
626:
585:
579:
573:
571:
555:
549:
543:
537:
536:
529:
523:
504:
498:
497:
495:
494:
480:
474:
465:
459:
458:
457:
456:
451:
446:Curriculum vitae
441:
425:
398:
388:
373:
342:
341:
332:(2–3): 357–365,
315:
314:, pp. 40–49
303:
169:in 2001 and his
118:Doctoral advisor
40:
26:
25:
1110:
1109:
1105:
1104:
1103:
1101:
1100:
1099:
1055:
1054:
1053:
1048:
660:
654:
594:
589:
588:
580:
576:
559:Aaronson, Scott
556:
552:
544:
540:
531:
530:
526:
505:
501:
492:
490:
482:
481:
477:
466:
462:
454:
452:
449:
443:
442:
438:
433:
428:
415:
396:10.1.1.225.8935
386:
293:
264:
252:
195:
155:
109:
105:
70:
64:Alma mater
43:
31:
24:
17:
12:
11:
5:
1108:
1098:
1097:
1092:
1087:
1082:
1077:
1072:
1067:
1050:
1049:
1047:
1046:
1043:Vaikuntanathan
1032:
1010:
1000:
994:
988:
970:
960:
950:
936:
922:
896:
890:
880:
866:
856:
846:
832:
818:
800:
790:
784:
746:
736:
730:
724:
714:
704:
694:
688:
665:
662:
661:
653:
652:
645:
638:
630:
624:
623:
613:
611:Google Scholar
604:
593:
592:External links
590:
587:
586:
574:
550:
538:
524:
499:
475:
460:
435:
434:
432:
429:
427:
426:
413:
374:
357:(2): 179–219,
343:
316:
304:
292:978-1581138580
291:
265:
263:
260:
251:
248:
230:Scott Aaronson
194:
191:
154:
151:
130:
129:
126:
125:
120:
114:
113:
100:
96:
95:
86:
82:
81:
75:
74:
65:
61:
60:
57:
53:
52:
49:
45:
44:
41:
33:
32:
29:
15:
9:
6:
4:
3:
2:
1107:
1096:
1093:
1091:
1088:
1086:
1083:
1081:
1078:
1076:
1073:
1071:
1070:Living people
1068:
1066:
1063:
1062:
1060:
1044:
1040:
1036:
1033:
1030:
1026:
1022:
1018:
1014:
1011:
1008:
1004:
1001:
998:
995:
992:
989:
986:
982:
978:
974:
971:
968:
964:
961:
958:
954:
951:
948:
944:
940:
937:
934:
930:
926:
923:
920:
916:
912:
908:
904:
903:Papadimitriou
900:
897:
894:
891:
888:
884:
881:
878:
874:
870:
867:
864:
860:
857:
854:
850:
847:
844:
840:
836:
833:
830:
826:
822:
819:
816:
812:
808:
804:
801:
798:
794:
791:
788:
785:
782:
778:
774:
770:
766:
762:
758:
754:
750:
747:
744:
740:
737:
734:
731:
728:
725:
722:
718:
715:
712:
708:
705:
702:
698:
695:
692:
689:
686:
682:
678:
674:
670:
667:
666:
663:
658:
651:
646:
644:
639:
637:
632:
631:
628:
621:
617:
616:Ryan Williams
614:
612:
608:
607:Ryan Williams
605:
603:
599:
596:
595:
583:
578:
570:
569:
564:
560:
554:
548:
542:
534:
528:
521:
520:0-7695-2780-9
517:
513:
512:0-7695-2364-1
509:
503:
489:
485:
479:
473:
469:
468:Ryan Williams
464:
448:
447:
440:
436:
424:
420:
416:
410:
406:
402:
397:
392:
385:
384:
379:
375:
372:
368:
364:
360:
356:
352:
348:
344:
340:
335:
331:
327:
326:
321:
317:
313:
309:
305:
302:
298:
294:
288:
284:
280:
276:
273:-anonymity",
272:
267:
266:
259:
257:
250:Personal life
247:
245:
243:
237:
235:
231:
227:
226:
221:
220:
214:
212:
208:
204:
200:
190:
188:
184:
180:
176:
172:
168:
164:
160:
150:
148:
144:
140:
139:Ryan Williams
136:
127:
124:
121:
119:
115:
112:
108:
104:
101:
97:
94:
90:
87:
83:
80:
76:
73:
69:
66:
62:
58:
54:
50:
46:
39:
34:
30:Ryan Williams
27:
22:
701:Szelepcsényi
577:
566:
553:
541:
527:
502:
491:. Retrieved
487:
478:
463:
453:, retrieved
445:
439:
382:
378:Williams, R.
377:
354:
350:
347:Williams, R.
346:
329:
323:
320:Williams, R.
319:
311:
308:Williams, R.
307:
274:
270:
253:
241:
238:
223:
217:
215:
196:
156:
138:
134:
133:
99:Institutions
78:
1075:1979 births
907:Roughgarden
899:Koutsoupias
787:SĂ©nizergues
657:Gödel Prize
234:Gödel Prize
179:Manuel Blum
137:, known as
123:Manuel Blum
56:Nationality
1059:Categories
815:Zaharoglou
757:Goldwasser
673:Goldwasser
493:2021-12-18
455:2017-12-02
431:References
244:-anonymity
147:algorithms
93:Algorithms
1035:Brakerski
1007:G. Tardos
911:É. Tardos
877:Wigderson
659:laureates
391:CiteSeerX
153:Education
1029:Richerby
977:McSherry
953:Spielman
929:Franklin
887:Mitchell
869:Reingold
863:Spielman
849:Razborov
797:Schapire
711:Sinclair
697:Immerman
193:Research
59:American
1013:Bulatov
967:O'Hearn
963:Brookes
835:Agrawal
829:Szegedy
803:Herlihy
781:Szegedy
769:Motwani
717:Halpern
685:Rackoff
470:at the
423:7020039
371:8815358
301:6798963
1045:(2022)
1039:Gentry
1031:(2021)
1009:(2020)
999:(2019)
993:(2018)
987:(2017)
981:Nissim
969:(2016)
959:(2015)
949:(2014)
935:(2013)
921:(2012)
895:(2011)
893:HĂĄstad
889:(2010)
879:(2009)
873:Vadhan
865:(2008)
855:(2007)
853:Rudich
845:(2006)
843:Saxena
831:(2005)
825:Matias
817:(2004)
811:Shavit
799:(2003)
793:Freund
789:(2002)
783:(2001)
765:Lovász
745:(2000)
743:Wolper
735:(1999)
729:(1998)
723:(1997)
713:(1996)
707:Jerrum
703:(1995)
693:(1994)
691:HĂĄstad
687:(1993)
677:Micali
518:
510:
421:
411:
393:
369:
299:
289:
85:Fields
1003:Moser
997:Dinur
991:Regev
985:Smith
973:Dwork
943:Lotem
939:Fagin
925:Boneh
919:Ronen
915:Nisan
883:Arora
839:Kayal
777:Sudan
773:Safra
753:Feige
749:Arora
739:Vardi
721:Moses
681:Moran
669:Babai
450:(PDF)
419:S2CID
387:(PDF)
367:S2CID
297:S2CID
1025:Dyer
1021:Chen
957:Teng
947:Naor
933:Joux
859:Teng
821:Alon
807:Saks
761:Lund
733:Shor
727:Toda
620:DBLP
516:ISBN
508:ISBN
409:ISBN
287:ISBN
219:NEXP
171:Ph.D
145:and
48:Born
1017:Cai
618:at
602:MIT
600:at
401:doi
359:doi
334:doi
330:348
279:doi
225:ACC
187:MIT
1061::
1041:/
1037:/
1027:/
1023:/
1019:/
1015:/
1005:/
983:/
979:/
975:/
965:/
955:/
945:/
941:/
931:/
927:/
917:/
913:/
909:/
905:/
901:/
885:/
875:/
871:/
861:/
851:/
841:/
837:/
827:/
823:/
813:/
809:/
805:/
795:/
779:/
775:/
771:/
767:/
763:/
759:/
755:/
751:/
741:/
719:/
709:/
699:/
683:/
679:/
675:/
671:/
565:,
486:.
417:,
407:,
399:,
365:,
355:17
353:,
328:,
295:,
285:,
246:.
236:.
213:.
189:.
149:.
91:,
649:e
642:t
635:v
584:.
572:.
522:.
496:.
403::
361::
336::
281::
271:k
242:k
23:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
