Michael Yampolsky

19 papers A* 2Journal 15

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	High-Sensitivity CMOS-Integrated Floating Gate-Based UVC Sensors. Sensors Michael Yampolsky, Evgeny Pikhay, Ruth Shima Edelstein, Yakov Roizin
2022	J	`jnl`	Computability in Harmonic Analysis. Found. Comput. Math. Ilia Binder, Adi Glucksam, Cristobal Rojas, Michael Yampolsky
2022	J	`jnl`	Embedded UV Sensors in CMOS SOI Technology. Sensors Michael Yampolsky, Evgeny Pikhay, Yakov Roizin
2021	J	`jnl`	Real Quadratic Julia Sets Can Have Arbitrarily High Complexity. Found. Comput. Math. Cristobal Rojas, Michael Yampolsky
2020	A*	`conf`	How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable. STOC Cristobal Rojas, Michael Yampolsky
2019	J	`jnl`	How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non computable. CoRR Cristobal Rojas, Michael Yampolsky
2019	J	`jnl`	Real quadratic Julia sets can have arbitrarily high complexity. CoRR Cristobal Rojas, Michael Yampolsky
2018	J	`jnl`	Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set. Found. Comput. Math. Artem Dudko, Michael Yampolsky
2018	J	`jnl`	Non computable Mandelbrot-like sets for a one-parameter complex family. Inf. Comput. Daniel Coronel, Cristobal Rojas, Michael Yampolsky
2014	—	`book`	Fixed Point of the Parabolic Renormalization Operator. Oscar E. Lanford III, Michael Yampolsky
2009	—	`book`	Computability of Julia Sets. Mark Braverman, Michael Yampolsky
2007	A*	`conf`	Constructing non-computable Julia sets. STOC Mark Braverman, Michael Yampolsky
2007	J	`jnl`	Cylinder Renormalization of Siegel Disks. Exp. Math. Denis Gaidashev, Michael Yampolsky
2007	J	`jnl`	Filled Julia Sets with Empty Interior Are Computable. Found. Comput. Math. Ilia Binder, Mark Braverman, Michael Yampolsky
2006	J	`jnl`	Constructing Non-Computable Julia Sets CoRR Mark Braverman, Michael Yampolsky
2005	J	`jnl`	On computational complexity of Riemann mapping CoRR Ilia Binder, Mark Braverman, Michael Yampolsky
2005	J	`jnl`	On computational complexity of Siegel Julia sets CoRR Ilia Binder, Mark Braverman, Michael Yampolsky
2004	J	`jnl`	Filled Julia sets with empty interior are computable CoRR Ilia Binder, Mark Braverman, Michael Yampolsky
2004	J	`jnl`	Non-computable Julia sets CoRR Mark Braverman, Michael Yampolsky