请输入您要查询的百科知识:

 

词条 Allan Borodin
释义

  1. Biography

  2. Awards and honors

  3. Selected publications

  4. See also

  5. References

  6. External links

{{pp|small=yes}}{{Infobox scientist
| name = Allan Borodin
| birth_date = {{birth year and age|1941}}
| workplaces = University of Toronto
| field = Theoretical computer science
| alma_mater = Rutgers University
Stevens Institute of Technology
Cornell University
| thesis_title = Computational Complexity and the Existence of Complexity Gaps
| thesis_year = 1969
| doctoral_advisor = Juris Hartmanis
| doctoral_students =
| awards = ACM Fellow (2014)
| website = {{URL|http://www.cs.toronto.edu/~bor/}}
}}Allan Bertram Borodin (born 1941) is a Canadian-American computer scientist who is a University Professor at the University of Toronto.[1][2]

Biography

Borodin did his undergraduate studies at Rutgers University, earning a bachelor's degree in mathematics in 1963. After earning a master's degree at the Stevens Institute of Technology in 1966 (while at the same time working P/T as a programmer at Bell Laboratories), he continued his graduate studies at Cornell University, completing a doctorate in 1969 under the supervision of Juris Hartmanis.

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.[1][2][3]

Awards and honors

Borodin was elected as a member of the Royal Society of Canada in 1991. In 2008 he won the CRM-Fields PIMS Prize.[2][4] He became a fellow of the American Association for the Advancement of Science in 2011,[5] and a fellow of the Association for Computing Machinery in 2014 "For contributions to theoretical computer science in complexity, on-line algorithms, resource tradeoffs, and models of algorithmic paradigms."[6]

Selected publications

Research articles
  • {{cite journal

| first=Allan|last=Borodin


|title=Computational complexity and the existence of complexity gaps
|journal=Journal of the ACM
|volume=19
|issue=1
|pages=158–174
|year=1972
|doi=10.1145/321679.321691
|citeseerx=10.1.1.453.2374
  • {{cite journal

| last = Borodin | first = Allan
| issue = 4
| journal = SIAM Journal on Computing
| mr = 0461984
| pages = 733–744
| title = On relating time and space to size and depth
| volume = 6
| year = 1977
| doi=10.1137/0206054| citeseerx = 10.1.1.394.1059
  • {{cite journal

| last1 = Ben-David | first1 = S.
| last2 = Borodin | first2 = A.
| last3 = Karp | first3 = R. | author3-link = Richard Karp
| last4 = Tardos | first4 = G. | author4-link = Gábor Tardos
| last5 = Wigderson | first5 = A. | author5-link = Avi Wigderson
| doi = 10.1007/BF01294260
| issue = 1
| journal = Algorithmica
| mr = 1247985
| pages = 2–14
| title = On the power of randomization in on-line algorithms
| volume = 11
| year = 1994}}
Books
  • {{cite book

| last1 = Borodin | first1 = Allan
| last2 = Munro | first2 = Ian | author2-link = Ian Munro (computer scientist)
| mr = 0468309
| publisher = American Elsevier Publishing Co., Inc. | location = New York, London, Amsterdam
| series = Elsevier Computer Science Library; Theory of Computation Series | volume = 1
| title = The Computational Complexity of Algebraic and Numeric Problems
| year = 1975}}
  • {{cite book

| authorlink = Allan Borodin
| author = Borodin, A.
|author2=El-Yaniv, R.
| url = http://www.cs.technion.ac.il/~rani/book.html
| title = Online Computation and Competitive Analysis
| publisher = Cambridge University Press
| year = 1998
| isbn = 978-0-521-56392-5}}

See also

  • Gap theorem
  • Online algorithms
  • Computational Complexity

References

1. ^Borodin named University Professor, U. Toronto Computer Science, retrieved 2012-03-17.
2. ^Past prizes and awards, PIMS, retrieved 2012-03-17.
3. ^{{mathgenealogy|name=Allan Bertram Borodin|id=42043}}
4. ^Allan Borodin: Recipient of the 2008 CRM-Fields-PIMS Prize, retrieved 2012-03-17.
5. ^AAAS Members Elected as Fellows in 2011 {{webarchive |url=https://web.archive.org/web/20120113205143/http://www.aaas.org/aboutaaas/fellows/2011.shtml |date=January 13, 2012 }}, retrieved 2012-03-17.
6. ^ACM Names Fellows for Innovations in Computing {{webarchive|url=https://web.archive.org/web/20150109095116/http://awards.acm.org/press_releases/fellows-2014b.pdf |date=2015-01-09 }}, ACM, January 8, 2015, retrieved 2015-01-08.

External links

  • Home Page at University of Toronto
{{Authority control}}{{DEFAULTSORT:Borodin, Allan}}{{US-mathematician-stub}}

11 : 1941 births|Living people|University of Toronto faculty|American computer scientists|Rutgers University alumni|Stevens Institute of Technology alumni|Cornell University alumni|Fellows of the Royal Society of Canada|Fellows of the American Association for the Advancement of Science|Fellows of the Association for Computing Machinery|Theoretical computer scientists

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/11 10:09:40