Clyde Kruskal | Academic Influence

Clyde Kruskal's AcademicInfluence.com Rankings

Clyde Kruskal

Computer Science

#2517

World Rank

#2628

Historical Rank

#1096

USA Rank

Parallel Computing

#41

World Rank

#43

Historical Rank

#25

USA Rank

Database

#6068

World Rank

#6292

Historical Rank

#801

USA Rank

computer-science Degrees

Download Badge

Computer Science

Clyde Kruskal's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics Stanford University

Similar Degrees You Can Earn

Why Is Clyde Kruskal Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Clyde P. Kruskal is an American computer scientist, working on parallel computing architectures, models, and algorithms. As part of the ultracomputer project, he was one of the inventors of the read–modify–write concept in parallel and distributed computing. He is an associate professor of computer science at the University of Maryland, College Park.

(See a Problem?)

Clyde Kruskal's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer (1983) (624)
The Performance of Multistage Interconnection Networks for Multiprocessors (1983) (569)
Allocating Independent Subtasks on Parallel Processors (1985) (404)
The power of parallel prefix (1985) (252)
A Complexity Theory of Efficient Parallel Algorithms (1990) (235)
Searching, Merging, and Sorting in Parallel Computation (1983) (171)
A Unified Theory of Interconnection Network Structure (1986) (121)
Efficient synchronization of multiprocessors with shared memory (1988) (116)
Parallel Algorithms for Shortest Path Problems (1985) (107)
The Distribution of Waiting Times in Clocked Multistage Interconnection Networks (1988) (105)
Efficient synchronization of multiprocessors with shared memory (1986) (86)
The NYU ultracomputer—designing a MIMD, shared-memory parallel machine (2018) (84)
EFFECTS OF PROGRAM RESTRUCTURING, ALGORITHM CHANGE, AND ARCHITECTURE CHOICE ON PROGRAM PERFORMANCE. (1984) (80)
Submachine Locality in the Bulk Synchronous Setting (Extended Abstract) (1996) (78)
Issues related to MIMD shared-memory computers: the NYU ultracomputer approach (1985) (69)
Using the multistage cube network topology in parallel supercomputers (1989) (68)
The Effectiveness of Combining in Shared Memory Parallel Computer in the Presence of "Hot Spots" (1994) (67)
The NYU Ultracomputer—designing a MIMD, shared-memory parallel machine (Extended Abstract) (1982) (65)
Towards a single model of efficient computation in real parallel machines (1991) (51)
Coordinating parallel processors: a partial unification (1981) (44)
Complexity Results for Permuting Data and Other Computations on Parallel Processors (1984) (39)
Efficient parallel algorithms for graph problems (1990) (31)
An empirical study of automatic restructuring of nonnumerical programs for parallel processors (1985) (29)
Parallel Prefix on Fully Connected Direct Connection Machines (1986) (28)
Techniques for Parallel Manipulation of Sparse Matrices (1989) (27)
Efficient Parallel Processing of Image Contours (1993) (25)
Finding large 3-free sets I: The small n case (2008) (21)
On the distribution of delays in buffered multistage interconnection networks for uniform and nonuni (1984) (21)
The NYU ultracomputer: An MIMD shared memory parallel computer (1984) (20)
On the Effectiveness of Combining in Resolving "Hot Spot" Contention (1994) (15)
A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract) (1988) (13)
Cost-Performance Tradeoffs for Interconnection Networks (1992) (13)
The chromatic number of the plane: The bounded case (2008) (12)
The orchard visibility problem and some variants (2008) (12)
Processor networks and interconnection networks without long wires (1989) (10)
The importance of being square (1984) (10)
OPTIMAL INTERCONNECTION NETWORKS FOR PARALLEL PROCESSORS: THE IMPORTANCE OF BEING SQUARE. (1987) (10)
A structural theory of recursively decomposable parallel processor-networks (1995) (9)
Retrograde Approximation Algorithms for Jeopardy Stochastic Games (2008) (9)
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems (1995) (9)
A Retrograde Approximation Algorithm for Multi-player Can't Stop (2006) (9)
Algorithms for replace-add based paracomputers (1982) (8)
Upper and Lower Bounds on the Performance of Parallel Algorithms (1981) (8)
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search (2001) (7)
A Retrograde Approximation Algorithm for One-Player Can't Stop (2006) (7)
Bandwidth-based lower bounds on slowdown for efficient emulations of fixed-connection networks (1994) (7)
Constant time parallel sorting: an empirical view (2003) (7)
Efficient Parallel Algorithms for Graph Models (1986) (6)
The Effectiveness of Automatic Restructuring on Nonnumerical Programs (1985) (5)
A Survey of Constant Time Parallel Sorting (2000) (5)
Cost-bandwidth tradeoffs for communication networks (1989) (5)
Generalized latin squares I (1989) (5)
Empirical studies in parallel sorting (1999) (4)
New Solutions for Synchronized Domineering (2010) (4)
When Can One Load a Set of Dice so that the Sum Is Uniformly Distributed (1999) (3)
The architecture of parallel computers (1986) (3)
Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search (1991) (3)
SOME RESULTS ON PACKET-SWITCHING NETWORKS FOR MULTIPROCESSING (EXTENDED ABSTRACT). (1982) (2)
Results in parallel searching, merging, and sorting (1982) (2)
SIMULATING SHARED-MEMORY PARALLEL COMPUTERS. (1984) (2)
COMPUTER GAMES WORKSHOP 2007 (2007) (2)
Efficient Parallel Algorithms: Theory and Practice (1989) (2)
On the notion of granularity (1988) (2)
Massively parallel processing of image contours (1992) (1)
Upper and lower bounds for recurrent and recursively decomposable parallel processor-networks (1995) (1)
MULT - a multitasking ultracomputer language with timing: Ultracomputer note #15 (1980) (1)
Supersaturated ultracomputer algorighms (1980) (1)
A Calculus of Adaptive Purpose Parallel Computation (1994) (1)
Exact Bandwith of Parallel-Processor Networks (1996) (1)
Is This Problem Too Hard for a High School Math Competition? (2018) (0)
A note on sorting integers from a bounded range (1980) (0)
Refined Upper and Lower Bounds for 2-SUM (2004) (0)
RAMSEY GAME NUMBERS (0)
Dispelling the Myth That the Early Logicians Were a Few Axioms Short of a Complete Set (2019) (0)
Sports Violate the Rules of Mathematics! (2019) (0)
Problems with a Point (2018) (0)
Timing is Everything! Every Planar Graph is 4.5-Colorable (2018) (0)
When Terms from Math are Used by Civilians… (2019) (0)
If That Were True I Would Know It! A Result in Kolmogorov Complexity (2019) (0)
What is Obvious? Less Elegant Proofs That (2nn) and Cn=1n+1(2nn) are Integers (2019) (0)
New York University (NYU) Ultracomputer -- A General-Purpose Parallel Processor (1982) (0)
A Survey of Constant Time Parallel Sorting ( Preliminary Version ) (2007) (0)
What is a Simple Function? (2019) (0)
How Do Mathematical Objects Get Named? (2019) (0)
A note on the worst case of heapsort (1981) (0)
Lets Prove Something Instead of Proving That We Can’t Prove Something!!! (2018) (0)
Finding Large Sets Without Arithmetic Progressions of Length Three (2010) (0)
Ramsey Theory and History: An Example of Interdisciplinary Research (2018) (0)
Trick Question or Stupid Question? (2018) (0)
The Or hard Visibility Problem and someVariants (0)
Standard Domineering (2010) (0)
Processor networks and interconnection networks without long wires (extended abstract) (1991) (0)
Is This Problem Interesting? (2019) (0)
Parallel processing of image contours (1992) (0)
A Hat Problem, its Generalizations, and a Story! (2019) (0)
Compatible matchings in bipartite graphs (1985) (0)
What is an Elegant Proof? Some Coloring Theorems (2019) (0)
Funny Answers to Math Questions (2018) (0)
BACK MATTER (2018) (0)
Is There a Pattern? Is it Interesting? Perfect Numbers and Sums of Cubes (2019) (0)
Ramsey Theory and History: An Example of Interdisciplinary Research — An Alternative View (2019) (0)
Models of memory interference in multiprocessors (1991) (0)
A High School Math Competition Problem Inspires an Infinite Number of Proofs (2018) (0)
A Sane Reduction of COL4 to COL3 (2019) (0)
Multiparty Communication Complexity: A Fun Approach (2019) (0)
What is an Elegant Proof? A Theorem About Digits (2019) (0)
Gathering for Gardner Recreational vs. Serious Mathematics (2019) (0)
FRONT MATTER (2018) (0)
Observations Concerning Multidimensional Ultracomputers by (1980) (0)

This paper list is powered by the following services:

Other Resources About Clyde Kruskal

en.wikipedia.org

What Schools Are Affiliated With Clyde Kruskal?

Clyde Kruskal is affiliated with the following schools:

Image Attributions

Image Source for Clyde Kruskal