Ternary search

Known as: Trinary search 
A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function. A ternary search determines… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2017
012319892017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Searching is an algorithm that search a particular element in a given list of elements. Sorting Technique is frequently used in a… (More)
Is this relevant?
2016
2016
A simple method for maintaining balance in ternary search tries is presented. The new kind of self-balancing ternary search trie… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2015
2015
The empirical calculation is displayed in this paper for searching which is an improvement of binary search. On the off chance… (More)
  • table 1
  • table II
Is this relevant?
2014
2014
We study protected nodes in m-ary search trees, by putting them in context of generalised Pólya urns. We show that the number of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2009
2009
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2005
2005
A Ternary Search Trie (TST) is a highly efficient dynamic dictionary structure applicable for strings and textual data. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2004
2004
This note is dedicated to the memory of our teacher E.W. Dijkstra, since he would have appreciated the problem and would probably… (More)
Is this relevant?
2004
2004
Search engines have become the primary means of accessing information on the Web. However, recent studies show misspelled words… (More)
  • figure 1
  • figure 2
  • table 1
  • table 1
  • table 2
Is this relevant?
2004
2004
We use Patricia tries to represent textual and spatial data, and present a range search algorithm for reporting all k-d records… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2000
2000
Searching and traversing m-way trees using tries is a well known and broadly used technique. Three algorithms are presented, two… (More)
  • figure 1
  • figure 4
  • table 1
  • table 2
  • figure 8
Is this relevant?