Home › Entities › academic_journal_article › Nearly Optimal Binary Search Trees

Nearly Optimal Binary Search Trees

1975 scientific journal article
Place academic_journal_article Q126089533
Press Enter · cited answer in seconds

Nearly Optimal Binary Search Trees

Summary

Nearly Optimal Binary Search Trees is an academic journal article[1].

Key Facts

  • Nearly Optimal Binary Search Trees authored Kurt Mehlhorn[2].
  • Nearly Optimal Binary Search Trees's instance of is recorded as academic journal article[3].
  • Nearly Optimal Binary Search Trees's DOI is recorded as 10.1007/BF00264563[4].
  • Nearly Optimal Binary Search Trees's publication date is recorded as +1975-12-00T00:00:00Z[5].
  • Nearly Optimal Binary Search Trees's zbMATH Open document ID is recorded as 0333.68028[6].
  • Nearly Optimal Binary Search Trees's work available at URL is recorded as https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf[7].
  • Nearly Optimal Binary Search Trees's Handle ID is recorded as 11858/00-001M-0000-0014-AFD5-2[8].
  • Nearly Optimal Binary Search Trees's published in is recorded as Acta Informatica[9].
  • Nearly Optimal Binary Search Trees's CiteSeerX article ID is recorded as ee2c636ed97918c2585627a6987a9a1119cd0a43[10].
  • Nearly Optimal Binary Search Trees's Semantic Scholar paper ID is recorded as ee2c636ed97918c2585627a6987a9a1119cd0a43[11].
  • Nearly Optimal Binary Search Trees's Google Scholar paper ID is recorded as 6826310510154627886[12].
  • Nearly Optimal Binary Search Trees's ResearchGate publication ID is recorded as 47842229[13].
  • Nearly Optimal Binary Search Trees's maintained by WikiProject is recorded as WikiProject Mathematics[14].
  • Nearly Optimal Binary Search Trees's Semantic Scholar corpus ID is recorded as 17188103[15].
  • Nearly Optimal Binary Search Trees's Fatcat ID is recorded as work_z22ae7cn6nct3ma5gsrr64ocou[16].
  • Nearly Optimal Binary Search Trees's DBLP publication ID is recorded as journals/acta/Mehlhorn75[17].
  • Nearly Optimal Binary Search Trees's CiNii Research ID is recorded as 1363107368358964352[18].

Body

Designation and Status

Nearly Optimal Binary Search Trees's instance of is recorded as academic journal article[3].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] ↑ . wikidata.org.
  2. [2] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.
  10. [11] ↑ . wikidata.org.
  11. [12] ↑ . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . wikidata.org.
  14. [15] ↑ . wikidata.org.
  15. [16] ↑ . wikidata.org.
  16. [17] ↑ . wikidata.org.
  17. [18] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Nearly Optimal Binary Search Trees. Retrieved May 3, 2026, from https://4ort.xyz/entity/nearly-optimal-binary-search-trees
MLA “Nearly Optimal Binary Search Trees.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/nearly-optimal-binary-search-trees.
BibTeX @misc{4ortxyz_nearly-optimal-binary-search-trees_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Nearly Optimal Binary Search Trees}}, year = {2026}, url = {https://4ort.xyz/entity/nearly-optimal-binary-search-trees}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Nearly Optimal Binary Search Trees — https://4ort.xyz/entity/nearly-optimal-binary-search-trees (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/nearly-optimal-binary-search-trees · Last refreshed: