Michael Yampolsky

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 9

Top Topics

Linear Dynamical Systems

Reinforcement Learning Methods

Top Venues

Found. Comput. Math.

Publications

Michael Yampolsky, Evgeny Pikhay, Ruth Shima Edelstein, Yakov Roizin
High-Sensitivity CMOS-Integrated Floating Gate-Based UVC Sensors. Sensors 23 (5) (2023)
Michael Yampolsky, Evgeny Pikhay, Yakov Roizin
Embedded UV Sensors in CMOS SOI Technology. Sensors 22 (3) (2022)
Ilia Binder, Adi Glucksam, Cristobal Rojas, Michael Yampolsky
Computability in Harmonic Analysis. Found. Comput. Math. 22 (3) (2022)
Cristobal Rojas, Michael Yampolsky
Real Quadratic Julia Sets Can Have Arbitrarily High Complexity. Found. Comput. Math. 21 (1) (2021)
Cristobal Rojas, Michael Yampolsky
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable. STOC (2020)
Cristobal Rojas, Michael Yampolsky
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non computable. CoRR (2019)
Cristobal Rojas, Michael Yampolsky
Real quadratic Julia sets can have arbitrarily high complexity. CoRR (2019)
Daniel Coronel, Cristobal Rojas, Michael Yampolsky
Non computable Mandelbrot-like sets for a one-parameter complex family. Inf. Comput. 262 (2018)
Artem Dudko, Michael Yampolsky
Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set. Found. Comput. Math. 18 (5) (2018)
Ilia Binder, Mark Braverman, Michael Yampolsky
Filled Julia Sets with Empty Interior Are Computable. Found. Comput. Math. 7 (4) (2007)
Denis Gaidashev, Michael Yampolsky
Cylinder Renormalization of Siegel Disks. Exp. Math. 16 (2) (2007)
Mark Braverman, Michael Yampolsky
Constructing non-computable Julia sets. STOC (2007)
Mark Braverman, Michael Yampolsky
Constructing Non-Computable Julia Sets CoRR (2006)
Ilia Binder, Mark Braverman, Michael Yampolsky
On computational complexity of Riemann mapping CoRR (2005)
Ilia Binder, Mark Braverman, Michael Yampolsky
On computational complexity of Siegel Julia sets CoRR (2005)
Ilia Binder, Mark Braverman, Michael Yampolsky
Filled Julia sets with empty interior are computable CoRR (2004)
Mark Braverman, Michael Yampolsky
Non-computable Julia sets CoRR (2004)