Uri Zwick is an Israeli computer scientist and mathematician known for his work on graph algorithms, in particular on distances in graphs and on the color-coding technique for subgraph isomorphism. With , he is the namesake of the Karloff–Zwick algorithm for approximating the MAX-3SAT problem of Boolean satisfiability. He and his coauthors won the David P. Robbins Prize in 2011 for their work on the block-stacking problem.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Uri Zwick (fr)
- Uri Zwick (pt)
- Uri Zwick (en)
|
rdfs:comment
| - Uri Zwick est un informaticien théoricien et mathématicien israélien connu pour ses contributions aux algorithmes sur les graphes, en particulier sur les distances dans un graphe et sur la technique dite de (en) pour le problème de l'isomorphisme de sous-graphes. (fr)
- Uri Zwick is an Israeli computer scientist and mathematician known for his work on graph algorithms, in particular on distances in graphs and on the color-coding technique for subgraph isomorphism. With , he is the namesake of the Karloff–Zwick algorithm for approximating the MAX-3SAT problem of Boolean satisfiability. He and his coauthors won the David P. Robbins Prize in 2011 for their work on the block-stacking problem. (en)
- Uri Zwick é um cientista da computação e matemático israelense, conhecido por seu trabalho sobre algoritmos de grafos, em particular sobre distâncias em grafos e sobre a técnica de codificação de cores para isomorfismo de subgrafos. Com dá nome ao para a aproximação do problema MAX-3SAT da satisfatibilidade booliana. Com seus coautores recebeu o Prêmio David P. Robbins de 2011 por seu trabalho sobre o . (pt)
|
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
| - Uri Zwick est un informaticien théoricien et mathématicien israélien connu pour ses contributions aux algorithmes sur les graphes, en particulier sur les distances dans un graphe et sur la technique dite de (en) pour le problème de l'isomorphisme de sous-graphes. (fr)
- Uri Zwick is an Israeli computer scientist and mathematician known for his work on graph algorithms, in particular on distances in graphs and on the color-coding technique for subgraph isomorphism. With , he is the namesake of the Karloff–Zwick algorithm for approximating the MAX-3SAT problem of Boolean satisfiability. He and his coauthors won the David P. Robbins Prize in 2011 for their work on the block-stacking problem. Zwick earned a bachelor's degree from the Technion – Israel Institute of Technology, and completed his doctorate at Tel Aviv University in 1989 under the supervision of Noga Alon. He is currently a professor of computer science at Tel Aviv University. (en)
- Uri Zwick é um cientista da computação e matemático israelense, conhecido por seu trabalho sobre algoritmos de grafos, em particular sobre distâncias em grafos e sobre a técnica de codificação de cores para isomorfismo de subgrafos. Com dá nome ao para a aproximação do problema MAX-3SAT da satisfatibilidade booliana. Com seus coautores recebeu o Prêmio David P. Robbins de 2011 por seu trabalho sobre o . Zwick obteve um grau de bacharel no Technion, com um doutorado na Universidade de Tel Aviv em 1989, orientado por Noga Alon. É atualmente professor de ciência da computação na Universidade de Tel Aviv. (pt)
|
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage disambiguates
of | |
is doctoral students
of | |
is doctoral student
of | |
is foaf:primaryTopic
of | |