Mark Braverman

	2012
60		Mark Braverman, Alexander Grigo, Cristobal Rojas: Noise vs computational intractability in dynamics. ITCS 2012: 128-141
59		Mark Braverman: Towards deterministic tree code constructions. ITCS 2012: 161-167
58		Mark Braverman: Interactive information complexity. STOC 2012: 505-524
57		Mark Braverman, Alexander Grigo, Cristobal Rojas: Noise vs computational intractability in dynamics CoRR abs/1201.0488: (2012)
56		Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng: I Like Her more than You: Self-determined Communities CoRR abs/1201.4899: (2012)
55		Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren: Truthful Mechanisms for Competing Submodular Processes CoRR abs/1202.2097: (2012)
54		Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam: Pebbles and Branching Programs for Tree Evaluation. TOCT 3(2): 4 (2012)
	2011
53		Itai Ashlagi, Mark Braverman, Avinatan Hassidim: Matching with couples revisited. ACM Conference on Electronic Commerce 2011: 335-336
52		Per Austrin, Mark Braverman, Eden Chlamtac: Inapproximability of NP-Complete Variants of Nash Equilibrium. APPROX-RANDOM 2011: 13-25
51		Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor: The Grothendieck Constant is Strictly Smaller than Krivine's Bound. FOCS 2011: 453-462
50		Mark Braverman, Anup Rao: Information Equals Amortized Communication. FOCS 2011: 748-757
49		Mark Braverman, Avinatan Hassidim, Yael Tauman Kalai: Leaky Pseudo-Entropy Functions. ICS 2011: 353-366
48		Mark Braverman, Anup Rao: Towards coding for maximum errors in interactive communication. STOC 2011: 159-166
47		Per Austrin, Mark Braverman, Eden Chlamtac: Inapproximability of NP-Complete Variants of Nash Equilibrium CoRR abs/1104.3760: (2011)
46		Mark Braverman, Anup Rao: Information Equals Amortized Communication CoRR abs/1106.3595: (2011)
45		Mark Braverman, Omri Weinstein: A discrepancy lower bound for information complexity CoRR abs/1112.2000: (2011)
44		Mark Braverman: Poly-logarithmic independence fools bounded-depth boolean circuits. Commun. ACM 54(4): 108-115 (2011)
43		Mark Braverman: Interactive information complexity. Electronic Colloquium on Computational Complexity (ECCC) 18: 123 (2011)
42		Mark Braverman, Omri Weinstein: A discrepancy lower bound for information complexity. Electronic Colloquium on Computational Complexity (ECCC) 18: 164 (2011)
41		Mark Braverman: Towards deterministic tree code constructions. Electronic Colloquium on Computational Complexity (ECCC) 18: 64 (2011)
	2010
40		Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff: Pseudorandom Generators for Regular Branching Programs. FOCS 2010: 40-47
39		Boaz Barak, Mark Braverman, Xi Chen, Anup Rao: How to compress interactive communication. STOC 2010: 67-76
38		Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam: Pebbles and Branching Programs for Tree Evaluation CoRR abs/1005.2642: (2010)
37		Maria-Florina Balcan, Mark Braverman: Approximate Nash Equilibria under Stability Conditions CoRR abs/1008.1827: (2010)
36		Itai Ashlagi, Mark Braverman, Avinatan Hassidim: Matching with Couples Revisited CoRR abs/1011.2121: (2010)
35		Mark Braverman, Anup Rao: Towards Coding for Maximum Errors in Interactive Communication. Electronic Colloquium on Computational Complexity (ECCC) 17: 166 (2010)
34		Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff: Pseudorandom Generators for Regular Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 17: 35 (2010)
33		Mark Braverman, Anup Rao: Efficient Communication Using Partial Information. Electronic Colloquium on Computational Complexity (ECCC) 17: 83 (2010)
32		Mark Braverman: Polylogarithmic independence fools AC0 circuits. J. ACM 57(5): (2010)
	2009
31		Mark Braverman: Computability and Complexity of Julia Sets (Invited Talk). CCA 2009
30		Maria-Florina Balcan, Mark Braverman: Finding Low Error Clusterings. COLT 2009
29		Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr: Fractional Pebbling and Thrifty Branching Programs. FSTTCS 2009: 109-120
28		Mark Braverman: Poly-logarithmic Independence Fools AC0 Circuits. IEEE Conference on Computational Complexity 2009: 3-8
27		Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr: Branching Programs for Tree Evaluation. MFCS 2009: 175-186
26		Ilia Binder, Mark Braverman: The complexity of simulating Brownian Motion. SODA 2009: 58-67
25		Mark Braverman, Elchanan Mossel: Sorting from Noisy Information CoRR abs/0910.1191: (2009)
24		Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Space-Efficient Counting in Graphs on Surfaces. Computational Complexity 18(4): 601-649 (2009)
23		Mark Braverman: Poly-logarithmic independence fools AC0 circuits. Electronic Colloquium on Computational Complexity (ECCC) 16: 11 (2009)
22		Boaz Barak, Mark Braverman, Xi Chen, Anup Rao: Direct Sums in Randomized Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 16: 44 (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	Itai Ashlagi	[36] [53]
3	Per Austrin	[47] [52]
4	Maria-Florina Balcan (Maria-Florina Popa)	[30] [37] [56]
5	Boaz Barak	[22] [39]
6	Ilia Binder	[1] [5] [6] [12] [17] [26]
7	Christian Borgs	[56]
8	Allan Borodin	[55]
9	Jennifer T. Chayes	[56]
10	Xi Chen	[22] [39]
11	Eden Chlamtac	[47] [52]
12	Stephen A. Cook	[7] [27] [29] [38] [54]
13	Vitaly Feldman	[3] [18]
14	Alexander Grigo	[57] [60]
15	Avinatan Hassidim	[36] [49] [53]
16	Yael Tauman Kalai (Yael Tauman)	[49]
17	Adam R. Klivans (Adam Klivans)	[3] [18]
18	Raghav Kulkarni	[13] [16] [24]
19	Brendan Lucier	[55]
20	Konstantin Makarychev	[51]
21	Yury Makarychev	[51]
22	Pierre McKenzie	[27] [29] [38] [54]
23	Elchanan Mossel	[14] [20] [25]
24	Assaf Naor	[51]
25	Joel Oren	[55]
26	Toniann Pitassi	[3] [18]
27	Anup Rao	[22] [33] [34] [35] [39] [40] [46] [48] [50]
28	Ran Raz	[34] [40]
29	Cristobal Rojas	[57] [60]
30	Sambuddha Roy	[13] [16] [24]
31	Rahul Santhanam	[27] [29] [38] [54]
32	Shang-Hua Teng	[56]
33	Dustin Wehr	[27] [29] [38] [54]
34	Omri Weinstein	[42] [45]
35	Michael Yampolsky	[1] [2] [5] [6] [10] [12] [15]
36	Amir Yehudayoff	[34] [40]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page