A note on sorting integers from a bounded range. - Allan Gottlieb; Clyde P. Kruskal (SIGACT News, 1980)

A note on the worst case of heapsort. - Clyde P. Kruskal; Elia Weixelbaum (SIGACT News, 1981)

Coordinating parallel processors: a partial unification. - Allan Gottlieb; Clyde P. Kruskal (SIGARCH Comput. Archit. News, 1981)

Upper and Lower Bounds on the Performance of Parallel Algorithms. - Clyde P. Kruskal (1981)

Results in parallel searching, merging, and sorting. - Clyde P. Kruskal (ICPP, 1982)

Algorithms for replace-add based paracomputers. - Clyde P. Kruskal (ICPP, 1982)

The NYU Ultracomputer-designing a MIMD, shared-memory parallel machine (Extended Abstract). - Allan Gottlieb; Ralph Grishman; Clyde P. Kruskal; Kevin P. McAuliffe; Larry Rudolph; Marc Snir (ISCA, 1982)

The NYU Ultracomputer - Designing an MIMD Shared Memory Parallel Computer. - Allan Gottlieb; Ralph Grishman; Clyde P. Kruskal; Kevin P. McAuliffe; Larry Rudolph; Marc Snir (IEEE Trans. Computers, 1983)

Searching, Merging, and Sorting in Parallel Computation. - Clyde P. Kruskal (IEEE Trans. Computers, 1983)

The Performance of Multistage Interconnection Networks for Multiprocessors. - Clyde P. Kruskal; Marc Snir (IEEE Trans. Computers, 1983)

The Importance of Being Square. - Clyde P. Kruskal; Marc Snir (ISCA, 1984)

Complexity Results for Permuting Data and Other Computations on Parallel Processors. - Allan Gottlieb; Clyde P. Kruskal (J. ACM, 1984)

The Effectiveness of Automatic Restructuring on Nonnumerical Programs. - Gyungho Lee; Clyde P. Kruskal; David J. Kuck (ICPP, 1985)

Parallel Algorithms for Shortest Path Problems. - Richard C. Paige; Clyde P. Kruskal (ICPP, 1985)

Issues Related to MIMD Shared-memory Computers: The NYU Ultracomputer Approach. - Jan Edler; Allan Gottlieb; Clyde P. Kruskal; Kevin P. McAuliffe; Larry Rudolph; Marc Snir; Patricia J. Teller; James Wilson (ISCA, 1985)

The Power of Parallel Prefix. - Clyde P. Kruskal; Larry Rudolph; Marc Snir (IEEE Trans. Computers, 1985)

An Empirical Study of Automatic Restructuring of Nonnumerical Programs for Parallel Processors. - Gyungho Lee; Clyde P. Kruskal; David J. Kuck (IEEE Trans. Computers, 1985)

Allocating Independent Subtasks on Parallel Processors. - Clyde P. Kruskal; Alan Weiss (IEEE Trans. Software Eng., 1985)

Parallel Prefix on Fully Connected Direct Connection Machines. - Clyde P. Kruskal; Larry Rudolph; Tom Madej (ICPP, 1986)

Efficient Parallel Algorithms for Graph Models. - Clyde P. Kruskal; Larry Rudolph; Marc Snir (ICPP, 1986)

The Effectiveness of Combining in Shared Memory Parallel Computer in the Presence of "Hot Spots". - Gyungho Lee; Clyde P. Kruskal; David J. Kuck (ICPP, 1986)

A Unified Theory of Interconnection Network Structure. - Clyde P. Kruskal; Marc Snir (Theor. Comput. Sci., 1986)

A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract). - Clyde P. Kruskal; Larry Rudolph; Marc Snir (ICALP, 1988)

The Distribution of Waiting Times in Clocked Multistage Interconnection Networks. - Clyde P. Kruskal; Marc Snir; Alan Weiss (IEEE Trans. Computers, 1988)

On the notion of granularity. - Clyde P. Kruskal; Carl H. Smith (J. Supercomput., 1988)

Efficient Synchronization on Multiprocessors with Shared Memory. - Clyde P. Kruskal; Larry Rudolph; Marc Snir (ACM Trans. Program. Lang. Syst., 1988)

Processor Networks and Interconnection Networks Without Long Wires. - C. P. Beigel; Clyde P. Kruskal (SPAA, 1989)

Cost-Bandwidth Tradeoffs for Communication Networks. - Clyde P. Kruskal; Marc Snir (SPAA, 1989)

