Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Baranovskii, E. P.
1971.
Progress in Mathematics.
p.
209.
Fritz, J.
1975.
Distribution-free exponential error bound for nearest neighbor pattern classification.
IEEE Transactions on Information Theory,
Vol. 21,
Issue. 5,
p.
552.
Bennett, G.
Dor, L. E.
Goodman, V.
Johnson, W. B.
and
Newman, C. M.
1977.
On uncomplemented subspaces ofL p , 1 <p <2.
Israel Journal of Mathematics,
Vol. 26,
Issue. 2,
p.
178.
Devroye, L.
and
Wagner, T.
1979.
Distribution-free inequalities for the deleted and holdout error estimates.
IEEE Transactions on Information Theory,
Vol. 25,
Issue. 2,
p.
202.
Tóth, G. Fejes
1979.
Multiple packing and covering of spheres.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 34,
Issue. 1-2,
p.
165.
Tóth, G. Fejes
1983.
Convexity and Its Applications.
p.
318.
1987.
Geometry of Numbers.
Vol. 37,
Issue. ,
p.
632.
Schramm, Oded
1988.
Illuminating sets of constant width.
Mathematika,
Vol. 35,
Issue. 2,
p.
180.
Solé, Patrick
1991.
The Covering Radius of Spherical Designs.
European Journal of Combinatorics,
Vol. 12,
Issue. 5,
p.
423.
Bourgain, J.
and
Lindenstrauss, J.
1991.
Geometric Aspects of Functional Analysis.
Vol. 1469,
Issue. ,
p.
138.
Zeger, K.
and
Gersho, A.
1994.
Number of nearest neighbors in a Euclidean code.
IEEE Transactions on Information Theory,
Vol. 40,
Issue. 5,
p.
1647.
Zeger, K.
and
Gersho, A.
1994.
How many points in Euclidean space can have a common nearest neighbor?.
p.
109.
Chandra, Barun
1994.
Constructing sparse spanners for most graphs in higher dimensions.
Information Processing Letters,
Vol. 51,
Issue. 6,
p.
289.
Srinivasan, M.
and
Sarwate, D.V.
1994.
Malfunction in the Peterson-Gorenstein-Zierler decoder.
IEEE Transactions on Information Theory,
Vol. 40,
Issue. 5,
p.
1649.
Ivashchuk, V D
and
Melnikov, V N
1995.
Billiard representation for multidimensional cosmology with multicomponent perfect fluid near the singularity.
Classical and Quantum Gravity,
Vol. 12,
Issue. 3,
p.
809.
Fischer, M.
Meyer auf der Heide, F.
and
Strothmann, W. -B.
1997.
Algorithms — ESA '97.
Vol. 1284,
Issue. ,
p.
157.
Chandra, Barun
Karloff, Howard
and
Tovey, Craig
1999.
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem.
SIAM Journal on Computing,
Vol. 28,
Issue. 6,
p.
1998.
RICHARDS, DANA
and
SALOWE, JEFFREY S.
1999.
MIXED SPANNING TREES IN THEORY AND PRACTICE.
International Journal of Computational Geometry & Applications,
Vol. 09,
Issue. 03,
p.
277.
Ivashchuk, V. D.
and
Melnikov, V. N.
2000.
Billiard representation for multidimensional cosmology with intersecting p-branes near the singularity.
Journal of Mathematical Physics,
Vol. 41,
Issue. 9,
p.
6341.
Райгородский, Андрей Михайлович
and
Raigorodskii, Andrei Mikhailovich
2001.
Проблема Борсука и хроматические числа некоторых метрических пространств.
Успехи математических наук,
Vol. 56,
Issue. 1,
p.
107.