Skip to search formSkip to main contentSkip to account menu

Ternary search

Known as: Ternary, 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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Searching is a traversal technique in a data structure to search a particular element in a given set of particular domain… 
2018
2018
This paper describe a parallel sorting algorithm which is the combination of counting sort and ternary search. The proposed… 
2016
2016
Despite of the increasing usage of traditional cloud computing, there are still some issues unsolved due to inherent problems of… 
2015
2015
Generalized conjunction/disjunction (GCD) is a fundamental idempotent logic function that enables a continuous transition from… 
2012
2012
There are several algorithms like binary search, linear search, Interpolation search, Ternary search and, etc used for search… 
2010
2010
Accurate measurement of network parameters such as available bandwidth (ABW), link capacity, delay, packet loss and jitter are… 
2008
2008
Ternary search is a high efficient method in position finding of element,which makes use of the character of elements having been… 
2008
2008
The ternary search algorithm based on maximum element(or minimum element)in the ordered array is introduced,and it is easy to… 
2007
2007
We introduce a weighted model of random trees and analyze the asymptotic properties of their heights. Our framework encompasses…