Mark Braverman

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
20042021

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2012

    Interactive information complexity

    Braverman, M., 2012, STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. p. 505-524 20 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    71 Scopus citations
  • Noise vs computational intractability in dynamics

    Braverman, M., Grigo, A. & Rojas, C., Feb 6 2012, ITCS 2012 - Innovations in Theoretical Computer Science Conference. p. 128-141 14 p. (ITCS 2012 - Innovations in Theoretical Computer Science Conference).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Scopus citations
  • Towards deterministic tree code constructions

    Braverman, M., Feb 6 2012, ITCS 2012 - Innovations in Theoretical Computer Science Conference. p. 161-167 7 p. (ITCS 2012 - Innovations in Theoretical Computer Science Conference).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    45 Scopus citations
  • 2011

    Inapproximability of NP-complete variants of Nash equilibrium

    Austrin, P., Braverman, M. & Chlamtáč, E., 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 13-25 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • Information equals amortized communication

    Braverman, M. & Rao, A., Dec 1 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 748-757 10 p. 6108245. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    93 Scopus citations
  • Matching with couples revisited

    Ashlagi, I., Braverman, M. & Hassidim, A., 2011, EC'11 - Proceedings of the 12th ACM Conference on Electronic Commerce. p. 335 1 p. (Proceedings of the ACM Conference on Electronic Commerce).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Scopus citations
  • The Grothendieck constant is strictly smaller than Krivine's bound

    Braverman, M., Makarychev, K., Makarychev, Y. & Naor, A., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 453-462 10 p. 6108206. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    22 Scopus citations
  • Towards coding for maximum errors in interactive communication

    Braverman, M. & Rao, A., 2011, STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing. p. 159-166 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    60 Scopus citations
  • 2010

    How to compress interactive communication

    Barak, B., Braverman, M., Chen, X. & Rao, A., Jul 23 2010, STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing. p. 67-76 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    96 Scopus citations
  • Pseudorandom generators for regular branching programs

    Braverman, M., Rao, A., Raz, R. & Yehudayoff, A., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 40-47 8 p. 5670950. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    33 Scopus citations
  • 2009

    Branching programs for tree evaluation

    Braverman, M., Cook, S., McKenzie, P., Santhanam, R. & Wehr, D., 2009, Mathematical Foundations of Computer Science 2009 - 34th International Symposium, MFCS 2009, Proceedings. p. 175-186 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5734 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • Computability and complexity of Julia sets (invited talk)

    Braverman, M., Nov 2009, Proceedings of the 6th International Conference on Computability and Complexity in Analysis, CCA 2009. Bauer, A., Hertling, P. & Ko, K-I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 1 p. (OpenAccess Series in Informatics; vol. 11).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Fractional pebbling and thrifty branching programs

    Braverman, M., Cook, S., McKenzie, P., Santhanam, R. & Wehr, D., Dec 1 2009, Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009 - 29th Annual Conference, Proceedings. p. 109-120 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 4).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • Poly-logarithmic independence fools AC0 circuits

    Braverman, M., 2009, Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity, CCC 2009. p. 3-8 6 p. 5231177. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    23 Scopus citations
  • The complexity of simulating Brownian Motion

    Binder, I. & Braverman, M., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, p. 58-67 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    3 Scopus citations
  • 2008

    Brief announcement: On ad hoc routing with guaranteed delivery

    Braverman, M., Dec 17 2008, PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing. 1 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • Noisy sorting without resampling

    Braverman, M. & Mossel, E., Dec 1 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 268-276 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    103 Scopus citations
  • 2007

    Constructing non-computable Julia sets

    Braverman, M. & Yampolsky, M., 2007, STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. p. 709-716 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Scopus citations
  • Derandomization of euclidean random walks

    Binder, I. & Braverman, M., 2007, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings. Springer Verlag, p. 353-365 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4627 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Scopus citations
  • Parity problems in planar graphs

    Braverman, M., Kulkarni, R. & Roy, S., Oct 2 2007, Proceedings - Twenty-Second Annual IEEE Conference on Computational Complexity, CCC 2007. p. 222-235 14 p. 4262766. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Scopus citations
  • 2006

    Termination of integer linear programs

    Braverman, M., Jan 1 2006, Computer Aided Verification - 18th International Conference, CAV 2006, Proceedings. Springer Verlag, p. 372-385 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4144 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    85 Scopus citations
  • 2005

    On the complexity of real functions

    Braverman, M., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 155-164 10 p. 1530710. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    31 Scopus citations