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