( en | de | ru )

 

Disambiguation of "Braverman, Mark"

Author of the publication

copydeleteadd this publication to your clipboard
Search using queries on indistinguishable items.

, and . STACS, volume 20 of LIPIcs, page 610-621. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)

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.

Sigrun H Braverman

Mark Yampolsky

Maßnahmen zur Sicherung von E2E-QoS bei verketteten Diensten. Uni München, (2009)

Mark Schütte

Crf2 - ein neues Antigen von Aspergillus fumigatus. TU Braunschweig, (2009)

Mark Yampolskiy

Maßnahmen zur Sicherung von E2E-QoS bei verketteten Diensten. Uni München, (2009)

Ana Markovi

Experimental and theoretical analysis of the mass transport through porous glass membranes with different pore diameters. Uni Magdeburg, (2009)
 

Other publications of authors with the same name

On ad hoc routing with guaranteed delivery.. PODC, page 418. ACM, (2008)Simulating Noisy Channel Interaction., and . ITCS, page 21-30. ACM, (2015)Noise versus Computational Intractability in Dynamics.. CiE, volume 7921 of Lecture Notes in Computer Science, page 32. Springer, (2013)Stability in Large Matching Markets with Complementarities., , and . Operations Research, 62 (4): 713-732 (2014)Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions., , and . SODA, page 1444-1457. SIAM, (2016)The complexity of simulating Brownian Motion., and . SODA, page 58-67. SIAM, (2009)Tight Space Complexity of the Coin Problem., , and . FOCS, page 1068-1079. IEEE, (2021)Semi-Direct Sum Theorem and Nearest Neighbor under l_infty., and . APPROX-RANDOM, volume 116 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Prior-free Dynamic Mechanism Design With Limited Liability., , and . EC, page 204-223. ACM, (2021)Efficient Communication Using Partial Information., and . Electron. Colloquium Comput. Complex., (2010)