This HTML5 document contains 110 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dbpedia-dehttp://de.dbpedia.org/resource/
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-eshttp://es.dbpedia.org/resource/
n29https://global.dbpedia.org/id/
n16http://www.maths.qmul.ac.uk/~mj/
yagohttp://dbpedia.org/class/yago/
schemahttp://schema.org/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n23https://tspace.library.utoronto.ca/handle/1807/
freebasehttp://rdf.freebase.com/ns/
dbpedia-pthttp://pt.dbpedia.org/resource/
n18http://viaf.org/viaf/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n17https://dblp.org/pid/j/
owlhttp://www.w3.org/2002/07/owl#
dbpedia-frhttp://fr.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
n19http://mg.dbpedia.org/resource/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n20http://d-nb.info/gnd/

Statements

Subject Item
dbr:Mark_Jerrum
rdf:type
yago:WikicatAlumniOfTheUniversityOfEdinburgh yago:YagoLegalActor yago:Scholar110557854 yago:LivingThing100004258 yago:YagoLegalActorGeo owl:Thing yago:Recipient109627906 yago:PhysicalEntity100001930 yago:WikicatTheoreticalComputerScientists yago:WikicatGödelPrizeLaureates yago:Alumnus109786338 yago:Whole100003553 yago:WikicatBritishPeople yago:Intellectual109621545 yago:Object100002684 yago:WikicatComputerScientists yago:WikicatLivingPeople yago:WikicatBritishComputerScientists yago:Professional110480253 dbo:Scientist yago:Adult109605289 yago:Honoree110183757 yago:Theorist110706812 yago:WikicatAcademicsOfQueenMary,UniversityOfLondon yago:Scientist110560637 yago:Educator110045713 yago:WikicatBritishInformationTheorists yago:Academician109759069 yago:Organism100004475 yago:ComputerUser109951274 yago:ComputerScientist109951070 yago:Laureate110249011 yago:Acquirer109764201 yago:Person100007846 yago:CausalAgent100007347 dbo:Person
rdfs:label
Mark Jerrum Mark Jerrum Mark Jerrum Mark Jerrum Mark Jerrum
rdfs:comment
Mark Richard Jerrum (born 1955) is a British computer scientist and computational theorist. Jerrum received his Ph.D. in computer science 'On the complexity of evaluating multivariate polynomials' in 1981 from University of Edinburgh under the supervision of Leslie Valiant. He is professor of pure mathematics at Queen Mary, University of London. Mark Richard Jerrum (1955) é um teórico da computação britânico. Jerrum obteve um Ph.D. em ciência da computação em 1981 na Universidade de Edimburgo, orientado por Leslie Valiant, com a tese On the complexity of evaluating multivariate polynomials. É professor de matemática pura na Queen Mary University of London. Foi palestrante convidado do Congresso Internacional de Matemáticos em Zurique (1994: The computational complexity of counting). Mark Richard Jerrum (* 1955) ist ein britischer Informatiker. Jerrum wurde 1981 bei Leslie Valiant an der University of Edinburgh promoviert (On the complexity of evaluating multivariate polynomials). Er war Professor in Edinburgh und ist Professor für Reine Mathematik am Queen Mary College der Universität London. Mark Richard Jerrum es un informático teórico británico. Recibió su Ph.D. en ciencias de la computación en 1981 en la Universidad de Edimburgo bajo la supervisión de Leslie Valiant.​ Es profesor de matemáticas puras en .​ Mark Richard Jerrum est un chercheur en informatique théorique anglais, né en 1955. Il a reçu le prix Gödel en 1996.
dcterms:subject
dbc:1955_births dbc:British_computer_scientists dbc:Alumni_of_the_University_of_Edinburgh dbc:Gödel_Prize_laureates dbc:Academics_of_Queen_Mary_University_of_London dbc:Living_people dbc:Theoretical_computer_scientists
dbo:wikiPageID
20942679
dbo:wikiPageRevisionID
1069724703
dbo:wikiPageWikiLink
dbr:Pure_mathematics dbc:British_computer_scientists dbc:1955_births dbr:Approximation_algorithms dbr:Fulkerson_Prize dbr:Computational_theorist dbr:Markov_chain dbr:Gödel_Prize dbr:Great_Britain dbc:Alumni_of_the_University_of_Edinburgh dbc:Gödel_Prize_laureates dbr:Journal_of_Algorithms dbr:Ph.D. dbr:Queen_Mary,_University_of_London dbc:Academics_of_Queen_Mary_University_of_London dbr:Leslie_Valiant dbr:University_of_Edinburgh dbr:Alistair_Sinclair dbc:Theoretical_computer_scientists dbc:Living_people dbr:Computing_the_permanent
dbo:wikiPageExternalLink
n16: n23:9464
owl:sameAs
yago-res:Mark_Jerrum dbpedia-fr:Mark_Jerrum n17:MarkJerrum n18:23074277 n19:Mark_Jerrum n20:12443133X dbpedia-fa:مارک_جروم freebase:m.05b5l9b dbpedia-de:Mark_Jerrum dbpedia-es:Mark_Jerrum dbpedia-pt:Mark_Jerrum n29:54mex wikidata:Q92666
dbp:wikiPageUsesTemplate
dbt:Use_British_English dbt:Reflist dbt:Use_dmy_dates dbt:Authority_control dbt:AcademicSearch dbt:UK-scientist-stub dbt:Gödel_winners dbt:UK-compu-bio-stub dbt:Short_description
dbo:abstract
Mark Richard Jerrum (born 1955) is a British computer scientist and computational theorist. Jerrum received his Ph.D. in computer science 'On the complexity of evaluating multivariate polynomials' in 1981 from University of Edinburgh under the supervision of Leslie Valiant. He is professor of pure mathematics at Queen Mary, University of London. With his student Alistair Sinclair, Jerrum 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 Jerrum and his co-authors received the Fulkerson Prize in 2006. Mark Richard Jerrum (* 1955) ist ein britischer Informatiker. Jerrum wurde 1981 bei Leslie Valiant an der University of Edinburgh promoviert (On the complexity of evaluating multivariate polynomials). Er war Professor in Edinburgh und ist Professor für Reine Mathematik am Queen Mary College der Universität London. Jerrum befasst sich mit Kombinatorik, Komplexitätstheorie und stochastischen Prozessen, insbesondere mit randomisierten Algorithmen und Mischungszeiten von Markow-Ketten in kombinatorischen und geometrischen Problemen. Ende der 1980er Jahre untersuchte er mit seinem Studenten Alistair Sinclair, der bei ihm 1988 in Edinburgh promoviert wurde, Mischungseigenschaften von Markow-Ketten und konstruierte damit Monte Carlo Markow-Ketten-Näherungsalgorithmen für Abzählprobleme wie der von Matchings und damit zusammenhängend der Berechnung der Permanente, einem nach Ergebnissen von Valiant innerhalb der Komplexitätstheorie schwierigen Problem. 1996 erhielten beide dafür den Gödel-Preis. 2006 erhielt er mit Alistair Sinclair und den Fulkerson-Preis für die Angabe eines polynomzeitlichen probabilistischen Näherungs-Algorithmus zur Berechnung der Permanente einer Matrix mit nicht negativen Elementen (A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, Journal of the ACM, Band 51, 2004, S. 671--697). Er untersuchte auch Näherungsalgorithmen für Abzählprobleme aus dem Ising-Modell, innerhalb der Polya´s Theorie von Abzählproblemen (wie denen von chemischen Verbindungen und Färbungen auf Graphen) und für Hamiltonsche Wege in Zufalls-Graphen. Mark Richard Jerrum est un chercheur en informatique théorique anglais, né en 1955. Il a reçu le prix Gödel en 1996. Mark Richard Jerrum (1955) é um teórico da computação britânico. Jerrum obteve um Ph.D. em ciência da computação em 1981 na Universidade de Edimburgo, orientado por Leslie Valiant, com a tese On the complexity of evaluating multivariate polynomials. É professor de matemática pura na Queen Mary University of London. Com seu aluno investiga o comportamento misto de Cadeias de Markov para construir algoritmos de aproximação para o problema de contagem tal como o , com aplicações em diversas áreas. Este trabalho tem sido altamente influente em ciência da computação teórica e foi reconhecido com o Prêmio Gödel de 1996. Um refinamento destes métodos levou a um algoritmo de aproximação aleatória em tempo completamente polinomial para calcular o permanente, pelo qual Jerrum e seus co-autores receberam o Prêmio Fulkerson de 2006. Foi palestrante convidado do Congresso Internacional de Matemáticos em Zurique (1994: The computational complexity of counting). Mark Richard Jerrum es un informático teórico británico. Recibió su Ph.D. en ciencias de la computación en 1981 en la Universidad de Edimburgo bajo la supervisión de Leslie Valiant.​ Es profesor de matemáticas puras en .​ Con su alumno Alistair Sinclair, Jerrum investigó las combinaciones detrás de las cadenas de Markov para construir algoritmos de aproximación para problemas de enumeración, con aplicaciones en diversos campos tales como algoritmos de matching, algoritmos geométricos, programación matemática, estadísticas, aplicaciones inspiradas en la física, y sistemas dinámicos. Este trabajo ha sido muy influyente en el área más teórica de las ciencias de la computación, y fue reconocido con el Premio Gödel en 1996.​ Jerrum mejoró la eficiencia de estos algoritmos, lo que le significó junto con sus co-autores el recibimiento del Premio Fulkerson en 2006.​
gold:hypernym
dbr:Scientist
schema:sameAs
n18:23074277
prov:wasDerivedFrom
wikipedia-en:Mark_Jerrum?oldid=1069724703&ns=0
dbo:wikiPageLength
2735
foaf:isPrimaryTopicOf
wikipedia-en:Mark_Jerrum