619:
632:
625:
728:
733:
199:. He joined the Toronto faculty in 1969 and was promoted to full professor in 1977. He served as department chair from 1980 to 1985, and became University Professor in 2011.
60:
698:
216:
406:. Elsevier Computer Science Library; Theory of Computation Series. Vol. 1. New York, London, Amsterdam: American Elsevier Publishing Co., Inc.
723:
713:
669:
501:
583:
482:
738:
743:
564:
748:
703:
433:
662:
220:
718:
708:
459:
184:
46:
655:
399:
538:
226:
83:
522:
301:
315:
274:
498:
230:
208:
549:
693:
310:
269:
212:
183:, earning a bachelor's degree in mathematics in 1963. After earning a master's degree at the
168:
93:
688:
411:
375:
332:
8:
580:
258:
Borodin, Allan (1972). "Computational complexity and the existence of complexity gaps".
643:
379:
287:
260:
192:
180:
164:
50:
42:
429:
188:
383:
561:
454:
363:
320:
291:
279:
234:
116:
587:
568:
505:
407:
371:
328:
240:
196:
159:
121:
65:
423:
345:
639:
682:
349:
618:
534:
631:
354:
341:
283:
449:
483:"Governor General Announces 114 New Appointments to the Order of Canada"
367:
299:
Borodin, Allan (1977). "On relating time and space to size and depth".
187:
in 1966 (while at the same time working part time as a programmer at
324:
729:
Fellows of the
American Association for the Advancement of Science
603:
136:
352:(1994). "On the power of randomization in on-line algorithms".
100:
404:
106:
Computational
Complexity and the Existence of Complexity Gaps
624:
237:, resource tradeoffs, and models of algorithmic paradigms."
550:
Allan
Borodin: Recipient of the 2008 CRM-Fields-PIMS Prize
339:
195:, completing a doctorate in 1969 under the supervision of
734:
2014 fellows of the
Association for Computing Machinery
418:
508:, U. Toronto Computer Science, retrieved 2012-03-17.
217:
638:This article about an American mathematician is a
680:
581:ACM Names Fellows for Innovations in Computing
663:
590:, ACM, January 8, 2015, retrieved 2015-01-08.
397:
699:Academic staff of the University of Toronto
425:Online Computation and Competitive Analysis
670:
656:
314:
273:
179:Borodin did his undergraduate studies at
246:
191:), he continued his graduate studies at
562:AAAS Members Elected as Fellows in 2011
477:
475:
298:
257:
207:Borodin was elected as a member of the
724:Fellows of the Royal Society of Canada
714:Stevens Institute of Technology alumni
681:
518:
516:
514:
612:
494:
492:
472:
202:
16:Canadian-American computer scientist
511:
221:Association for Computing Machinery
163:(born 1941) is a Canadian-American
13:
604:Home Page at University of Toronto
499:Borodin named University Professor
14:
760:
597:
489:
630:
623:
617:
739:Theoretical computer scientists
185:Stevens Institute of Technology
47:Stevens Institute of Technology
744:Members of the Order of Canada
574:
555:
543:
528:
428:. Cambridge University Press.
1:
539:Mathematics Genealogy Project
525:, PIMS, retrieved 2012-03-17.
465:
219:in 2011, and a fellow of the
749:American mathematician stubs
704:American computer scientists
642:. You can help Knowledge by
340:Ben-David, S.; Borodin, A.;
227:theoretical computer science
215:. He became a fellow of the
211:in 1991. In 2008 he won the
174:
84:Theoretical computer science
7:
443:
34:1941 (age 82–83)
10:
765:
611:
167:who is a professor at the
719:Cornell University alumni
709:Rutgers University alumni
567:January 13, 2012, at the
302:SIAM Journal on Computing
131:
127:
115:
99:
89:
79:
72:
56:
38:
30:
23:
460:Computational Complexity
239:In 2020 he received the
571:, retrieved 2012-03-17.
552:, retrieved 2012-03-17.
422:; El-Yaniv, R. (1998).
209:Royal Society of Canada
523:Past prizes and awards
225:"For contributions to
535:Allan Bertram Borodin
284:10.1145/321679.321691
247:Selected publications
213:CRM-Fields-PIMS prize
169:University of Toronto
156:Allan Bertram Borodin
94:University of Toronto
485:. 26 November 2020.
586:2015-01-09 at the
504:2011-09-13 at the
368:10.1007/BF01294260
261:Journal of the ACM
235:on-line algorithms
193:Cornell University
181:Rutgers University
165:computer scientist
51:Cornell University
43:Rutgers University
651:
650:
455:Online algorithms
435:978-0-521-56392-5
252:Research articles
203:Awards and honors
189:Bell Laboratories
153:
152:
74:Scientific career
756:
672:
665:
658:
634:
629:
628:
627:
621:
613:
591:
578:
572:
559:
553:
547:
541:
532:
526:
520:
509:
496:
487:
486:
479:
439:
415:
398:Borodin, Allan;
387:
336:
318:
295:
277:
162:
149:
146:
144:
142:
140:
138:
117:Doctoral advisor
111:
21:
20:
764:
763:
759:
758:
757:
755:
754:
753:
679:
678:
677:
676:
622:
616:
609:
600:
595:
594:
588:Wayback Machine
579:
575:
569:Wayback Machine
560:
556:
548:
544:
533:
529:
521:
512:
506:Wayback Machine
497:
490:
481:
480:
473:
468:
446:
436:
325:10.1137/0206054
316:10.1.1.394.1059
275:10.1.1.453.2374
249:
241:Order of Canada
205:
197:Juris Hartmanis
177:
158:
135:
122:Juris Hartmanis
109:
66:Order of Canada
64:
49:
45:
39:Alma mater
26:
17:
12:
11:
5:
762:
752:
751:
746:
741:
736:
731:
726:
721:
716:
711:
706:
701:
696:
691:
675:
674:
667:
660:
652:
649:
648:
635:
607:
606:
599:
598:External links
596:
593:
592:
573:
554:
542:
527:
510:
488:
470:
469:
467:
464:
463:
462:
457:
452:
445:
442:
441:
440:
434:
416:
394:
393:
389:
388:
337:
309:(4): 733–744.
296:
268:(1): 158–174.
254:
253:
248:
245:
204:
201:
176:
173:
151:
150:
133:
129:
128:
125:
124:
119:
113:
112:
103:
97:
96:
91:
87:
86:
81:
77:
76:
70:
69:
58:
54:
53:
40:
36:
35:
32:
28:
27:
24:
15:
9:
6:
4:
3:
2:
761:
750:
747:
745:
742:
740:
737:
735:
732:
730:
727:
725:
722:
720:
717:
715:
712:
710:
707:
705:
702:
700:
697:
695:
694:Living people
692:
690:
687:
686:
684:
673:
668:
666:
661:
659:
654:
653:
647:
645:
641:
636:
633:
626:
620:
615:
614:
610:
605:
602:
601:
589:
585:
582:
577:
570:
566:
563:
558:
551:
546:
540:
536:
531:
524:
519:
517:
515:
507:
503:
500:
495:
493:
484:
478:
476:
471:
461:
458:
456:
453:
451:
448:
447:
437:
431:
427:
426:
421:
417:
413:
409:
405:
401:
396:
395:
391:
390:
385:
381:
377:
373:
369:
365:
361:
357:
356:
351:
350:Wigderson, A.
347:
343:
338:
334:
330:
326:
322:
317:
312:
308:
304:
303:
297:
293:
289:
285:
281:
276:
271:
267:
263:
262:
256:
255:
251:
250:
244:
242:
238:
236:
232:
228:
222:
218:
214:
210:
200:
198:
194:
190:
186:
182:
172:
170:
166:
161:
157:
148:
134:
130:
126:
123:
120:
118:
114:
107:
104:
102:
98:
95:
92:
88:
85:
82:
78:
75:
71:
67:
62:
59:
55:
52:
48:
44:
41:
37:
33:
29:
25:Allan Borodin
22:
19:
644:expanding it
637:
608:
576:
557:
545:
530:
424:
419:
403:
359:
355:Algorithmica
353:
306:
300:
265:
259:
224:
206:
178:
155:
154:
105:
90:Institutions
73:
18:
689:1941 births
450:Gap theorem
420:Borodin, A.
362:(1): 2–14.
683:Categories
466:References
400:Munro, Ian
346:Tardos, G.
231:complexity
61:ACM Fellow
311:CiteSeerX
270:CiteSeerX
175:Biography
584:Archived
565:Archived
502:Archived
444:See also
402:(1975).
384:26771869
342:Karp, R.
223:in 2014
141:.toronto
537:at the
412:0468309
376:1247985
333:0461984
292:2387962
132:Website
432:
410:
382:
374:
331:
313:
290:
272:
110:(1969)
108:
101:Thesis
80:Fields
68:(2020)
63:(2014)
57:Awards
392:Books
380:S2CID
288:S2CID
145:/~bor
640:stub
430:ISBN
143:.edu
31:Born
364:doi
321:doi
280:doi
229:in
139:.cs
137:www
685::
513:^
491:^
474:^
408:MR
378:.
372:MR
370:.
360:11
358:.
348:;
344:;
329:MR
327:.
319:.
305:.
286:.
278:.
266:19
264:.
243:.
233:,
171:.
160:CM
671:e
664:t
657:v
646:.
438:.
414:.
386:.
366::
335:.
323::
307:6
294:.
282::
147:/
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.