. . . . "Alistair Sinclair"@en . . . "\u963F\u5229\u65AF\u6CF0\u723E\u00B7\u8F9B\u514B\u840A\u723E"@zh . . . . "\u963F\u5229\u65AF\u6CF0\u723E\u00B7\u8F9B\u514B\u840A\u723E\uFF08\u82F1\u8A9E\uFF1AAlistair Sinclair\uFF0C1960\u5E74\uFF0D\uFF09\uFF0C\u82F1\u570B\u96FB\u8166\u79D1\u5B78\u5BB6\u8207\u8A08\u7B97\u7406\u8AD6\u5BB6\uFF0C\u66FE\u7372\u54E5\u5FB7\u723E\u734E\u3002 \u8F9B\u514B\u840A\u723E\u65BC1979\u5E74\u5927\u5B78\u7562\u696D\u65BC\u528D\u6A4B\u5927\u5B78\uFF0C\u96A8\u5F8C\u65BC1988\u5E74\u81EA\u611B\u4E01\u5821\u5927\u5B78\u5F97\u5230\u96FB\u8166\u79D1\u5B78\u535A\u58EB\u5B78\u4F4D\uFF0C\u76EE\u524D\u5728\u67CF\u514B\u840A\u52A0\u5DDE\u5927\u5B78\u4EFB\u6559\uFF0C\u4E26\u5728\u611B\u4E01\u5821\u5927\u5B78\u3001\u3001\u67CF\u514B\u840A\u90FD\u66FE\u6709\u4EFB\u8077\u3002"@zh . . . "Alistair Sinclair"@es . . "Alistair Sinclair"@de . . . . . "Alistair Sinclair es un inform\u00E1tico te\u00F3rico brit\u00E1nico. Sinclair recibi\u00F3 su B.A. en Matem\u00E1ticas en el St. John\u2019s College de la Universidad de Cambridge en 1979, y su Ph.D. en Ciencias de la computaci\u00F3n en la Universidad de Edimburgo en 1988 bajo la supervisi\u00F3n de Mark Jerrum. Es profesor en la divisi\u00F3n de Ciencias de la Computaci\u00F3n en la Universidad de California, Berkeley y ha tenido puestos acad\u00E9micos en la Universidad de Edimburgo, y como acad\u00E9mico visitante en y el en Berkeley. Los intereses de investigaci\u00F3n de Sinclair incluyen el dise\u00F1o y an\u00E1lisis de algoritmos aleatorios, aplicaciones computacionales de procesos estoc\u00E1sticos y sistemas din\u00E1micos no lineales, el m\u00E9todo de Montecarlo en f\u00EDsica estad\u00EDstica, y . Con su tutor Mark Jerrum, Sinclair investig\u00F3 el comportamiento de mezcla de las cadenas de Markov para construir algoritmos de aproximaci\u00F3n para problemas de enumeraci\u00F3n, tales como , con aplicaciones en diversos campos tales como matching de algoritmos, algoritmos geom\u00E9tricos, programaci\u00F3n matem\u00E1tica, estad\u00EDstica, aplicaciones inspiradas en la f\u00EDsica, y sistemas din\u00E1micos. Este trabajo ha sido altamente influyente en la inform\u00E1tica te\u00F3rica y fue reconocido con el Premio G\u00F6del en 1996.\u200B Un refinamiento de estos m\u00E9todos llev\u00F3 a un algoritmo aleatorio de aproximaci\u00F3n de tiempo polinomial para el c\u00F3mputo del permanente, con el cual Sinclair y sus co-autores recibieron el Premio Fulkerson en 2006.\u200B"@es . "\u0623\u0644\u064A\u0633\u062A\u064A\u0631 \u0633\u0646\u0643\u0644\u064A\u0631 (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Alistair Sinclair)\u200F \u0647\u0648 \u0639\u0627\u0644\u0645 \u062D\u0627\u0633\u0648\u0628 \u0648\u0645\u0647\u0646\u062F\u0633 \u0628\u0631\u064A\u0637\u0627\u0646\u064A\u060C \u0648\u0644\u062F \u0641\u064A 1960."@ar . . . . . "\u0623\u0644\u064A\u0633\u062A\u064A\u0631 \u0633\u0646\u0643\u0644\u064A\u0631 (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Alistair Sinclair)\u200F \u0647\u0648 \u0639\u0627\u0644\u0645 \u062D\u0627\u0633\u0648\u0628 \u0648\u0645\u0647\u0646\u062F\u0633 \u0628\u0631\u064A\u0637\u0627\u0646\u064A\u060C \u0648\u0644\u062F \u0641\u064A 1960."@ar . . . "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. Er befasst sich mit Entwurf randomisierter Algorithmen, kombinatorischer Optimierung, Monte-Carlo-Verfahren und numerischen Anwendungen in der statistischen Physik, bei stochastischen Prozessen und nichtlinearen dynamischen Systemen. Er untersuchte mit Jerrum Mischungseigenschaften von Markov-Ketten zur Konstruktion von N\u00E4herungsalgorithmen in kombinatorischen Problemen wie der Berechnung der Permanente in polynomieller Zeit. 1996 erhielt er mit Mark Jerrum den G\u00F6del-Preis und 2006 mit Jerrum und seinem Doktoranden den Fulkerson-Preis (f\u00FCr ihre Arbeit A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, Journal of the ACM, Bd. 51, 2004)."@de . . "20946870"^^ . . "Alistair Sinclair (born 1960) is a British computer scientist and computational theorist. Sinclair received his B.A. in mathematics from St. John\u2019s 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 . . . . . . . . . . . "3071"^^ . . . . . "\u0623\u0644\u064A\u0633\u062A\u064A\u0631 \u0633\u0646\u0643\u0644\u064A\u0631"@ar . . . . . . . . . . . . "\u963F\u5229\u65AF\u6CF0\u723E\u00B7\u8F9B\u514B\u840A\u723E\uFF08\u82F1\u8A9E\uFF1AAlistair Sinclair\uFF0C1960\u5E74\uFF0D\uFF09\uFF0C\u82F1\u570B\u96FB\u8166\u79D1\u5B78\u5BB6\u8207\u8A08\u7B97\u7406\u8AD6\u5BB6\uFF0C\u66FE\u7372\u54E5\u5FB7\u723E\u734E\u3002 \u8F9B\u514B\u840A\u723E\u65BC1979\u5E74\u5927\u5B78\u7562\u696D\u65BC\u528D\u6A4B\u5927\u5B78\uFF0C\u96A8\u5F8C\u65BC1988\u5E74\u81EA\u611B\u4E01\u5821\u5927\u5B78\u5F97\u5230\u96FB\u8166\u79D1\u5B78\u535A\u58EB\u5B78\u4F4D\uFF0C\u76EE\u524D\u5728\u67CF\u514B\u840A\u52A0\u5DDE\u5927\u5B78\u4EFB\u6559\uFF0C\u4E26\u5728\u611B\u4E01\u5821\u5927\u5B78\u3001\u3001\u67CF\u514B\u840A\u90FD\u66FE\u6709\u4EFB\u8077\u3002"@zh . . . . . . . . . . . . . . . . . "Alistair Sinclair, n\u00E9 en 1960, est un chercheur et professeur en informatique th\u00E9orique. Il a re\u00E7u le prix G\u00F6del en 1996."@fr . . . . . . . . "Alistair Sinclair"@fr . . . . . . "Alistair Sinclair es un inform\u00E1tico te\u00F3rico brit\u00E1nico. Sinclair recibi\u00F3 su B.A. en Matem\u00E1ticas en el St. John\u2019s College de la Universidad de Cambridge en 1979, y su Ph.D. en Ciencias de la computaci\u00F3n en la Universidad de Edimburgo en 1988 bajo la supervisi\u00F3n de Mark Jerrum. Es profesor en la divisi\u00F3n de Ciencias de la Computaci\u00F3n en la Universidad de California, Berkeley y ha tenido puestos acad\u00E9micos en la Universidad de Edimburgo, y como acad\u00E9mico visitante en y el en Berkeley."@es . . "Alistair Sinclair (born 1960) is a British computer scientist and computational theorist. Sinclair received his B.A. in mathematics from St. John\u2019s 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\u2019s 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\u00F6del 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 . "1102908636"^^ . . . "Alistair Sinclair, n\u00E9 en 1960, est un chercheur et professeur en informatique th\u00E9orique. Il a re\u00E7u le prix G\u00F6del en 1996."@fr . . . . . . . . "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 . .