Mark Braverman

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

Coauthor Index

1	Michael Alekhnovich	[3] [18]
2	Ilia Binder	[1] [5] [6] [12] [17] [23]
3	Stephen A. Cook	[7] [24]
4	Vitaly Feldman	[3] [18]
5	Adam R. Klivans (Adam Klivans)	[3] [18]
6	Raghav Kulkarni	[13] [16]
7	Pierre McKenzie	[24]
8	Elchanan Mossel	[14] [20] [22]
9	Toniann Pitassi	[3] [18]
10	Sambuddha Roy	[13] [16]
11	Rahul Santhanam	[24]
12	Dustin Wehr	[24]
13	Michael Yampolsky	[1] [2] [5] [6] [10] [12] [15]

Colors in the list of coauthors