About: Alistair Sinclair     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatAlumniOfTheUniversityOfEdinburgh, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FAlistair_Sinclair

Alistair Sinclair (born 1960) is a British computer scientist and computational theorist. Sinclair received his B.A. in mathematics from St. John’s College, Cambridge in 1979, and his Ph.D. in computer science from the University of Edinburgh in 1988 under the supervision of Mark Jerrum. He is professor at the Computer Science division at the University of California, Berkeley and has held faculty positions at University of Edinburgh and visiting positions at DIMACS and the International Computer Science Institute in Berkeley.

AttributesValues
rdf:type
rdfs:label
  • Alistair Sinclair (en)
  • أليستير سنكلير (ar)
  • Alistair Sinclair (de)
  • Alistair Sinclair (es)
  • Alistair Sinclair (fr)
  • 阿利斯泰爾·辛克萊爾 (zh)
rdfs:comment
  • أليستير سنكلير (بالإنجليزية: Alistair Sinclair)‏ هو عالم حاسوب ومهندس بريطاني، ولد في 1960. (ar)
  • Alistair Sinclair, né en 1960, est un chercheur et professeur en informatique théorique. Il a reçu le prix Gödel en 1996. (fr)
  • 阿利斯泰爾·辛克萊爾(英語:Alistair Sinclair,1960年-),英國電腦科學家與計算理論家,曾獲哥德爾獎。 辛克萊爾於1979年大學畢業於劍橋大學,隨後於1988年自愛丁堡大學得到電腦科學博士學位,目前在柏克萊加州大學任教,並在愛丁堡大學、、柏克萊都曾有任職。 (zh)
  • Alistair Sinclair (born 1960) is a British computer scientist and computational theorist. Sinclair received his B.A. in mathematics from St. John’s College, Cambridge in 1979, and his Ph.D. in computer science from the University of Edinburgh in 1988 under the supervision of Mark Jerrum. He is professor at the Computer Science division at the University of California, Berkeley and has held faculty positions at University of Edinburgh and visiting positions at DIMACS and the International Computer Science Institute in Berkeley. (en)
  • Alistair Sinclair (* 1960) ist ein britischer Informatiker. Er ist Professor an der University of California, Berkeley. Sinclair studierte an der University of Cambridge mit dem Bachelor-Abschluss 1979 und wurde 1988 bei Mark Jerrum an der University of Edinburgh promoviert (Randomized algorithms for counting and generating combinatorial structures). Er lehrte in Edinburgh und ist Professor in Berkeley. Er war Gastwissenschaftler am DIMACS (Center of Discrete Mathematics and Computer Science) der Rutgers University und am International Computer Science Institute (ICSI) in Berkeley. (de)
  • Alistair Sinclair es un informático teórico británico. Sinclair recibió su B.A. en Matemáticas en el St. John’s College de la Universidad de Cambridge en 1979, y su Ph.D. en Ciencias de la computación en la Universidad de Edimburgo en 1988 bajo la supervisión de Mark Jerrum. Es profesor en la división de Ciencias de la Computación en la Universidad de California, Berkeley y ha tenido puestos académicos en la Universidad de Edimburgo, y como académico visitante en y el en Berkeley. (es)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • أليستير سنكلير (بالإنجليزية: Alistair Sinclair)‏ هو عالم حاسوب ومهندس بريطاني، ولد في 1960. (ar)
  • Alistair Sinclair (born 1960) is a British computer scientist and computational theorist. Sinclair received his B.A. in mathematics from St. John’s College, Cambridge in 1979, and his Ph.D. in computer science from the University of Edinburgh in 1988 under the supervision of Mark Jerrum. He is professor at the Computer Science division at the University of California, Berkeley and has held faculty positions at University of Edinburgh and visiting positions at DIMACS and the International Computer Science Institute in Berkeley. Sinclair’s research interests include the design and analysis of randomized algorithms, computational applications of stochastic processes and nonlinear dynamical systems, Monte Carlo methods in statistical physics and combinatorial optimization. With his advisor Mark Jerrum, Sinclair investigated the mixing behaviour of Markov chains to construct approximation algorithms for counting problems such as the computing the permanent, with applications in diverse fields such as matching algorithms, geometric algorithms, mathematical programming, statistics, physics-inspired applications and dynamical systems. This work has been highly influential in theoretical computer science and was recognised with the Gödel Prize in 1996. A refinement of these methods led to a fully polynomial time randomised approximation algorithm for computing the permanent, for which Sinclair and his co-authors received the Fulkerson Prize in 2006. Sinclair's initial forms part of the name of the GNRS conjecture on metric embeddings of minor-closed graph families. (en)
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software