 | 2009 |
|---|
| 6 |       | Ilia Binder,
Mark Braverman:
The complexity of simulating Brownian Motion.
SODA 2009: 58-67 |
| 2007 |
|---|
| 5 | | Ilia Binder,
Mark Braverman:
Derandomization of Euclidean Random Walks.
APPROX-RANDOM 2007: 353-365 |
| 4 | | Ilia Binder,
Mark Braverman,
Michael Yampolsky:
Filled Julia Sets with Empty Interior Are Computable.
Foundations of Computational Mathematics 7(4): 405-416 (2007) |
| 2005 |
|---|
| 3 | | Ilia Binder,
Mark Braverman,
Michael Yampolsky:
On computational complexity of Siegel Julia sets
CoRR abs/math/0502354: (2005) |
| 2 | | Ilia Binder,
Mark Braverman,
Michael Yampolsky:
On computational complexity of Riemann mapping
CoRR abs/math/0505617: (2005) |
| 2004 |
|---|
| 1 | | Ilia Binder,
Mark Braverman,
Michael Yampolsky:
Filled Julia sets with empty interior are computable
CoRR math.DS/0410580: (2004) |
Data released under the ODC-BY 1.0 license — See also our legal information page