dblp.uni-trier.dewww.uni-trier.de

Mark Braverman

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
22EEIlia Binder, Mark Braverman: The complexity of simulating Brownian Motion. SODA 2009: 58-67
2008
21EEMark Braverman: On ad hoc routing with guaranteed delivery. PODC 2008: 418
20EEMark Braverman, Elchanan Mossel: Noisy sorting without resampling. SODA 2008: 268-276
19EEMark Braverman: On ad hoc routing with guaranteed delivery CoRR abs/0804.0862: (2008)
18EEMichael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: The complexity of properly learning simple concept classes. J. Comput. Syst. Sci. 74(1): 16-34 (2008)
2007
17EEIlia Binder, Mark Braverman: Derandomization of Euclidean Random Walks. APPROX-RANDOM 2007: 353-365
16EEMark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. IEEE Conference on Computational Complexity 2007: 222-235
15EEMark Braverman, Michael Yampolsky: Constructing non-computable Julia sets. STOC 2007: 709-716
14EEMark Braverman, Elchanan Mossel: Noisy Sorting Without Resampling CoRR abs/0707.1051: (2007)
13EEMark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(035): (2007)
12EEIlia Binder, Mark Braverman, Michael Yampolsky: Filled Julia Sets with Empty Interior Are Computable. Foundations of Computational Mathematics 7(4): 405-416 (2007)
2006
11EEMark Braverman: Termination of Integer Linear Programs. CAV 2006: 372-385
10EEMark Braverman, Michael Yampolsky: Constructing Non-Computable Julia Sets CoRR abs/math/0604371: (2006)
2005
9EEMark Braverman: On the Complexity of Real Functions. FOCS 2005: 155-164
8EEMark Braverman: On the Complexity of Real Functions CoRR abs/cs/0502066: (2005)
7EEMark Braverman, Stephen Cook: Computing over the Reals: Foundations for Scientific Computing CoRR abs/cs/0509042: (2005)
6EEIlia Binder, Mark Braverman, Michael Yampolsky: On computational complexity of Siegel Julia sets CoRR abs/math/0502354: (2005)
5EEIlia Binder, Mark Braverman, Michael Yampolsky: On computational complexity of Riemann mapping CoRR abs/math/0505617: (2005)
4EEMark Braverman: Hyperbolic Julia Sets are Poly-Time Computable. Electr. Notes Theor. Comput. Sci. 120: 17-30 (2005)
2004
3EEMichael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: Learnability and Automatizability. FOCS 2004: 621-630
2EEMark Braverman, Michael Yampolsky: Non-computable Julia sets CoRR math.DS/0406416: (2004)
1EEIlia Binder, Mark Braverman, Michael Yampolsky: Filled Julia sets with empty interior are computable CoRR math.DS/0410580: (2004)

Coauthor Index

1Michael Alekhnovich [3] [18]
2Ilia Binder [1] [5] [6] [12] [17] [22]
3Stephen Cook [7]
4Vitaly Feldman [3] [18]
5Adam R. Klivans (Adam Klivans) [3] [18]
6Raghav Kulkarni [13] [16]
7Elchanan Mossel [14] [20]
8Toniann Pitassi [3] [18]
9Sambuddha Roy [13] [16]
10Michael Yampolsky [1] [2] [5] [6] [10] [12] [15]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)