Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note concerning the closest point pair algorithm.

From MaRDI portal
Publication:1853012
Jump to:navigation, search

DOI10.1016/S0020-0190(01)00268-XzbMath1043.68116OpenAlexW2089092697MaRDI QIDQ1853012

Martin Richards

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00268-x


zbMATH Keywords

Analysis of algorithmsMergesortClosest point pair algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10)





Cites Work

  • Unnamed Item
  • Unnamed Item




This page was built for publication: A note concerning the closest point pair algorithm.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1853012&oldid=14236800"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki