{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:13:26Z","timestamp":1768900406854,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01299744","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T04:14:22Z","timestamp":1111724062000},"page":"379-408","source":"Crossref","is-referenced-by-count":12,"title":["Point sets with distinct distances"],"prefix":"10.1007","volume":"15","author":[{"given":"Hanno","family":"Lefmann","sequence":"first","affiliation":[]},{"given":"Torsten","family":"Thiele","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"N. Alon, L. Babai, andA. Itai: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem,Journal of Algorithms,7 (1986), 567?583.","journal-title":"Journal of Algorithms"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0097-3165(82)90049-8","volume":"32","author":"M. Ajtai","year":"1982","unstructured":"M. Ajtai, J. Koml\u00f3s, J. Pintz, J. Spencer, andE. Szemer\u00e9di: Extremal Uncrowded Hypergraphs,J. Comb. Theory (Ser. A),32 (1982), 321?335.","journal-title":"J. Comb. Theory (Ser. A)"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0195-6698(85)80027-5","volume":"6","author":"N. Alon","year":"1985","unstructured":"N. Alon, andP. Erd?s: An Application of Graph Theory to Additive Number Theory,European Journal of Combinatorics,6 (1985), 201?203.","journal-title":"European Journal of Combinatorics"},{"key":"CR4","unstructured":"N. Alon, H. Lefmann, andV. R\u00f6dl: On an Anti-Ramsey Type Result,Colloquia Mathematica Societatis J\u00e1nos Bolyai, 60. Sets, Graphs and Numbers, Budapest (1991), 9?22."},{"key":"CR5","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"N. Alon, andJ. Spencer: The Probabilistic Method,Wiley & Sons, New York, (1992)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-7721(91)90009-4","volume":"1","author":"D. Avis","year":"1991","unstructured":"D. Avis, P. Erd?s, andJ. Pach: Distinct Distances Determined by Subsets of a Point Set in Space,Computational Geometry 1, (1991), 1?11.","journal-title":"Computational Geometry"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02187783","volume":"5","author":"K. Clarkson","year":"1990","unstructured":"K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, andE. Welzl: Combinatorial Complexity Bounds for Arrangements of Curves and Spheres,Discrete and Computational Geometry,5 (1990), 99?160.","journal-title":"Discrete and Computational Geometry"},{"key":"CR8","unstructured":"H. Davenport: Analytic Methods for Diophantine Equations and Diophantine Inequalities,Campus Publishers (1962), 1?30."},{"key":"CR9","unstructured":"R. A. Duke, H. Lefmann, andV. R\u00f6dl: On Uncrowded Hypergraphs,Random Structures and Algorithms, to appear."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02414146","volume":"103","author":"P. Erd?s","year":"1975","unstructured":"P. Erd?s: On some Problems of Elementary and Combinatorial Geometry,Annali di Mathematica Pura et Applicata Ser. 4,103 (1975), 99?108.","journal-title":"Annali di Mathematica Pura et Applicata Ser. 4"},{"key":"CR11","unstructured":"P. Erd?s, andP. C. Fishburn: Multiplicities of Interpoint Distances in Finite Planar Sets,preprint, (1991), to appear inDiscrete and Applied Math."},{"key":"CR12","first-page":"121","volume":"25","author":"P. Erd?s","year":"1970","unstructured":"P. Erd?s, andR. Guy: Distinct Distances between Lattice Points,Elemente der Mathematik,25 (1970), 121?123.","journal-title":"Elemente der Mathematik"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01191203","volume":"12","author":"P. Erd?s","year":"1992","unstructured":"P. Erd?s, R. L. Graham, I. Ruzsa, andH. Taylor: Bounds for Arrays of Dots with Distinct Slopes or Lengths,Combinatorica,12 (1992), 39?44.","journal-title":"Combinatorica"},{"key":"CR14","unstructured":"P. Fishburn: Convex Polygons with Few Vertices,Dimacs Technical Report,92?17 (1992)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/0097-3165(90)90074-7","volume":"55","author":"Z. F\u00fcredi","year":"1990","unstructured":"Z. F\u00fcredi: The Maximum Number of Unit Distances in a Convexn-gon,J. Comb. Theory (Ser. A),55 (1990), 316?320.","journal-title":"J. Comb. Theory (Ser. A)"},{"key":"CR16","first-page":"1","volume":"166","author":"S. W. Golomb","year":"1991","unstructured":"S. W. Golomb: Construction of Signals with Favourable Correlation Properties,Surveys in Combinatorics, London Mathematical Society Lecture Note Series,166 (1991), 1?39.","journal-title":"Surveys in Combinatorics"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIT.1982.1056526","volume":"28","author":"S. W. Golomb","year":"1982","unstructured":"S. W. Golomb, andH. Taylor: Two-dimensional Synchronization Patterns for Minimum Ambiguity,IEEE Transactions Information Theory,IT-28 (1982), 600?604.","journal-title":"IEEE Transactions Information Theory, IT"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/978-1-4757-1738-9_7","volume-title":"Unsolved Problems in Number Theory","author":"R. K. Guy","year":"1981","unstructured":"R. K. Guy: Unsolved Problems in Number Theory,Springer Verlag, New York, (1981), 132?133."},{"key":"CR19","unstructured":"G. H. Hardy, andE. M. Wright: An Introduction to the Theory of Numbers,Oxford University Press, (1979)."},{"key":"CR20","volume-title":"Handbuch der Lehre von der Verteilung der Primzahlen","author":"E. Landau","year":"1909","unstructured":"E. Landau: Handbuch der Lehre von der Verteilung der Primzahlen,Teubner Verlag, Leipzig, (1909)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0097-3165(92)90094-B","volume":"59","author":"J. Pach","year":"1992","unstructured":"J. Pach, andM. Sharir: Repeated Angles in the Plane and Related Problems,J. Comb. Theory (Ser. A),59 (1992), 12?22.","journal-title":"J. Comb. Theory (Ser. A)"},{"key":"CR22","unstructured":"S. Ramanujan: Collected Papers,Chelsea Publishing Company, (1962), 133?135."},{"key":"CR23","series-title":"Graph Theory and Combinatorics","first-page":"253","volume-title":"Unit Distances in the Euclidean Plane","author":"J. Spencer","year":"1984","unstructured":"J. Spencer, E. Szemer\u00e9di, andW. T. Trotter: Unit Distances in the Euclidean Plane,Graph Theory and Combinatorics, Academic Press, London (1984), 253?278."},{"key":"CR24","unstructured":"T. Thiele: Point Sets with Distinct Slopes or Lengths,preprint, (1993)."},{"key":"CR25","unstructured":"R. C. Vaughan: The Hardy-Littlewood Method,Cambridge University Press, (1981), 1?25."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1112\/plms\/s2-21.1.235","volume":"21","author":"B. M. Wilson","year":"1923","unstructured":"B. M. Wilson: Proofs of Some Formul\u00e6 Enunciated by Ramanujan,Proceedings London Mathematical Society,21 (1923), 235?255.","journal-title":"Proceedings London Mathematical Society"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299744.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299744\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:11Z","timestamp":1556647691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01299744"],"URL":"https:\/\/doi.org\/10.1007\/bf01299744","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}