Difference between revisions of "Clyde Kruskal"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Clyde Kruskal''' FILE:ClydeKruskal2019.png|border|right|thumb| Clyde Kruskal in 2019 <ref>[https://commons.wikimedia.org/wiki/File:Clyd...") |
GerdIsenberg (talk | contribs) |
||
| Line 1: | Line 1: | ||
'''[[Main Page|Home]] * [[People]] * Clyde Kruskal''' | '''[[Main Page|Home]] * [[People]] * Clyde Kruskal''' | ||
| − | [[FILE:ClydeKruskal2019.png|border|right|thumb| Clyde Kruskal in 2019 <ref>[https://commons.wikimedia.org/wiki/File:ClydeKruskal2019.png Kruskal] on September 30, 2019, by Idespisemayonnaise, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]] | + | [[FILE:ClydeKruskal2019.png|border|right|thumb|240px| Clyde Kruskal in 2019 <ref>[https://commons.wikimedia.org/wiki/File:ClydeKruskal2019.png Kruskal] on September 30, 2019, by Idespisemayonnaise, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]] |
'''Clyde P. Kruskal''', (born May 25, 1954)<br/> | '''Clyde P. Kruskal''', (born May 25, 1954)<br/> | ||
Revision as of 19:19, 23 October 2019
Clyde Kruskal in 2019 [1]
Clyde P. Kruskal, (born May 25, 1954)
an American mathematician, computer scientist, and associate professor at University of Maryland, College Park with research interests in parallel architectures, algorithms, stochastic games and the game of Domineering [2] [3].
Contents
Selected Publications
1983 ...
- Clyde Kruskal (1983). Searching, Merging, and Sorting in Parallel Computation. IEEE Transactions on Computers, Vol. C-32, No 10
- Clyde Kruskal, Larry Rudolph, Marc Snir (1985). The power of parallel prefix. IEEE Transactions on Computers, Vol. C-34, No. 10
- Clyde Kruskal, Alan Weiss (1985). Allocating Independent Subtasks on Parallel Processors. IEEE Transactions on Software Engineering, Vol. 11, No. 10
- Clyde Kruskal, Marc Snir (1986). A Unified Theory of Interconnection Network Structure. Theoretical Computer Science, Vol. 48, No. 3
- Clyde Kruskal, Larry Rudolph, Marc Snir (1988). Efficient Synchronization on Multiprocessors with Shared Memory. ACM TOPLAS, Vol. 10, No. 4
1990 ...
- Clyde Kruskal, Larry Rudolph, Marc Snir (1990). A Complexity Theory of Efficient Parallel Algorithms. Theoretical Computer Science, Vol. 71
- Clyde Kruskal, Larry Rudolph, Marc Snir (1990). Efficient Parallel Algorithms for Graph Problems. Algorithmica, Vol. 5, No. 1
- Clyde Kruskal, Marc Snir (1992). Cost-Performance Tradeoffs for Interconnection Networks. Discrete Applied Mathematics, Vol. 37/38
2000 ...
- William Gasarch, Evan Golub, Clyde Kruskal (2003). Constant time parallel sorting: an empirical view. Journal of Computer and System Sciences, Vol. 67
- James Glenn, Haw-ren Fang, Clyde Kruskal (2006). A Retrograde Approximation Algorithm for One-Player Can’t Stop. CG 2006 [5]
- James Glenn, Haw-ren Fang, Clyde Kruskal (2007). A Retrograde Approximation Algorithm for Two-Player Can't Stop. CGW 2007
- Tristan Cazenave, Clyde Kruskal, Bruno Bouzy (2007). Computer Games Workshop 2007. ICGA Journal, Vol. 30, No. 2 » CGW 2007
- Haw-ren Fang, James Glenn, Clyde Kruskal (2008). Retrograde approximation algorithms for Jeopardy stochastic games. ICGA Journal, Vol. 31, No. 2
- James Glenn, Haw-ren Fang, Clyde Kruskal (2008). A Retrograde Approximation Algorithm for Multi-player Can’t Stop. CG 2008
- William Gasarch, James Glenn, Clyde Kruskal (2008). Finding Large 3-free Sets I: the Small η Case. pdf
2010 ...
External Links
Genealogy
References
- ↑ Kruskal on September 30, 2019, by Idespisemayonnaise, Wikimedia Commons
- ↑ Domineering from Wikipedia
- ↑ Sahil Bahri, Clyde Kruskal Standard Domineering. pdf
- ↑ dblp: Clyde P. Kruskal
- ↑ Can't Stop (board game) from Wikipedia
