-
1
-
-
0026238131
-
A 512 16-b Bit-serial Sorter Chip
-
Oct.
-
M. Afghahi, "A 512 16-b Bit-serial Sorter Chip," IEEE J. Solid-State Circuits, vol. 26, pp. 1452-1457, Oct. 1991.
-
(1991)
IEEE J. Solid-State Circuits
, vol.26
, pp. 1452-1457
-
-
Afghahi, M.1
-
2
-
-
0024917523
-
A Pipelined, Expandable VLSI Sorting Engine Implemented in CMOS Technology
-
B. Ahn and J. M. Murray, "A Pipelined, Expandable VLSI Sorting Engine Implemented in CMOS Technology," in Proc. IEEE Int'l. Symp. on Circuits and Systems, 1989, pp. 134-137.
-
(1989)
Proc. IEEE Int'l. Symp. on Circuits and Systems
, pp. 134-137
-
-
Ahn, B.1
Murray, J.M.2
-
5
-
-
0017908480
-
Optimal Sorting Algorithms for Parallel Computer
-
Jan.
-
G. Baudet and D. Stevenson, "Optimal Sorting Algorithms for Parallel Computer," IEEE Trans. Computers, vol. 27, pp.84-87, Jan. 1978.
-
(1978)
IEEE Trans. Computers
, vol.27
, pp. 84-87
-
-
Baudet, G.1
Stevenson, D.2
-
6
-
-
0025430594
-
Sorting n Objects with a k-sorter
-
May
-
R. Beigel and J.Gill, "Sorting n Objects with a k-sorter," IEEE Trans. Computers, vol. 39, pp.714-716, May 1990.
-
(1990)
IEEE Trans. Computers
, vol.39
, pp. 714-716
-
-
Beigel, R.1
Gill, J.2
-
7
-
-
0022044037
-
A Minimum Area VLSI Network for O(log n) Time Sorting
-
May
-
G. Bilardi and F. P. Preparata, "A Minimum Area VLSI Network for O(log n) Time Sorting," IEEE Trans. Computers, vol. 34, pp.336-343, May 1985.
-
(1985)
IEEE Trans. Computers
, vol.34
, pp. 336-343
-
-
Bilardi, G.1
Preparata, F.P.2
-
8
-
-
0018283777
-
The Rebound Sorter: An Efficient Sort Engine for Large File
-
Sep.
-
T. C. Chen, Vincent Y. Lum, and C. Tung, "The Rebound Sorter: An Efficient Sort Engine for Large File," in IEEE Proc. 4th Int'l Conf. on Very Large Data Bases, pp. 312-318, Sep. 1978.
-
(1978)
IEEE Proc. 4th Int'l Conf. on Very Large Data Bases
, pp. 312-318
-
-
Chen, T.C.1
Lum, V.Y.2
Tung, C.3
-
9
-
-
0024091389
-
Optimal VLSI Circuits for Sorting
-
R. Cole and A. R. Seigel, "Optimal VLSI Circuits for Sorting," JACM, vol. 35, pp.777-809, 1988.
-
(1988)
JACM
, vol.35
, pp. 777-809
-
-
Cole, R.1
Seigel, A.R.2
-
10
-
-
84945708324
-
Sorting on Electronic Computer Systems
-
Edward. H. Friend, "Sorting on Electronic Computer Systems," JACM, vol. 3, pp.134-168, 1956.
-
(1956)
JACM
, vol.3
, pp. 134-168
-
-
Friend, E.H.1
-
13
-
-
0000811402
-
Sorting and Searching
-
Reading: Addison-Wesley
-
D. E. Knuth, The Art of Computer Programming, Vol 3: Sorting and Searching. Reading: Addison-Wesley, 1973.
-
(1973)
The Art of Computer Programming
, vol.3
-
-
Knuth, D.E.1
-
14
-
-
0032649504
-
Realization of Large-scale Distributors Based on Batcher Sorters
-
July
-
J.-G. Lee and B.-G. Lee, "Realization of Large-scale Distributors Based on Batcher Sorters," IEEE Trans. Communications, vol. 47, pp. 1103-1110, July 1999.
-
(1999)
IEEE Trans. Communications
, vol.47
, pp. 1103-1110
-
-
Lee, J.-G.1
Lee, B.-G.2
-
15
-
-
0022043139
-
Tight Bounds on The Complexity of Parallel Sorting
-
Apr.
-
T. Leighton, "Tight Bounds on The Complexity of Parallel Sorting," IEEE Trans. Computers, vol. 34, pp. 344-354, Apr. 1985.
-
(1985)
IEEE Trans. Computers
, vol.34
, pp. 344-354
-
-
Leighton, T.1
-
16
-
-
0020718785
-
A 'Zero-Time' VLSI Sorter
-
Mar.
-
G. S. Miranker, Luong Tang, and Chak-Kuen Wong, "A 'Zero-Time' VLSI Sorter," IBM J. Research & Development, vol. 27, pp. 140-148, Mar. 1983.
-
(1983)
IBM J. Research & Development
, vol.27
, pp. 140-148
-
-
Miranker, G.S.1
Tang, L.2
Wong, C.-K.3
-
17
-
-
0032631244
-
How to Sort N Items Using a Sorting Network of Fixed I/O Size
-
May
-
S. Olariu, M. C. Pinotti, and S. Q. Zheng, "How to Sort N Items Using a Sorting Network of Fixed I/O Size," IEEE Trans. Parallel and Distributed Sys., vol. 10, pp 487-499, May 1999.
-
(1999)
IEEE Trans. Parallel and Distributed Sys.
, vol.10
, pp. 487-499
-
-
Olariu, S.1
Pinotti, M.C.2
Zheng, S.Q.3
-
18
-
-
0032803651
-
Data-driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter
-
Jan.
-
B. Parhami and D.-M. Kwai, "Data-driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter," IEEE Trans. Parallel and Distributed Sys., vol. 10, pp 23-28, Jan. 1999.
-
(1999)
IEEE Trans. Parallel and Distributed Sys.
, vol.10
, pp. 23-28
-
-
Parhami, B.1
Kwai, D.-M.2
-
19
-
-
0015017871
-
Parallel Processing with the Perfect Shuffle
-
Feb.
-
H. S. Stone, "Parallel Processing with the Perfect Shuffle," IEEE Trans. Computers, vol. 20, pp. 153-161, Feb. 1971.
-
(1971)
IEEE Trans. Computers
, vol.20
, pp. 153-161
-
-
Stone, H.S.1
-
21
-
-
0020886345
-
The VLSI Complexity of Sorting
-
Dec.
-
C. D. Thompson, "The VLSI Complexity of Sorting," IEEE Trans. Computers, vol. 32, pp.1171-1184, Dec. 1983.
-
(1983)
IEEE Trans. Computers
, vol.32
, pp. 1171-1184
-
-
Thompson, C.D.1
-
23
-
-
0020312595
-
The Parallel Enumeration Sorting Scheme for VLSI
-
Dec.
-
H. Yasuura, N. Takagi, and S. Yajima, "The Parallel Enumeration Sorting Scheme for VLSI," IEEE Trans. Computers, vol. 31, pp.1192-1201, Dec. 1982.
-
(1982)
IEEE Trans. Computers
, vol.31
, pp. 1192-1201
-
-
Yasuura, H.1
Takagi, N.2
Yajima, S.3
-
24
-
-
84954408067
-
A Systolic Architecture for Sorting an Arbitrary Number of Elements
-
S. Q. Zheng, S. Olariu, and M. C. Pinotti, "A Systolic Architecture for Sorting an Arbitrary Number of Elements," in Proc. 1997 3rd Int. Conf. Algorithms and Architectures for Parallel Processing, pp. 113-126, 1997.
-
(1997)
Proc. 1997 3rd Int. Conf. Algorithms and Architectures for Parallel Processing
, pp. 113-126
-
-
Zheng, S.Q.1
Olariu, S.2
Pinotti, M.C.3
|