About: Michael Saks (mathematician)     Goto   Sponge   NotDistinct   Permalink

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

Michael Ezra Saks is an American mathematician. He is currently the Department Chair of the Mathematics Department at Rutgers University (2017–) and from 2006 until 2010 was director of the Mathematics Graduate Program at Rutgers University. Saks received his Ph.D. from the Massachusetts Institute of Technology in 1980 after completing his dissertation titled Duality Properties of Finite Set Systems under his advisor Daniel J. Kleitman. A list of his publications and collaborations may be found at DBLP. In 2016 he became a Fellow of the Association for Computing Machinery.

AttributesValues
rdf:type
rdfs:label
  • Michael Saks (de)
  • Michael Saks (fr)
  • Michael Saks (mathematician) (en)
rdfs:comment
  • Michael Ezra Saks est un mathématicien et informaticien théoricien américain. Il travaille en théorie de la complexité, combinatoire et théorie des graphes. (fr)
  • Michael Ezra Saks is an American mathematician. He is currently the Department Chair of the Mathematics Department at Rutgers University (2017–) and from 2006 until 2010 was director of the Mathematics Graduate Program at Rutgers University. Saks received his Ph.D. from the Massachusetts Institute of Technology in 1980 after completing his dissertation titled Duality Properties of Finite Set Systems under his advisor Daniel J. Kleitman. A list of his publications and collaborations may be found at DBLP. In 2016 he became a Fellow of the Association for Computing Machinery. (en)
  • Michael Ezra Saks ist ein US-amerikanischer Informatiker und Mathematiker. Saks wurde 1980 am Massachusetts Institute of Technology bei Daniel J. Kleitman promoviert (Duality Properties of Finite Set Systems). Er ist Professor an der Rutgers University. Saks befasst sich mit Komplexitätstheorie, Kombinatorik und Graphentheorie. (de)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Michael Ezra Saks ist ein US-amerikanischer Informatiker und Mathematiker. Saks wurde 1980 am Massachusetts Institute of Technology bei Daniel J. Kleitman promoviert (Duality Properties of Finite Set Systems). Er ist Professor an der Rutgers University. Saks befasst sich mit Komplexitätstheorie, Kombinatorik und Graphentheorie. 2004 erhielt er den Gödel-Preis mit Maurice Herlihy, Nir Shavit und Fotios Zaharoglou für seinen Aufsatz mit Zaharoglou: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge (SIAM Journal on Computing, Band 29, 2000). Damit wurde ihre Entdeckung der Rolle der Topologie im verteilten Rechnen gewürdigt, die es ermöglicht die Frage der Existenz von Protokollen für bestimmte Probleme von ihrer dynamischen Natur zu befreien und auf ein topologisches Problem zu reduzieren. Zaharoglou war 1993 sein Doktorand an der University of California, San Diego. Von ihm und , und stammt der schnellste bekannte (randomisierte) Algorithmus für allgemeines k-SAT, PPSZ (benannt nach den Anfangsbuchstaben der Nachnamen der Autoren), entstanden aus dem Vorläufer PPZ von 1999, der nicht so gut wie der Algorithmus von Schöning war und wie PPSZ auf auf Encoding basierte. 2014 gab Verbesserungen für den Fall unique 3-SAT. (de)
  • Michael Ezra Saks est un mathématicien et informaticien théoricien américain. Il travaille en théorie de la complexité, combinatoire et théorie des graphes. (fr)
  • Michael Ezra Saks is an American mathematician. He is currently the Department Chair of the Mathematics Department at Rutgers University (2017–) and from 2006 until 2010 was director of the Mathematics Graduate Program at Rutgers University. Saks received his Ph.D. from the Massachusetts Institute of Technology in 1980 after completing his dissertation titled Duality Properties of Finite Set Systems under his advisor Daniel J. Kleitman. A list of his publications and collaborations may be found at DBLP. In 2016 he became a Fellow of the Association for Computing Machinery. (en)
gold:hypernym
schema:sameAs
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
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 (378 GB total memory, 50 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software