Keye Martin

dblp:95/6030 · DBLP profile ↗
← Back
15ranked-venue papers
14as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 14 · 13 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Logic in computer science · 70% Quantum computing and quantum information · 23% Information theory · 4%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
domain theory
0.142008
Entropy as a Fixed Point · ICALP 2004
Measuring the Probabilistic Powerdomain · ICALP 2002
The Measurement Process in Domain Theory · ICALP 2000
Quantum computing and quantum information
quantum channel
0.112008
A Domain Theoretic Model of Qubit Channels · ICALP (2) 2008
Logic in computer science › domain theory
fixed points
0.012004
Entropy as a Fixed Point · ICALP 2004
Logic in computer science › domain theory
probabilistic power domain
0.012002
Measuring the Probabilistic Powerdomain · ICALP 2002
Information theory › information measures
entropy
0.012004
Entropy as a Fixed Point · ICALP 2004
YearPublicationVenuePosition
2019 A new fixed point theorem in domain theory
Keye Martin, Johnny Feng
Nat. Comput.1
2012 Teleportation with an imperfect state
Marco Lanzagorta, Keye Martin
Theor. Comput. Sci.2
2010 Algebraic information theory for binary channels
Keye Martin, Ira S. Moskowitz, Gerard Allwein
Theor. Comput. Sci.1
2008 Domain Theory and the Causal Structure of Space-Time
Keye Martin, Prakash Panangaden
CiE1
2008 A Domain Theoretic Model of Qubit Channels
Keye Martin
ICALP (2)1
2008 Topology in information theory in topology
Keye Martin
Theor. Comput. Sci.1
2006 Entropy as a fixed point
Keye Martin
Theor. Comput. Sci.1
2004 Entropy as a Fixed Point
Keye Martin
ICALP1
2004 Fractals and domain theory
abstract
We show that a measurement $\mu$ on a continuous dcpo $D$ extends to a measurement $\skew3\bar{\mu}$ on the convex powerdomain ${\mathbf C} D$ iff it is a Lebesgue measurement. In particular, $\ker\mu$ must be metrisable in its relative Scott topology. Moreover, the space $\ker\skew3\bar{\mu}$ in its relative Scott topology is homeomorphic to the Vietoris hyperspace of $\ker\mu$ , that is, the space of non-empty compact subsets of $\ker\mu$ in its Vietoris topology – the topology induced by any Hausdorff metric. This enables one to show that Hutchinson's theorem holds for any finite set of contractions on a domain with a Lebesgue measurement. Finally, after resolving the existence question for Lebesgue measurements on countably based domains, we uncover the following relationship between classical analysis and domain theory: for an $\omega$ -continuous dcpo $D$ with $\max(D)$ regular, the Vietoris hyperspace of $\max(D)$ embeds in $\max({\mathbf C} D)$ as the kernel of a measurement on ${\mathbf C} D$ .
Keye Martin
Math. Struct. Comput. Sci.1
2004 Measuring the probabilistic powerdomain
Keye Martin, Michael W. Mislove, James Worrell 0001
Theor. Comput. Sci.1
2003 Ideal models of spaces
Keye Martin
Theor. Comput. Sci.1
2003 The regular spaces with countably based models
Keye Martin
Theor. Comput. Sci.1
2002 The Informatic Derivative at a Compact Element
Keye Martin
FoSSaCS1
2002 Measuring the Probabilistic Powerdomain
Keye Martin, Michael W. Mislove, James Worrell 0001
ICALP1
2000 The Measurement Process in Domain Theory
Keye Martin
ICALP1