Some complexity issues on the simply connected regions of the two-dimensional plane
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A comparison of identification criteria for inductive inference of recursive real-valued functions
Theoretical Computer Science - Algorithmic learning theory
Uniform computational complexity of the derivatives of C∞-functions
Theoretical Computer Science
Effectively closed sets and graphs of computable real functions
Theoretical Computer Science
Effective metric spaces and representations of the reals
Theoretical Computer Science
Real functions computable by finite automata using affine representations
Theoretical Computer Science
The closure properties on real numbers under limits and computable operators
Theoretical Computer Science
Theoretical Computer Science
Presentations of computably enumerable reals
Theoretical Computer Science
Real computations with fake numbers
Journal of Complexity
An analog characterization of the Grzegorczyk hierarchy
Journal of Complexity
Computable Versions of Baire's Category Theorem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The Wave Propagator Is Turing Computable
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Random Numbers and an Incomplete Immune Recursive Set
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Baire Category and Nowhere Differentiability for Feasible Real Functions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Effective Jordan Decomposability
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Inversion Problem for Computable Linear Operators
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Closure Properties of Real Number Classes under Limits and Computable Operators
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Weakly Computable Real Numbers and Total Computable Real Functions
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Turing Computability of a Nonlinear Schrödinger Propagator
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Computing the Dimension of Linear Subspaces
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
The Complexity of Real Recursive Functions
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Polynomially Time Computable Functions over p-Adic Fields
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
A Survey of Exact Arithmetic Implementations
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Admissible Representations of Limit Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Standard Representations of Effective Metric Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
The iRRAM: Exact Arithmetic in C++
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued Functions
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Random elements in effective topological spaces with measure
Information and Computation
Real PCF extended with integration
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
Continuous-time computation with restricted integration capabilities
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Computability in linear algebra
Theoretical Computer Science
Computability versus exact computability of martingales
Information Processing Letters
The computational complexity of distance functions of two-dimensional domains
Theoretical Computer Science
On the Complexity of Real Functions
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Three concepts of decidability for general subsets of uncountable spaces
Theoretical Computer Science - Real numbers and computers
Stability versus speed in a computable algebraic model
Theoretical Computer Science - Real numbers and computers
A computable version of the Daniell-Stone theorem on integration and linear functionals
Theoretical Computer Science
Effectively open real functions
Journal of Complexity
Towards computability of elliptic boundary value problems in variational formulation
Journal of Complexity
The basic feasible functionals in computable analysis
Journal of Complexity
Computing Schrödinger propagators on Type-2 Turing machines
Journal of Complexity
On the Complexity of the Pancake Problem
Electronic Notes in Theoretical Computer Science (ENTCS)
Computable Riesz Representation for the Dual of C [0;1]
Electronic Notes in Theoretical Computer Science (ENTCS)
Primitive Recursiveness of Real Numbers under Different Representations
Electronic Notes in Theoretical Computer Science (ENTCS)
Jordan Curves with Polynomial Inverse Moduli of Continuity
Electronic Notes in Theoretical Computer Science (ENTCS)
The Methods of Approximation and Lifting in Real Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
RealLib: An efficient implementation of exact real arithmetic
Mathematical Structures in Computer Science
Constructing non-computable Julia sets
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Jordan curves with polynomial inverse moduli of continuity
Theoretical Computer Science
E2 -computability of e, π and Other Famous Constants
Electronic Notes in Theoretical Computer Science (ENTCS)
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of Operators on Compact Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of Probabilistic Computability on Represented Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Are unbounded linear operators computable on the average for Gaussian measures?
Journal of Complexity
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
Dimensions of Points in Self-similar Fractals
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Electronic Notes in Theoretical Computer Science (ENTCS)
Lower Bounds on the Continuation of Holomorphic Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing Solutions of Symmetric Hyperbolic Systems of PDE's
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterizing Computable Analysis with Differential Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantum Information Processing
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
On computably locally compact hausdorff spaces
Mathematical Structures in Computer Science
A computable approach to measure and integration theory
Information and Computation
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Computability of Analytic Functions with Analytic Machines
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Abstract Geometrical Computation and Computable Analysis
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Computing Domains of Attraction for Planar Dynamics
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Borel Complexity of Hahn-Banach Extensions
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchies of Function Classes Defined by the First-Value Operator
Electronic Notes in Theoretical Computer Science (ENTCS)
Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability versus exact computability of martingales
Information Processing Letters
Exact error estimates and optimal randomized algorithms for integration
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Computability on subsets of locally compact spaces
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Using approximation to relate computational classes over the reals
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Complexity theory for operators in analysis
Proceedings of the forty-second ACM symposium on Theory of computing
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Graph homomorphisms with complex values: a dichotomy theorem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Robust computations with dynamical systems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Polynomial time computation in the context of recursive analysis
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
A characterization of computable analysis on unbounded domains using differential equations
Information and Computation
Solving analytic differential equations in polynomial time over unbounded domains
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Multi-resolution cellular automata for real computation
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Semantics and Computability of the Evolution of Hybrid Systems
SIAM Journal on Control and Optimization
Computational Complexity of Holant Problems
SIAM Journal on Computing
Noise vs computational intractability in dynamics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Coinductive proofs for basic real computation
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Admissible representations in computable analysis
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A computability theory of real numbers
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
On the complexity of computing the logarithm and square root functions on a complex domain
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On some complexity issues of NC analytic functions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Prediction of recursive real-valued functions from finite examples
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
Complexity and intensionality in a type-1 framework for computable analysis
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Computing with sequences, weak topologies and the axiom of choice
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Computation of algebraic numbers and arithmetic operations over them with linear memory
Automation and Remote Control
A survey of recursive analysis and Moore's notion of real computation
Natural Computing: an international journal
Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Complexity Theory for Operators in Analysis
ACM Transactions on Computation Theory (TOCT)
Original article: Computational complexity of iterated maps on the interval
Mathematics and Computers in Simulation
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Theoretical Computer Science
δ-complete decision procedures for satisfiability over the reals
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Delta-Decidability over the Reals
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Computational complexity of smooth differential equations
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Computable Approximations of Reals: An Information-Theoretic Analysis
Fundamenta Informaticae
Computability on random events and variables in a computable probability space
Theoretical Computer Science
A novel information transmission problem and its optimal solution
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On the representations of NC and log-space real numbers
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
On logarithmic-space computable real numbers
Theoretical Computer Science
On Effective Convergence of Numerical Solutions for Differential Equations
ACM Transactions on Computation Theory (TOCT)
On the Query Complexity of Real Functionals
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |