| The rate of convergence of the Walk on Spheres Algorithm |
| |
Ilia Binder,
Mark Braverman |
|
|
| |
Geometric and Functional Analysis, accepted |
[pdf] | |
| | |
|
Thurston equivalence to a rational map is decidable
|
| |
Sylvain Bonnot ,
Mark Braverman,
Michael Yampolsky |
|
|
| | Preprint
| [arXiv]
| |
| | |
|
Computability of Brolin-Lyubich measure
|
| |
Ilia Binder,
Mark Braverman,
Cristobal Rojas,
Michael Yampolsky |
|
|
| | Submitted
| [arXiv]
| |
| | |
| The complexity of simulating Brownian Motion |
| |
Ilia Binder,
Mark Braverman |
|
|
| | SODA 2009 |
[pdf] [bib] | |
| | |
| Constructing Locally Connected Non-Computable Julia Sets |
| |
Mark Braverman,
Michael Yampolsky |
|
|
| | Commun. Math. Physics, 291(2), 2009 |
[pdf] [bib] | |
| | |
| Computability of Julia
Sets |
| | Mark Braverman,
Michael Yampolsky |
|
|
| | Moscow Math. Journal 8(2), 2008 |
[arXiv][bib] | |
| | |
| Derandomizing Euclidean random walks |
| |
Ilia Binder,
Mark Braverman |
|
|
| | RANDOM 2007 |
[pdf]
[bib] | |
| | |
| Constructing Non-Computable Julia
Sets |
| | Mark Braverman,
Michael Yampolsky |
|
|
| | STOC 2007 |
[pdf] [bib] | |
| | |
| Filled Julia sets with
empty interior are computable |
| |
Ilia Binder,
Mark Braverman,
Michael Yampolsky |
|
|
| | Journal of
Found. of Comp. Math. 7(4),
2007 |
[arXiv]
[bib] | |
| | |
| On computational
complexity of Riemann mapping |
| |
Ilia Binder,
Mark Braverman,
Michael Yampolsky |
|
|
| | Arkiv for Matematik, 45(2), 2007 |
[arXiv][bib] | |
| | |
| Termination of Integer Linear Programs |
| | Mark Braverman | |
| | CAV (Computer-Aided Verification) 2006 |
[pdf] [bib] | |
| | |
| Non-Computable Julia
Sets |
| | Mark Braverman,
Michael Yampolsky |
|
|
| | Journ. Amer. Math. Soc.
19(3), 2006 |
[arXiv][bib] | |
| | |
| Computing over the Reals: Foundations
for Scientific Computing |
| | Mark Braverman,
Stephen Cook |
| |
| | Notices of the
AMS, 53(3),
March 2006 |
[arXiv]
[bib] | |
| | |
| Parabolic Julia Sets are Polynomial Time Computable |
| | Mark Braverman | |
| | Nonlinearity 19, 2006 |
[arXiv][bib] | |
| | |
| On computational
complexity of Siegel Julia sets |
| |
Ilia Binder,
Mark Braverman,
Michael Yampolsky |
|
|
| | Commun. Math. Physics, 264(2), 2006 |
[arXiv] [bib] | |
| | |
| On the Complexity of
Real Functions |
| | Mark Braverman | |
| | FOCS 2005 |
[pdf]
[bib]
| |
| | Full version |
[arXiv] | |
| | |
| Hyperbolic Julia sets are poly-time
computable |
| | Mark Braverman | |
| | CCA (Computability and Complexity in Analysis) 2004,
ENTCS
120 |
[pdf] [bib] | |
