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

On a generalization of binary search

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

DOI10.1016/0020-0190(79)90112-1zbMath0395.68062OpenAlexW2092865664MaRDI QIDQ1253101

Timo Leipaelae

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90112-1


zbMATH Keywords

Binary Search


Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)


Related Items (1)

Operations research applications of dichotomous search



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Understanding the complexity of interpolation search
  • On a problem of optimal search
  • On self-organizing sequential search heuristics




This page was built for publication: On a generalization of binary search

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