Generalized latin squares I. - Xiaojun Shen; Y. Z. Cai; C. L. Liu 001; Clyde P. Kruskal (Discret. Appl. Math., 1989)

Techniques for Parallel Manipulation of Sparse Matrices. - Clyde P. Kruskal; Larry Rudolph; Marc Snir (Theor. Comput. Sci., 1989)

Efficient Parallel Algorithms for Graph Problems. - Clyde P. Kruskal; Larry Rudolph; Marc Snir (Algorithmica, 1990)

A Complexity Theory of Efficient Parallel Algorithms. - Clyde P. Kruskal; Larry Rudolph; Marc Snir (Theor. Comput. Sci., 1990)

Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search. - Pilar de la Torre; Clyde P. Kruskal (ICPP (3), 1991)

Processor networks and interconnection networks without long wires (extended abstract). - Richard Beigel; Clyde P. Kruskal (SIGARCH Comput. Archit. News, 1991)

Cost-Performance Tradeoffs for Interconnection Networks. - Clyde P. Kruskal; Marc Snir (Discret. Appl. Math., 1992)

Towards a single model of efficient computation in real parallel machines. - Pilar de la Torre; Clyde P. Kruskal (Future Gener. Comput. Syst., 1992)

Efficient Parallel Processing of Image Contours. - Ling Tony Chen; Larry S. Davis; Clyde P. Kruskal (IEEE Trans. Pattern Anal. Mach. Intell., 1993)

A Calculus of Adaptive Purpose Parallel Computation. - Pilar de la Torre; Clyde P. Kruskal (IFIP Congress (1), 1994)

Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks. - Clyde P. Kruskal; Kevin J. Rappoport (SPAA, 1994)

On the Effectiveness of Combining in Resolving "Hot Spot" Contention. - Gyungho Lee; Clyde P. Kruskal; David J. Kuck (J. Parallel Distributed Comput., 1994)

A structural theory of recursively decomposable parallel processor-networks. - Pilar de la Torre; Clyde P. Kruskal (SPDP, 1995)

Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. - Pilar de la Torre; Clyde P. Kruskal (J. Algorithms, 1995)

Submachine Locality in the Bulk Synchronous Setting (Extended Abstract). - Pilar de la Torre; Clyde P. Kruskal (Euro-Par, Vol. II, 1996)

Exact Bandwith of Parallel-Processor Networks. - Pilar de la Torre; Clyde P. Kruskal (SIROCCO, 1996)

The NYU Ultracomputer - Designing a MIMD, Shared-Memory Parallel Machine. - Allan Gottlieb; Ralph Grishman; Clyde P. Kruskal; Kevin P. McAuliffe; Larry Rudolph; Marc Snir (25 Years ISCA: Retrospectives and Reprints, 1998)

A Survey of Constant Time Parallel Sorting. - William I. Gasarch; Evan Golub; Clyde P. Kruskal (Bull. EATCS, 2000)

Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search. - Pilar de la Torre; Clyde P. Kruskal (Theory Comput. Syst., 2001)

Constant time parallel sorting: an empirical view. - William I. Gasarch; Evan Golub; Clyde P. Kruskal (J. Comput. Syst. Sci., 2003)

A Retrograde Approximation Algorithm for One-Player Can't Stop. - James Glenn; Haw-ren Fang; Clyde P. Kruskal (Computers and Games, 2006)

A Retrograde Approximation Algorithm for Multi-player Can't Stop. - James Glenn; Haw-ren Fang; Clyde P. Kruskal (Computers and Games, 2008)

Retrograde Approximation Algorithms for Jeopardy Stochastic Games. - Haw-ren Fang; James Glenn; Clyde P. Kruskal (J. Int. Comput. Games Assoc., 2008)

Finding large 3-free sets I: The small n case. - William I. Gasarch; James Glenn; Clyde P. Kruskal (J. Comput. Syst. Sci., 2008)

The orchard visibility problem and some variants. - Clyde P. Kruskal (J. Comput. Syst. Sci., 2008)

The chromatic number of the plane: The bounded case. - Clyde P. Kruskal (J. Comput. Syst. Sci., 2008)

New Solutions for Synchronized Domineering. - Sahil Bahri; Clyde P. Kruskal (Computers and Games, 2010)

Problems with a Point - Exploring Math and Computer Science - William Gasarch; Clyde P. Kruskal (Problems with a Point, 2019)