| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam |
Pebbles and Branching Programs for Tree Evaluation.  |
TOCT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren |
Truthful Mechanisms for Competing Submodular Processes |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Alexander Grigo, Cristobal Rojas |
Noise vs computational intractability in dynamics |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng |
I Like Her more than You: Self-determined Communities |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Alexander Grigo, Cristobal Rojas |
Noise vs computational intractability in dynamics. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
Towards deterministic tree code constructions. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
Interactive information complexity. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
Towards deterministic tree code constructions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman |
Interactive information complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Omri Weinstein |
A discrepancy lower bound for information complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman |
Poly-logarithmic independence fools bounded-depth boolean circuits. |
Commun. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Information Equals Amortized Communication |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Omri Weinstein |
A discrepancy lower bound for information complexity |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Per Austrin, Mark Braverman, Eden Chlamtac |
Inapproximability of NP-Complete Variants of Nash Equilibrium |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Itai Ashlagi, Mark Braverman, Avinatan Hassidim |
Matching with couples revisited. |
ACM Conference on Electronic Commerce |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Mark Braverman, Eden Chlamtac |
Inapproximability of NP-Complete Variants of Nash Equilibrium. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Avinatan Hassidim, Yael Tauman Kalai |
Leaky Pseudo-Entropy Functions. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Information Equals Amortized Communication. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor |
The Grothendieck Constant is Strictly Smaller than Krivine's Bound. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Towards coding for maximum errors in interactive communication. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
Pseudorandom Generators for Regular Branching Programs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Towards Coding for Maximum Errors in Interactive Communication. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Efficient Communication Using Partial Information. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman |
Polylogarithmic independence fools AC0 circuits. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Ashlagi, Mark Braverman, Avinatan Hassidim |
Matching with Couples Revisited |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Mark Braverman |
Approximate Nash Equilibria under Stability Conditions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam |
Pebbles and Branching Programs for Tree Evaluation |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
Pseudorandom Generators for Regular Branching Programs. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Mark Braverman, Xi Chen, Anup Rao |
How to compress interactive communication. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
Poly-logarithmic independence fools AC0 circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Mark Braverman, Xi Chen, Anup Rao |
Direct Sums in Randomized Communication Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy |
Space-Efficient Counting in Graphs on Surfaces. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Elchanan Mossel |
Sorting from Noisy Information |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ilia Binder, Mark Braverman |
The complexity of simulating Brownian Motion. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
Branching Programs for Tree Evaluation. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
Computability and Complexity of Julia Sets (Invited Talk). |
CCA |
2009 |
DBLP BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Mark Braverman |
Finding Low Error Clusterings. |
COLT |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman |
Poly-logarithmic Independence Fools AC0 Circuits. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
Fractional Pebbling and Thrifty Branching Programs. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
On ad hoc routing with guaranteed delivery |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi |
The complexity of properly learning simple concept classes. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Elchanan Mossel |
Noisy sorting without resampling. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
On ad hoc routing with guaranteed delivery. |
PODC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Binder, Mark Braverman, Michael Yampolsky |
Filled Julia Sets with Empty Interior Are Computable. |
Foundations of Computational Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy |
Parity Problems in Planar Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Elchanan Mossel |
Noisy Sorting Without Resampling |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ilia Binder, Mark Braverman |
Derandomization of Euclidean Random Walks. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy |
Parity Problems in Planar Graphs. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Michael Yampolsky |
Constructing non-computable Julia sets. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Julia sets, real computation, computability, dynamical systems |
| 1 | Mark Braverman, Michael Yampolsky |
Constructing Non-Computable Julia Sets |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman |
Termination of Integer Linear Programs. |
CAV |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
Hyperbolic Julia Sets are Poly-Time Computable. |
Electr. Notes Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman |
On the Complexity of Real Functions |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ilia Binder, Mark Braverman, Michael Yampolsky |
On computational complexity of Riemann mapping |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Stephen A. Cook |
Computing over the Reals: Foundations for Scientific Computing |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ilia Binder, Mark Braverman, Michael Yampolsky |
On computational complexity of Siegel Julia sets |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman |
On the Complexity of Real Functions. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Binder, Mark Braverman, Michael Yampolsky |
Filled Julia sets with empty interior are computable |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Michael Yampolsky |
Non-computable Julia sets |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi |
Learnability and Automatizability. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")