The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ilia Binder: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Ilia Binder, Mark Braverman
    Derandomization of Euclidean Random Walks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:353-365 [Conf]
  3. 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]

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


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


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