default search action
Michael Yampolsky
2020 – today
- 2023
- [j8]Michael Yampolsky, Evgeny Pikhay, Ruth Shima Edelstein, Yakov Roizin:
High-Sensitivity CMOS-Integrated Floating Gate-Based UVC Sensors. Sensors 23(5): 2509 (2023) - 2022
- [j7]Ilia Binder, Adi Glucksam, Cristobal Rojas, Michael Yampolsky:
Computability in Harmonic Analysis. Found. Comput. Math. 22(3): 849-873 (2022) - [j6]Michael Yampolsky, Evgeny Pikhay, Yakov Roizin:
Embedded UV Sensors in CMOS SOI Technology. Sensors 22(3): 712 (2022) - 2021
- [j5]Cristobal Rojas, Michael Yampolsky:
Real Quadratic Julia Sets Can Have Arbitrarily High Complexity. Found. Comput. Math. 21(1): 59-69 (2021) - 2020
- [c2]Cristobal Rojas, Michael Yampolsky:
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable. STOC 2020: 1066-1072
2010 – 2019
- 2019
- [i7]Cristobal Rojas, Michael Yampolsky:
Real quadratic Julia sets can have arbitrarily high complexity. CoRR abs/1904.06204 (2019) - [i6]Cristobal Rojas, Michael Yampolsky:
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non computable. CoRR abs/1910.09625 (2019) - 2018
- [j4]Artem Dudko, Michael Yampolsky:
Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set. Found. Comput. Math. 18(5): 1233-1243 (2018) - [j3]Daniel Coronel, Cristobal Rojas, Michael Yampolsky:
Non computable Mandelbrot-like sets for a one-parameter complex family. Inf. Comput. 262: 110-122 (2018) - 2014
- [b2]Oscar E. Lanford III, Michael Yampolsky:
Fixed Point of the Parabolic Renormalization Operator. Springer Briefs in Mathematics, Springer 2014, ISBN 978-3-319-11706-5, pp. I-VIII, 1-110
2000 – 2009
- 2009
- [b1]Mark Braverman, Michael Yampolsky:
Computability of Julia Sets. Algorithms and computation in mathematics 23, Springer 2009, ISBN 978-3-540-68546-3, pp. I-XIII, 1-151 - 2007
- [j2]Denis Gaidashev, Michael Yampolsky:
Cylinder Renormalization of Siegel Disks. Exp. Math. 16(2): 215-226 (2007) - [j1]Ilia Binder, Mark Braverman, Michael Yampolsky:
Filled Julia Sets with Empty Interior Are Computable. Found. Comput. Math. 7(4): 405-416 (2007) - [c1]Mark Braverman, Michael Yampolsky:
Constructing non-computable Julia sets. STOC 2007: 709-716 - 2006
- [i5]Mark Braverman, Michael Yampolsky:
Constructing Non-Computable Julia Sets. CoRR abs/math/0604371 (2006) - 2005
- [i4]Ilia Binder, Mark Braverman, Michael Yampolsky:
On computational complexity of Siegel Julia sets. CoRR abs/math/0502354 (2005) - [i3]Ilia Binder, Mark Braverman, Michael Yampolsky:
On computational complexity of Riemann mapping. CoRR abs/math/0505617 (2005) - 2004
- [i2]Mark Braverman, Michael Yampolsky:
Non-computable Julia sets. CoRR math.DS/0406416 (2004) - [i1]Ilia Binder, Mark Braverman, Michael Yampolsky:
Filled Julia sets with empty interior are computable. CoRR math.DS/0410580 (2004)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint