Search the dblp DataBase
Clark D. Thompson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Clark D. Thompson, H. T. Kung
Sorting on a Mesh-Connected Parallel Computer. [Citation Graph (3, 0)][DBLP]
Commun. ACM, 1977, v:20, n:4, pp:263-271 [Journal] - Michael J. Carey, Clark D. Thompson
An Efficient Implementation of Search Trees on (lg N + 1) Processors. [Citation Graph (2, 0)][DBLP]
IEEE Trans. Computers, 1984, v:33, n:11, pp:1038-1041 [Journal] - Jon Louis Bentley, H. T. Kung, Mario Schkolnick, Clark D. Thompson
On the Average Number of Maxima in a Set of Vectors and Applications. [Citation Graph (1, 0)][DBLP]
J. ACM, 1978, v:25, n:4, pp:536-543 [Journal] - Antony P.-C. Ng, Clark D. Thompson, Prabhakar Raghavan
A language for describing rectilinear Steiner tree configurations. [Citation Graph (0, 0)][DBLP]
DAC, 1986, pp:659-662 [Conf] - Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1983, pp:453-459 [Conf] - Prabhakar Raghavan, Clark D. Thompson
Provably Good Routing in Graphs: Regular Arrays [Citation Graph (0, 0)][DBLP]
STOC, 1985, pp:79-87 [Conf] - Clark D. Thompson
Area-Time Complexity for VLSI [Citation Graph (0, 0)][DBLP]
STOC, 1979, pp:81-88 [Conf] - Clark D. Thompson, H. T. Kung
Sorting on a Mesh-Connected Parallel Computer [Citation Graph (0, 0)][DBLP]
STOC, 1976, pp:58-64 [Conf] - Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto
A Minimum-Area Circuit for l-Selection. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1987, v:2, n:, pp:251-265 [Journal] - Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani
Global Wire Routing in Two-Dimensional Arrays. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1987, v:2, n:, pp:113-129 [Journal] - Prabhakar Raghavan, Clark D. Thompson
Multiterminal Global Routing: A Deterministic Approximation Scheme. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1991, v:6, n:1, pp:73-82 [Journal] - Clark D. Thompson
Military Direction of Academic CS Research (Viewpoint). [Citation Graph (0, 0)][DBLP]
Commun. ACM, 1986, v:29, n:7, pp:583-585 [Journal] - Prabhakar Raghavan, Clark D. Thompson
Randomized rounding: a technique for provably good algorithms and algorithmic proofs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1987, v:7, n:4, pp:365-374 [Journal] - Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson
Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1985, v:21, n:5, pp:245-247 [Journal] - Clark D. Thompson
VLSI Design With Multiple Active Layers. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1985, v:21, n:3, pp:109-111 [Journal] - Clark D. Thompson
Generalized Connection Networks for Parallel Processor Intercommunication. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1978, v:27, n:12, pp:1119-1125 [Journal] - Clark D. Thompson
Fourier Transforms in VLSI. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1983, v:32, n:11, pp:1047-1057 [Journal] - Clark D. Thompson
The VLSI Complexity of Sorting. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1983, v:32, n:12, pp:1171-1184 [Journal] - Belle W. Y. Wei, Clark D. Thompson
Area-Time Optimal Adder Design. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1990, v:39, n:5, pp:666-675 [Journal]
Search in 0.002secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002