( en | de | ru )

 

Disambiguation of "Dinitz, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics.

. DISC, volume 5218 of Lecture Notes in Computer Science, page 152-166. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Bode

Le groupe international de sociétés: le système de conflit de lois en droit comparé français et allemand. HU Berlin, (2009)

Michael Liecke

Subnationale Clusterpolitik: die Biotechnologiepolitik deutscher Länder im Vergleich. Uni München, (2009)

Michael Schoierer

NS-Diktatur, Anomie und Demokratisierung Westdeutschlands. Uni Augsburg, (2007)

Michael Krug

X-ray crystallographic analysis of the archaeal transcriptional regulator TrmB and development of a graphical user interface for the monochromatic diffraction data processing software XDS. Uni Konstanz, (2009)

Michael Bernateck

Komplexes Regionales Schmerzsyndrom Typ 1 (M.Sudeck): neue Aspekte zur Symptomatologie, Pathogenese, Diagnostik und Therapie. MedH Hannover, habilitation, (2009)
 

Other publications of authors with the same name

Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds., , , and . CoRR, (2016)Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion., , and . CoRR, (2016)Explicit Expanding Expanders., , and . Algorithmica, 78 (4): 1225-1245 (2017)Vertex Fault-Tolerant Emulators., , and . CoRR, (2021)Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds., , , and . SODA, page 534-553. SIAM, (2017)Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion., , and . SODA, page 881-899. SIAM, (2017)Matroid Secretary for Regular and Decomposable Matroids., and . SODA, page 108-117. SIAM, (2013)Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner., , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 290-301. Springer, (2012)Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks., , , , and . AISTATS, volume 151 of Proceedings of Machine Learning Research, page 11641-11654. PMLR, (2022)Computing Approximate PSD Factorizations., , and . APPROX-RANDOM, volume 60 of LIPIcs, page 2:1-2:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)