On computational complexity of Siegel Julia sets - Ilia Binder; Mark Braverman; Michael Yampolsky (CoRR, 2005)

On computational complexity of Riemann mapping - Ilia Binder; Mark Braverman; Michael Yampolsky (CoRR, 2005)

Derandomization of Euclidean Random Walks. - Ilia Binder; Mark Braverman (APPROX-RANDOM, 2007)

Filled Julia Sets with Empty Interior Are Computable. - Ilia Binder; Mark Braverman; Michael Yampolsky (Found. Comput. Math., 2007)

The complexity of simulating Brownian Motion. - Ilia Binder; Mark Braverman (SODA, 2009)

Computability in Harmonic Analysis. - Ilia Binder; Adi Glucksam; Cristobal Rojas; Michael Yampolsky (Found. Comput. Math., 2022)