Sequential algorithm

Known as: Serial algorithm 
In computer science, a sequential algorithm or serial algorithm is an algorithm that is executed sequentially – once through, from start to finish… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erdős-Rényi… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We present a nearly-linear time algorithm for counting and randomly generating simple graphs with a given degree sequence in a… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
[1] Empirical studies of climate regime shifts typically use confirmatory statistical techniqueswith an a priori hypothesis about… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • P. L. Houtekamer, Herschel L. Mitchell
  • 2001
An ensemble Kalman filter may be considered for the 4D assimilation of atmospheric data. In this paper, an efficient… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We examine sequential algorithms and formulate a sequential-time postulate, an abstract-state postulate, and a bounded… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The Karhunen-Loeve (KL) transform is an optimal method for approximating a set of vectors or images, which was used in image… (More)
  • figure 1
  • table I
Is this relevant?
Highly Cited
1996
Highly Cited
1996
With the existence of many large transaction databases, the huge amounts of data, the high scalability of distributed systems… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The ability to cheaply train text classifiers is critical to their use in information retrieval, content analysis, natural… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number of tuples… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?