Computable Complex Analysis
From MaRDI portal
Publication:5024570
DOI10.1007/978-3-030-59234-9_4zbMath1495.03060OpenAlexW3168158178MaRDI QIDQ5024570
Timothy H. McNicholl, Valentin V. Andreev
Publication date: 26 January 2022
Published in: Theory and Applications of Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-59234-9_4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An operator-theoretic existence proof of solutions to planar Dirichlet problems
- Fundamentals of parameterized complexity
- Computable Carathéodory theory
- Computability of Brolin-Lyubich measure
- Effective versions of local connectivity properties
- An effective Carathéodory theorem
- Computing conformal maps of finitely connected domains onto canonical slit domains
- Computing space-filling curves
- Conformal welding for finitely connected regions
- Estimating the error in the Koebe construction
- Untersuchungen zur Durchführung der konformen Abbildung mehrfach zusammenhängender Gebiete
- Effectively open real functions
- On the computational complexity of the Riemann mapping
- The constructive Jordan curve theorem
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- An effective Riemann Mapping Theorem
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
- Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
- Fixed points, Koebe uniformization and circle packings
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- A constructive Riemann mapping theorem
- Schwarz-Christoffel mapping of multiply connected domains
- On the theorem of Hayman and Wu
- Computing boundary extensions of conformal maps
- On the Computable Theory of Bounded Analytic Functions
- Compactness and the Effectivity of Uniformization
- Computing Conformal Maps onto Canonical Slit Domains
- The Hayman-Wu Constant
- On the definitions of computable real continuous functions
- Numerische Realisierung konformer Abbildungen durch „Interpolation”
- Computation of capacity
- Carathéodory’s Theorem and moduli of local connectivity
- Uniformly computable aspects of inner functions: estimation and factorization
- Geometric function theory: a modern view of a classical subject
- Derandomization of Euclidean Random Walks
- Harmonic Measure and Conformal Length
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
- On computable approximations of Landau's constant
- Effectiveness for Embedded Spheres and Balls
- History of the Riemann Mapping Theorem
- Convergence of a Variant of the Zipper Algorithm for Conformal Mapping
- Computable analysis and Blaschke products
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Nicht konstruktiv beweisbare Sätze der Analysis
- Two-dimensional Brownian motion and harmonic functions
This page was built for publication: Computable Complex Analysis
