M. Yampolsky

Identifiers

No identifiers captured yet.

Papers (3)

1. On computational complexity of Siegel Julia sets math.DS · 2005 · author #3
2. The rigidity problem for analytic critical circle maps math.DS · 2005 · author #2
3. Filled Julia sets with empty interior are computable math.DS · 2004 · author #3

Mentions

No mention provenance yet.

Frequent Coauthors

• I. Binder 2 shared papers
• M. Braverman 2 shared papers
• D. Khmelev 1 shared papers