Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,436,924 papers from all fields of science
Search
Sign In
Create Free Account
Linear search
Known as:
Sequential search
In computer science, linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
AP Computer Science A
Analysis of algorithms
Array data structure
Assembly language
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Scalable RFID security protocols supporting tag ownership transfer
Boyeon Song
,
C. Mitchell
Computer Communications
2011
Corpus ID: 825171
Highly Cited
2010
Highly Cited
2010
Three-dimensional beta-shapes and beta-complexes via quasi-triangulation
Deok-Soo Kim
,
Youngsong Cho
,
K. Sugihara
,
Joonghyun Ryu
,
Donguk Kim
Comput. Aided Des.
2010
Corpus ID: 2240893
Highly Cited
2007
Highly Cited
2007
Shape-based image retrieval using support vector machines, Fourier descriptors and self-organizing maps
Wai-Tak Wong
,
F. Shih
,
Jun-Hui Liu
Information Sciences
2007
Corpus ID: 3405745
2006
2006
Optimum Wordlength Search Using Sensitivity Information
Kyungtae Han
,
B. Evans
EURASIP Journal on Advances in Signal Processing
2006
Corpus ID: 18389966
Many digital signal processing algorithms are first developed in floating point and later converted into fixed point for digital…
Expand
Highly Cited
2005
Highly Cited
2005
A SEQUENTIAL PROCEDURE FOR TESTING UNIT ROOTS IN THE PRESENCE OF STRUCTURAL BREAK IN TIME SERIES DATA: AN APPLICATION TO QUARTERLY DATA
Khorshed Chowdhury
2005
Corpus ID: 54600246
Testing for unit roots has special significance in t erms of both economic theory and the interpretation of estimation results…
Expand
2005
2005
Multi Product Market Equilibrium with Sequential Search
P. Vieira
2005
Corpus ID: 152721857
In this paper I investigate whether, in market equilibrium, one observes price dispersion and search when buyers intend to…
Expand
2005
2005
Scheduling algorithms for shared fiber-delay-line optical packet Switches-part I: the single-stage case
S. Liew
,
Gang Hu
,
H. J. Chao
Journal of Lightwave Technology
2005
Corpus ID: 9874785
In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. When contention occurs…
Expand
1996
1996
Minimizing the average cost of paging under delay constraints
ChristopherRose andRoyYates
1996
Corpus ID: 53414399
Efficient paging procedures help minimize the amount of bandwidth expended in locating a mobile unit. Given a probability…
Expand
Highly Cited
1990
Highly Cited
1990
Fast collision avoidance for manipulator arms: a sequential search strategy
K. Gupta
Proceedings., IEEE International Conference on…
1990
Corpus ID: 54449284
A sequential strategy is presented for planning collision-free motions for a manipulator arm. The basic idea behind the approach…
Expand
1985
1985
Self-organizing sequential search and Hilbert's inequalities
F. C. Graham
,
D. Hajela
,
P. Seymour
Symposium on the Theory of Computing
1985
Corpus ID: 28456975
In this paper we describe a general technique which can be used to solve an old problem in analyzing self-organizing sequential…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE