Theoretical Computer Science
A category of compositional domain-models for separable stone spaces
Theoretical Computer Science
Measuring the Probabilistic Powerdomain
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Measurement Process in Domain Theory
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
The Scott Topology Induces the Weak Topology
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Generalized metrics and uniquely determined logic programs
Theoretical Computer Science - Topology in computer science
Riemann and Edalat integration on domains
Theoretical Computer Science - Topology in computer science
Theoretical Computer Science - Topology in computer science
The regular spaces with countably based models
Theoretical Computer Science - Topology in computer science
Mathematical Structures in Computer Science
Measuring the probabilistic powerdomain
Theoretical Computer Science - Special issue on automata, languages and programming
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Partial metrisability of continuous posets
Mathematical Structures in Computer Science
On computational environments of topological spaces
Theoretical Computer Science
Static space–times naturally lead to quasi-pseudometrics
Theoretical Computer Science
Theoretical Computer Science
Lawson topology of the space of formal balls and the hyperbolic topology
Theoretical Computer Science
Reducibility of domain representations and cantor–weihrauch domain representations
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
The space of formal balls and models of quasi-metric spaces
Mathematical Structures in Computer Science
A quantitative computational model for complete partial metric spaces via formal balls†
Mathematical Structures in Computer Science
An Application of Martin-Löf Randomness to Effective Probability Theory
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Bicontinuous Domains and Some Old Problems in Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Domain theoretic characterisations of quasi-metric completeness in terms of formal balls†
Mathematical Structures in Computer Science
The formal ball model for -categories
Mathematical Structures in Computer Science
Noise vs computational intractability in dynamics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
An axiomatization of the theory of generalized ultrametric semilattices of linear signals
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Formal Contexts for Algebraic Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |