Michael Yampolsky

According to our database, Michael Yampolsky authored at least 15 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

High-Sensitivity CMOS-Integrated Floating Gate-Based UVC Sensors.

Michael Yampolsky, Evgeny Pikhay, Ruth Shima Edelstein, Yakov Roizin

Sensors, March, 2023

2022

Embedded UV Sensors in CMOS SOI Technology.

Michael Yampolsky, Evgeny Pikhay, Yakov Roizin

Sensors, 2022

Computability in Harmonic Analysis.

Ilia Binder, Adi Glucksam, Cristobal Rojas, Michael Yampolsky

Found. Comput. Math., 2022

2021

Real Quadratic Julia Sets Can Have Arbitrarily High Complexity.

Cristobal Rojas, Michael Yampolsky

Found. Comput. Math., 2021

2020

How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable.

Cristobal Rojas, Michael Yampolsky

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2018

Non computable Mandelbrot-like sets for a one-parameter complex family.

Daniel Coronel, Cristobal Rojas, Michael Yampolsky

Inf. Comput., 2018

Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set.

Artem Dudko, Michael Yampolsky

Found. Comput. Math., 2018

2014

Fixed Point of the Parabolic Renormalization Operator.

Oscar E. Lanford III, Michael Yampolsky

Springer Briefs in Mathematics, Springer, ISBN: 978-3-319-11706-5, 2014

2009

Computability of Julia Sets.

Mark Braverman, Michael Yampolsky

Algorithms and computation in mathematics 23, Springer, ISBN: 978-3-540-68546-3, 2009

2007

Filled Julia Sets with Empty Interior Are Computable.

Ilia Binder, Mark Braverman, Michael Yampolsky

Found. Comput. Math., 2007

Cylinder Renormalization of Siegel Disks.

Denis Gaidashev, Michael Yampolsky

Exp. Math., 2007

Constructing non-computable Julia sets.

Mark Braverman, Michael Yampolsky

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2005

On computational complexity of Riemann mapping

Ilia Binder, Mark Braverman, Michael Yampolsky

CoRR, 2005

On computational complexity of Siegel Julia sets

Ilia Binder, Mark Braverman, Michael Yampolsky

CoRR, 2005

2004

Non-computable Julia sets

Mark Braverman, Michael Yampolsky

CoRR, 2004