Clyde P. Kruskal

According to our database1, Clyde P. Kruskal
  • authored at least 55 papers between 1982 and 2010.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2010
New Solutions for Synchronized Domineering.
Proceedings of the Computers and Games - 7th International Conference, 2010

2008
The chromatic number of the plane: The bounded case.
J. Comput. Syst. Sci., 2008

The orchard visibility problem and some variants.
J. Comput. Syst. Sci., 2008

Finding large 3-free sets I: The small n case.
J. Comput. Syst. Sci., 2008

Retrograde Approximation Algorithms for Jeopardy Stochastic Games.
ICGA Journal, 2008

A Retrograde Approximation Algorithm for Multi-player Can't Stop.
Proceedings of the Computers and Games, 6th International Conference, CG 2008, Beijing, 2008

2006
A Retrograde Approximation Algorithm for One-Player Can't Stop.
Proceedings of the Computers and Games, 5th International Conference, 2006

2003
Constant time parallel sorting: an empirical view.
J. Comput. Syst. Sci., 2003

2001
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search.
Theory Comput. Syst., 2001

2000
A Survey of Constant Time Parallel Sorting.
Bulletin of the EATCS, 2000

1998
The NYU Ultracomputer - Designing a MIMD, Shared-Memory Parallel Machine.
Proceedings of the 25 Years of the International Symposia on Computer Architecture (Selected Papers)., 1998

1996
Exact Bandwith of Parallel-Processor Networks.
Proceedings of the SIROCCO'96, 1996

Submachine Locality in the Bulk Synchronous Setting (Extended Abstract).
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems.
J. Algorithms, 1995

A structural theory of recursively decomposable parallel processor-networks.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

1994
On the Effectiveness of Combining in Resolving "Hot Spot" Contention.
J. Parallel Distrib. Comput., 1994

Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks.
SPAA, 1994

A Calculus of Adaptive Purpose Parallel Computation.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
Efficient Parallel Processing of Image Contours.
IEEE Trans. Pattern Anal. Mach. Intell., 1993

1992
Towards a single model of efficient computation in real parallel machines.
Future Generation Comp. Syst., 1992

Cost-Performance Tradeoffs for Interconnection Networks.
Discrete Applied Mathematics, 1992

1991
Processor networks and interconnection networks without long wires (extended abstract).
SIGARCH Computer Architecture News, 1991

Towards a Single Model of Efficient Computation in Real Parallel Machines.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search.
Proceedings of the International Conference on Parallel Processing, 1991

1990
A Complexity Theory of Efficient Parallel Algorithms.
Theor. Comput. Sci., 1990

Efficient Parallel Algorithms for Graph Problems.
Algorithmica, 1990

1989
Techniques for Parallel Manipulation of Sparse Matrices.
Theor. Comput. Sci., 1989

Generalized latin squares I.
Discrete Applied Mathematics, 1989

Cost-Bandwidth Tradeoffs for Communication Networks.
SPAA, 1989

Processor Networks and Interconnection Networks Without Long Wires.
SPAA, 1989

1988
Efficient Synchronization on Multiprocessors with Shared Memory.
ACM Trans. Program. Lang. Syst., 1988

On the notion of granularity.
The Journal of Supercomputing, 1988

The Distribution of Waiting Times in Clocked Multistage Interconnection Networks.
IEEE Trans. Computers, 1988

A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1986
A Unified Theory of Interconnection Network Structure.
Theor. Comput. Sci., 1986

Efficient Synchronization on Multiprocessors with Shared Memory.
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

The Effectiveness of Combining in Shared Memory Parallel Computer in the Presence of "Hot Spots".
Proceedings of the International Conference on Parallel Processing, 1986

The Distribution of Waiting Times in Clocked Multistage Interconnection Networks.
Proceedings of the International Conference on Parallel Processing, 1986

Efficient Parallel Algorithms for Graph Models.
Proceedings of the International Conference on Parallel Processing, 1986

Parallel Prefix on Fully Connected Direct Connection Machines.
Proceedings of the International Conference on Parallel Processing, 1986

1985
Allocating Independent Subtasks on Parallel Processors.
IEEE Trans. Software Eng., 1985

An Empirical Study of Automatic Restructuring of Nonnumerical Programs for Parallel Processors.
IEEE Trans. Computers, 1985

The Power of Parallel Prefix.
IEEE Trans. Computers, 1985

Issues Related to MIMD Shared-memory Computers: The NYU Ultracomputer Approach.
Proceedings of the 12th Annual Symposium on Computer Architecture, 1985

Parallel Algorithms for Shortest Path Problems.
Proceedings of the International Conference on Parallel Processing, 1985

The Effectiveness of Automatic Restructuring on Nonnumerical Programs.
Proceedings of the International Conference on Parallel Processing, 1985

The Power of Parallel Prefix.
Proceedings of the International Conference on Parallel Processing, 1985

1984
Complexity Results for Permuting Data and Other Computations on Parallel Processors.
J. ACM, 1984

The Importance of Being Square.
Proceedings of the 11th Annual Symposium on Computer Architecture, 1984

1983
The Performance of Multistage Interconnection Networks for Multiprocessors.
IEEE Trans. Computers, 1983

Searching, Merging, and Sorting in Parallel Computation.
IEEE Trans. Computers, 1983

The NYU Ultracomputer - Designing an MIMD Shared Memory Parallel Computer.
IEEE Trans. Computers, 1983

1982
The NYU Ultracomputer-designing a MIMD, shared-memory parallel machine (Extended Abstract).
Proceedings of the 9th International Symposium on Computer Architecture (ISCA 1982), 1982

Algorithms for replace-add based paracomputers.
Proceedings of the International Conference on Parallel Processing, 1982

Results in parallel searching, merging, and sorting.
Proceedings of the International Conference on Parallel Processing, 1982


  Loading...