Counting distance permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 437556 (Why is no real title available?)
- scientific article; zbMATH DE number 741007 (Why is no real title available?)
- scientific article; zbMATH DE number 871934 (Why is no real title available?)
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- A note on the metric properties of trees
- Advances in Cryptology - EUROCRYPT 2004
- Chaos in Dynamical Systems
- Counting distance permutations
- On Delaunay oriented matroids for convex distance functions
- On embedding trees into uniformly convex Banach spaces
- On the Least Cost for Proximity Searching in Metric Spaces
- Oriented Matroids
- Satisfying general proximity/similarity queries with metric trees
- Special issue: Selected papers from the 1st international workshop on similarity search and applications (SISAP 2008), Cancun, Mexico, April 11--12, 2008
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
Cited in
(4)
This page was built for publication: Counting distance permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013072)