The Kantorovich Metric in Computer Science: A Brief Survey
Authors:
Open Access
- 1 November 2009
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 253 (3) , 73-82
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Probabilistic Barbed CongruenceElectronic Notes in Theoretical Computer Science, 2007
- Recursively defined metric spaces without contractionTheoretical Computer Science, 2007
- Approximating and computing behavioural distances in probabilistic transition systemsTheoretical Computer Science, 2006
- Metrics for Action-labelled Quantitative Transition SystemsElectronic Notes in Theoretical Computer Science, 2006
- A behavioural pseudometric for probabilistic transition systemsTheoretical Computer Science, 2005
- Metrics for labelled Markov processesTheoretical Computer Science, 2004
- On Choosing and Bounding Probability MetricsInternational Statistical Review, 2002
- The Earth Mover's distance is the Mallows distance: some insights from statistics2002
- Deciding Bisimilarity and Similarity for Probabilistic ProcessesJournal of Computer and System Sciences, 2000
- Bisimulation through probabilistic testingInformation and Computation, 1991