Metraipolis › archive › dc_bb0fc4c3cf43
Avner Magen — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Avner_Magen
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-10T13:13:52.305Z
- SHA-256 of the archived text
1ef8ae8826a86908be9fec2557eaf6c87fc36cfdd172ecd0b34aa89d186c0432- Stable URL of this page
https://metraipolis.com/documento/dc_bb0fc4c3cf43
How to cite
Avner Magen — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Avner_Magen (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_bb0fc4c3cf43 (Metraipolis archive dc_bb0fc4c3cf43, sha256 1ef8ae8826a86908be9fec2557eaf6c87fc36cfdd172ecd0b34aa89d186c0432)
BibTeX
@misc{dcbb0fc4c3cf43,
title = {Avner Magen — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Avner_Magen},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_bb0fc4c3cf43; sha256 1ef8ae8826a86908be9fec2557eaf6c87fc36cfdd172ecd0b34aa89d186c0432},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Avner_Magen. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Avner Magen (Hebrew: אבנר מגן; March 30, 1968 – May 29, 2010) was an associate professor of computer science at the University of Toronto whose research focused on the theory of metric embeddings, discrete geometry and computational geometry. He completed his undergraduate and graduate studies at the Hebrew University of Jerusalem, and received his Ph.D. in Computer Science in 2002, under the supervision of Nati Linial. He held a postdoctoral fellowship at NEC Research in Princeton, New Jersey, from 2000 until 2002. He joined the University of Toronto in 2002, first as a postdoctoral fellow, and then as an assistant professor in 2004. He was promoted to associate professor in 2009. His major contributions include an algorithm for approximating the weight of the Euclidean minimum spanning tree in sublinear time, and finding a tight integrality gap for the vertex cover problem using the Frankl–Rödl graphs. He proved with his coauthors essentially that a huge class of semidefinite programming algorithms for the famous vertex cover problem will not achieve a solution of value less than the value of the optimal solution times a factor of two. With Nati Linial and Michael Saks, he showed how to embed trees into Euclidean metrics with low O(log log n) distortion. And in a later result, he showed how to do JL-style embeddings that preserved not only distances, but also higher order volumes. He died in an avalanche while climbing in Alaska's Denali National Park on May 29, 2010, along with friend and climbing partner, Andrew Herzenberg. Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico). Fonte: Wikipedia in inglese, voce «Avner Magen» — https://en.wikipedia.org/wiki/Avner_Magen Wikidata Q4829074: «Canadian computer scientist» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4829074 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Avner_Magen?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1371974247, consultata il 2026-11-10T13:03:47.614Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 2d144e5d5bba2639952ffdb1e6e71b896264b66a5bb795911fd06e70107053fc