The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Yampolsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark Braverman, Michael Yampolsky
    Non-computable Julia sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  2. 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]
  3. Mark Braverman, Michael Yampolsky
    Constructing non-computable Julia sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:709-716 [Conf]
  4. 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]
  5. Mark Braverman, Michael Yampolsky
    Constructing Non-Computable Julia Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

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


Search in 0.002secs, Finished in 0.002secs
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