Clyde P. Kruskal - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 60 from 60

2019

Problems with a Point - Exploring Math and Computer ScienceWilliam Gasarch, Clyde P. Kruskal. WorldScientific, 2019. [doi]

2010

New Solutions for Synchronized DomineeringSahil Bahri, Clyde P. Kruskal. CG 2011: 211-229 [doi]

2008

Retrograde Approximation Algorithms for Jeopardy Stochastic GamesHaw-ren Fang, James Glenn, Clyde P. Kruskal. icga, 31(2):77-96, 2008.

Finding large 3-free sets I: The small n caseWilliam I. Gasarch, James Glenn, Clyde P. Kruskal. jcss, 74(4):628-655, 2008. [doi]

A Retrograde Approximation Algorithm for Multi-player Can t StopJames Glenn, Haw-ren Fang, Clyde P. Kruskal. CG 2008: 252-263 [doi]

The orchard visibility problem and some variantsClyde P. Kruskal. jcss, 74(4):587-597, 2008. [doi]

The chromatic number of the plane: The bounded caseClyde P. Kruskal. jcss, 74(4):598-627, 2008. [doi]

2006

A Retrograde Approximation Algorithm for One-Player Can t StopJames Glenn, Haw-ren Fang, Clyde P. Kruskal. CG 2007: 148-159 [doi]

2003

Constant time parallel sorting: an empirical viewWilliam I. Gasarch, Evan Golub, Clyde P. Kruskal. jcss, 67(1):63-91, 2003. [doi]

2001

Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First SearchPilar de la Torre, Clyde P. Kruskal. mst, 34(4):275-298, 2001. [doi]

2000

A Survey of Constant Time Parallel SortingWilliam I. Gasarch, Evan Golub, Clyde P. Kruskal. eatcs, 72:84-102, 2000.

1998

The NYU Ultracomputer - Designing a MIMD, Shared-Memory Parallel MachineAllan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir. isca 1998: 239-254 [doi]

1996

Submachine Locality in the Bulk Synchronous Setting (Extended Abstract)Pilar de la Torre, Clyde P. Kruskal. europar 1996: 352-358

Exact Bandwith of Parallel-Processor NetworksPilar de la Torre, Clyde P. Kruskal. sirocco 1996: 195-209

1995

A structural theory of recursively decomposable parallel processor-networksPilar de la Torre, Clyde P. Kruskal. spdp 1995: 570-578 [doi]

Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra ProblemsPilar de la Torre, Clyde P. Kruskal. jal, 19(1):1-24, 1995.

1994

A Calculus of Adaptive Purpose Parallel ComputationPilar de la Torre, Clyde P. Kruskal. ifip11-9 1994: 521-526

Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection NetworksClyde P. Kruskal, Kevin J. Rappoport. spaa 1994: 132-139 [doi]

On the Effectiveness of Combining in Resolving Hot Spot ContentionGyungho Lee, Clyde P. Kruskal, David J. Kuck. jpdc, 20(2):136-144, 1994.

1993

Efficient Parallel Processing of Image ContoursLing Tony Chen, Larry S. Davis, Clyde P. Kruskal. pami, 15(1):69-81, 1993. [doi]

1992

Towards a single model of efficient computation in real parallel machinesPilar de la Torre, Clyde P. Kruskal. fgcs, 8(4):395-408, 1992. [doi]

Cost-Performance Tradeoffs for Interconnection NetworksClyde P. Kruskal, Marc Snir. DAM, 37/38:359-385, 1992. [doi]

1991

Processor networks and interconnection networks without long wires (extended abstract)Richard Beigel, Clyde P. Kruskal. sigarch, 19(1):15-24, 1991. [doi]

Towards a Single Model of Efficient Computation in Real Parallel MachinesPilar de la Torre, Clyde P. Kruskal. parle 1991: 6-24

Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First SearchPilar de la Torre, Clyde P. Kruskal. icpp 1991: 286-287

1990

A Complexity Theory of Efficient Parallel AlgorithmsClyde P. Kruskal, Larry Rudolph, Marc Snir. TCS, 71(1):95-132, 1990.

Efficient Parallel Algorithms for Graph ProblemsClyde P. Kruskal, Larry Rudolph, Marc Snir. algorithmica, 5(1):43-64, 1990.

1989

1988

A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract)Clyde P. Kruskal, Larry Rudolph, Marc Snir. icalp 1988: 333-346

Efficient Synchronization on Multiprocessors with Shared MemoryClyde P. Kruskal, Larry Rudolph, Marc Snir. TOPLAS, 10(4):579-601, 1988. [doi]

The Distribution of Waiting Times in Clocked Multistage Interconnection NetworksClyde P. Kruskal, Marc Snir, Alan Weiss. TC, 37(11):1337-1352, 1988.

On the notion of granularityClyde P. Kruskal, Carl H. Smith. tjs, 1(4):395-408, 1988. [doi]

1986

1985

Issues Related to MIMD Shared-memory Computers: The NYU Ultracomputer ApproachJan Edler, Allan Gottlieb, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir, Patricia J. Teller, James Wilson. isca 1985: 126-135

The Power of Parallel PrefixClyde P. Kruskal, Larry Rudolph, Marc Snir. icpp 1985: 180-185

The Power of Parallel PrefixClyde P. Kruskal, Larry Rudolph, Marc Snir. TC, 34(10):965-968, 1985.

Allocating Independent Subtasks on Parallel ProcessorsClyde P. Kruskal, Alan Weiss. TSE, 11(10):1001-1016, 1985.

The Effectiveness of Automatic Restructuring on Nonnumerical ProgramsGyungho Lee, Clyde P. Kruskal, David J. Kuck. icpp 1985: 607-613

An Empirical Study of Automatic Restructuring of Nonnumerical Programs for Parallel ProcessorsGyungho Lee, Clyde P. Kruskal, David J. Kuck. TC, 34(10):927-933, 1985.

Parallel Algorithms for Shortest Path ProblemsRichard C. Paige, Clyde P. Kruskal. icpp 1985: 14-20

1984

Complexity Results for Permuting Data and Other Computations on Parallel ProcessorsAllan Gottlieb, Clyde P. Kruskal. JACM, 31(2):193-209, 1984. [doi]

The Importance of Being SquareClyde P. Kruskal, Marc Snir. isca 1984: 91-98

1983

The NYU Ultracomputer - Designing an MIMD Shared Memory Parallel ComputerAllan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir. TC, 32(2):175-189, 1983.

Searching, Merging, and Sorting in Parallel ComputationClyde P. Kruskal. TC, 32(10):942-946, 1983.

The Performance of Multistage Interconnection Networks for MultiprocessorsClyde P. Kruskal, Marc Snir. TC, 32(12):1091-1098, 1983.

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: 27-42 [doi]

Results in parallel searching, merging, and sortingClyde P. Kruskal. icpp 1982: 196-198

Algorithms for replace-add based paracomputersClyde P. Kruskal. icpp 1982: 219-223

1981

Coordinating parallel processors: a partial unificationAllan Gottlieb, Clyde P. Kruskal. sigarch, 9(6):16-24, 1981. [doi]

Upper and Lower Bounds on the Performance of Parallel AlgorithmsClyde P. Kruskal. PhD thesis, New York University, USA, 1981.

A note on the worst case of heapsortClyde P. Kruskal, Elia Weixelbaum. sigact, 13(1):35-38, 1981. [doi]

1980

A note on sorting integers from a bounded rangeAllan Gottlieb, Clyde P. Kruskal. sigact, 12(3):66-67, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL