default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClyde P. Kruskal
Person information
- affiliation: University of Maryland, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[b2]William Gasarch, Clyde P. Kruskal:
Problems with a Point - Exploring Math and Computer Science. WorldScientific 2019, ISBN 9789813279728, pp. 1-284- 2010
- [c27]Sahil Bahri, Clyde P. Kruskal:
New Solutions for Synchronized Domineering. Computers and Games 2010: 211-229
2000 – 2009
- 2008
- [j31]Haw-ren Fang, James Glenn, Clyde P. Kruskal:
Retrograde Approximation Algorithms for Jeopardy Stochastic Games. J. Int. Comput. Games Assoc. 31(2): 77-96 (2008) - [j30]Clyde P. Kruskal:
The orchard visibility problem and some variants. J. Comput. Syst. Sci. 74(4): 587-597 (2008) - [j29]Clyde P. Kruskal:
The chromatic number of the plane: The bounded case. J. Comput. Syst. Sci. 74(4): 598-627 (2008) - [j28]William I. Gasarch, James Glenn, Clyde P. Kruskal:
Finding large 3-free sets I: The small n case. J. Comput. Syst. Sci. 74(4): 628-655 (2008) - [c26]James Glenn, Haw-ren Fang, Clyde P. Kruskal:
A Retrograde Approximation Algorithm for Multi-player Can't Stop. Computers and Games 2008: 252-263 - 2006
- [c25]James Glenn, Haw-ren Fang, Clyde P. Kruskal:
A Retrograde Approximation Algorithm for One-Player Can't Stop. Computers and Games 2006: 148-159 - 2003
- [j27]William I. Gasarch, Evan Golub, Clyde P. Kruskal:
Constant time parallel sorting: an empirical view. J. Comput. Syst. Sci. 67(1): 63-91 (2003) - 2001
- [j26]Pilar de la Torre, Clyde P. Kruskal:
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search. Theory Comput. Syst. 34(4): 275-298 (2001) - 2000
- [j25]William I. Gasarch, Evan Golub, Clyde P. Kruskal:
A Survey of Constant Time Parallel Sorting. Bull. EATCS 72: 84-102 (2000)
1990 – 1999
- 1998
- [c24]Allan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir:
The NYU Ultracomputer - Designing a MIMD, Shared-Memory Parallel Machine. 25 Years ISCA: Retrospectives and Reprints 1998: 239-254 - 1996
- [c23]Pilar de la Torre, Clyde P. Kruskal:
Submachine Locality in the Bulk Synchronous Setting (Extended Abstract). Euro-Par, Vol. II 1996: 352-358 - [c22]Pilar de la Torre, Clyde P. Kruskal:
Exact Bandwith of Parallel-Processor Networks. SIROCCO 1996: 195-209 - 1995
- [j24]Pilar de la Torre, Clyde P. Kruskal:
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. J. Algorithms 19(1): 1-24 (1995) - [c21]Pilar de la Torre, Clyde P. Kruskal:
A structural theory of recursively decomposable parallel processor-networks. SPDP 1995: 570-578 - 1994
- [j23]Gyungho Lee, Clyde P. Kruskal, David J. Kuck:
On the Effectiveness of Combining in Resolving "Hot Spot" Contention. J. Parallel Distributed Comput. 20(2): 136-144 (1994) - [c20]Pilar de la Torre, Clyde P. Kruskal:
A Calculus of Adaptive Purpose Parallel Computation. IFIP Congress (1) 1994: 521-526 - [c19]Clyde P. Kruskal, Kevin J. Rappoport:
Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks. SPAA 1994: 132-139 - 1993
- [j22]Ling Tony Chen, Larry S. Davis, Clyde P. Kruskal:
Efficient Parallel Processing of Image Contours. IEEE Trans. Pattern Anal. Mach. Intell. 15(1): 69-81 (1993) - 1992
- [j21]Clyde P. Kruskal, Marc Snir:
Cost-Performance Tradeoffs for Interconnection Networks. Discret. Appl. Math. 37/38: 359-385 (1992) - [j20]Pilar de la Torre, Clyde P. Kruskal:
Towards a single model of efficient computation in real parallel machines. Future Gener. Comput. Syst. 8(4): 395-408 (1992) - 1991
- [j19]Richard Beigel, Clyde P. Kruskal:
Processor networks and interconnection networks without long wires (extended abstract). SIGARCH Comput. Archit. News 19(1): 15-24 (1991) - [c18]Pilar de la Torre, Clyde P. Kruskal:
Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search. ICPP (3) 1991: 286-287 - [c17]Pilar de la Torre, Clyde P. Kruskal:
Towards a Single Model of Efficient Computation in Real Parallel Machines. PARLE (1) 1991: 6-24 - 1990
- [j18]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
Efficient Parallel Algorithms for Graph Problems. Algorithmica 5(1): 43-64 (1990) - [j17]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
A Complexity Theory of Efficient Parallel Algorithms. Theor. Comput. Sci. 71(1): 95-132 (1990)
1980 – 1989
- 1989
- [j16]Xiaojun Shen, Y. Z. Cai, C. L. Liu, Clyde P. Kruskal:
Generalized latin squares I. Discret. Appl. Math. 25(1-2): 155-178 (1989) - [j15]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
Techniques for Parallel Manipulation of Sparse Matrices. Theor. Comput. Sci. 64(2): 135-157 (1989) - [c16]Clyde P. Kruskal, Marc Snir:
Cost-Bandwidth Tradeoffs for Communication Networks. SPAA 1989: 32-41 - [c15]C. P. Beigel, Clyde P. Kruskal:
Processor Networks and Interconnection Networks Without Long Wires. SPAA 1989: 42-51 - 1988
- [j14]Clyde P. Kruskal, Marc Snir, Alan Weiss:
The Distribution of Waiting Times in Clocked Multistage Interconnection Networks. IEEE Trans. Computers 37(11): 1337-1352 (1988) - [j13]Clyde P. Kruskal, Carl H. Smith:
On the notion of granularity. J. Supercomput. 1(4): 395-408 (1988) - [j12]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
Efficient Synchronization on Multiprocessors with Shared Memory. ACM Trans. Program. Lang. Syst. 10(4): 579-601 (1988) - [c14]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract). ICALP 1988: 333-346 - 1986
- [j11]Clyde P. Kruskal, Marc Snir:
A Unified Theory of Interconnection Network Structure. Theor. Comput. Sci. 48(3): 75-94 (1986) - [c13]Clyde P. Kruskal, Marc Snir, Alan Weiss:
The Distribution of Waiting Times in Clocked Multistage Interconnection Networks. ICPP 1986: 12-19 - [c12]Gyungho Lee, Clyde P. Kruskal, David J. Kuck:
The Effectiveness of Combining in Shared Memory Parallel Computer in the Presence of "Hot Spots". ICPP 1986: 35-41 - [c11]Clyde P. Kruskal, Larry Rudolph, Tom Madej:
Parallel Prefix on Fully Connected Direct Connection Machines. ICPP 1986: 278-284 - [c10]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
Efficient Parallel Algorithms for Graph Models. ICPP 1986: 869-876 - [c9]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
Efficient Synchronization on Multiprocessors with Shared Memory. PODC 1986: 218-228 - 1985
- [j10]Gyungho Lee, Clyde P. Kruskal, David J. Kuck:
An Empirical Study of Automatic Restructuring of Nonnumerical Programs for Parallel Processors. IEEE Trans. Computers 34(10): 927-933 (1985) - [j9]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
The Power of Parallel Prefix. IEEE Trans. Computers 34(10): 965-968 (1985) - [j8]Clyde P. Kruskal, Alan Weiss:
Allocating Independent Subtasks on Parallel Processors. IEEE Trans. Software Eng. 11(10): 1001-1016 (1985) - [c8]Richard C. Paige, Clyde P. Kruskal:
Parallel Algorithms for Shortest Path Problems. ICPP 1985: 14-20 - [c7]Clyde P. Kruskal, Larry Rudolph, Marc Snir:
The Power of Parallel Prefix. ICPP 1985: 180-185 - [c6]Gyungho Lee, Clyde P. Kruskal, David J. Kuck:
The Effectiveness of Automatic Restructuring on Nonnumerical Programs. ICPP 1985: 607-613 - [c5]Jan Edler, Allan Gottlieb, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir, Patricia J. Teller, James Wilson:
Issues Related to MIMD Shared-memory Computers: The NYU Ultracomputer Approach. ISCA 1985: 126-135 - 1984
- [j7]Allan Gottlieb
, Clyde P. Kruskal:
Complexity Results for Permuting Data and Other Computations on Parallel Processors. J. ACM 31(2): 193-209 (1984) - [c4]Clyde P. Kruskal, Marc Snir:
The Importance of Being Square. ISCA 1984: 91-98 - 1983
- [j6]Allan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir:
The NYU Ultracomputer - Designing an MIMD Shared Memory Parallel Computer. IEEE Trans. Computers 32(2): 175-189 (1983) - [j5]Clyde P. Kruskal:
Searching, Merging, and Sorting in Parallel Computation. IEEE Trans. Computers 32(10): 942-946 (1983) - [j4]Clyde P. Kruskal, Marc Snir:
The Performance of Multistage Interconnection Networks for Multiprocessors. IEEE Trans. Computers 32(12): 1091-1098 (1983) - 1982
- [c3]Clyde P. Kruskal:
Results in parallel searching, merging, and sorting. ICPP 1982: 196-198 - [c2]Clyde P. Kruskal:
Algorithms for replace-add based paracomputers. ICPP 1982: 219-223 - [c1]Allan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir:
The NYU Ultracomputer-designing a MIMD, shared-memory parallel machine (Extended Abstract). ISCA 1982: 27-42 - 1981
- [b1]Clyde P. Kruskal:
Upper and Lower Bounds on the Performance of Parallel Algorithms. New York University, USA, 1981 - [j3]Clyde P. Kruskal, Elia Weixelbaum:
A note on the worst case of heapsort. SIGACT News 13(1): 35-38 (1981) - [j2]Allan Gottlieb, Clyde P. Kruskal:
Coordinating parallel processors: a partial unification. SIGARCH Comput. Archit. News 9(6): 16-24 (1981) - 1980
- [j1]Allan Gottlieb, Clyde P. Kruskal:
A note on sorting integers from a bounded range. SIGACT News 12(3): 66-67 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
