Ilia Binder

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2009
c2		Ilia Binder, Mark Braverman: The complexity of simulating Brownian Motion. SODA 2009: 58-67
	2007
j1		Ilia Binder, Mark Braverman, Michael Yampolsky: Filled Julia Sets with Empty Interior Are Computable. Foundations of Computational Mathematics 7(4): 405-416 (2007)
c1		Ilia Binder, Mark Braverman: Derandomization of Euclidean Random Walks. APPROX-RANDOM 2007: 353-365
	2005
i3		Ilia Binder, Mark Braverman, Michael Yampolsky: On computational complexity of Siegel Julia sets. CoRR abs/math/0502354 (2005)
i2		Ilia Binder, Mark Braverman, Michael Yampolsky: On computational complexity of Riemann mapping. CoRR abs/math/0505617 (2005)
	2004
i1		Ilia Binder, Mark Braverman, Michael Yampolsky: Filled Julia sets with empty interior are computable. CoRR math.DS/0410580 (2004)

Coauthor Index

1	Mark Braverman	[c2] [j1] [c1] [i3] [i2] [i1]
2	Michael Yampolsky	[j1] [i3] [i2] [i1]

Last update Wed May 22 20:08:45 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page