The SCEAS System
| |||||||

## Search the dblp DataBase
Mark Braverman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Mark Braverman
**Termination of Integer Linear Programs.**[Citation Graph (0, 0)][DBLP] CAV, 2006, pp:372-385 [Conf] - 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] - Mark Braverman
**On the Complexity of Real Functions.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:155-164 [Conf] - Mark Braverman, Michael Yampolsky
**Non-computable Julia sets**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - 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] - 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] - Ilia Binder, Mark Braverman
**Derandomization of Euclidean Random Walks.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:353-365 [Conf] - 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] - Mark Braverman, Michael Yampolsky
**Constructing non-computable Julia sets.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:709-716 [Conf] - Mark Braverman
**On the Complexity of Real Functions**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - 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] - Mark Braverman, Michael Yampolsky
**Constructing Non-Computable Julia Sets**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Mark Braverman, Elchanan Mossel
**Noisy Sorting Without Resampling**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Computability and Complexity of Julia Sets (Invited Talk).**[Citation Graph (, )][DBLP]**Poly-logarithmic Independence Fools AC**[Citation Graph (, )][DBLP]^{0}Circuits.**Fractional Pebbling and Thrifty Branching Programs.**[Citation Graph (, )][DBLP]**Branching Programs for Tree Evaluation.**[Citation Graph (, )][DBLP]**On ad hoc routing with guaranteed delivery.**[Citation Graph (, )][DBLP]**Noisy sorting without resampling.**[Citation Graph (, )][DBLP]**The complexity of simulating Brownian Motion.**[Citation Graph (, )][DBLP]**How to compress interactive communication.**[Citation Graph (, )][DBLP]**Space-Efficient Counting in Graphs on Surfaces.**[Citation Graph (, )][DBLP]**On computational complexity of Riemann mapping**[Citation Graph (, )][DBLP]**Computing over the Reals: Foundations for Scientific Computing**[Citation Graph (, )][DBLP]**On ad hoc routing with guaranteed delivery**[Citation Graph (, )][DBLP]**Sorting from Noisy Information**[Citation Graph (, )][DBLP]**Pebbles and Branching Programs for Tree Evaluation**[Citation Graph (, )][DBLP]**Approximate Nash Equilibria under Stability Conditions**[Citation Graph (, )][DBLP]**Parity Problems in Planar Graphs.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |