The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mark Braverman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark Braverman
    Termination of Integer Linear Programs. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:372-385 [Conf]
  2. Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi
    Learnability and Automatizability. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:621-630 [Conf]
  3. Mark Braverman
    On the Complexity of Real Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:155-164 [Conf]
  4. Mark Braverman, Michael Yampolsky
    Non-computable Julia sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  5. Ilia Binder, Mark Braverman, Michael Yampolsky
    Filled Julia sets with empty interior are computable [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  6. Mark Braverman
    Hyperbolic Julia Sets are Poly-Time Computable. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:120, n:, pp:17-30 [Journal]
  7. Ilia Binder, Mark Braverman
    Derandomization of Euclidean Random Walks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:353-365 [Conf]
  8. Mark Braverman, Raghav Kulkarni, Sambuddha Roy
    Parity Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:222-235 [Conf]
  9. Mark Braverman, Michael Yampolsky
    Constructing non-computable Julia sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:709-716 [Conf]
  10. Mark Braverman
    On the Complexity of Real Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  11. Ilia Binder, Mark Braverman, Michael Yampolsky
    On computational complexity of Siegel Julia sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  12. Mark Braverman, Michael Yampolsky
    Constructing Non-Computable Julia Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  13. Mark Braverman, Elchanan Mossel
    Noisy Sorting Without Resampling [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  14. Computability and Complexity of Julia Sets (Invited Talk). [Citation Graph (, )][DBLP]


  15. Poly-logarithmic Independence Fools AC0 Circuits. [Citation Graph (, )][DBLP]


  16. Fractional Pebbling and Thrifty Branching Programs. [Citation Graph (, )][DBLP]


  17. Branching Programs for Tree Evaluation. [Citation Graph (, )][DBLP]


  18. On ad hoc routing with guaranteed delivery. [Citation Graph (, )][DBLP]


  19. Noisy sorting without resampling. [Citation Graph (, )][DBLP]


  20. The complexity of simulating Brownian Motion. [Citation Graph (, )][DBLP]


  21. How to compress interactive communication. [Citation Graph (, )][DBLP]


  22. Space-Efficient Counting in Graphs on Surfaces. [Citation Graph (, )][DBLP]


  23. On computational complexity of Riemann mapping [Citation Graph (, )][DBLP]


  24. Computing over the Reals: Foundations for Scientific Computing [Citation Graph (, )][DBLP]


  25. On ad hoc routing with guaranteed delivery [Citation Graph (, )][DBLP]


  26. Sorting from Noisy Information [Citation Graph (, )][DBLP]


  27. Pebbles and Branching Programs for Tree Evaluation [Citation Graph (, )][DBLP]


  28. Approximate Nash Equilibria under Stability Conditions [Citation Graph (, )][DBLP]


  29. Parity Problems in Planar Graphs. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002