Guy Blelloch
| Guy Blelloch | |
|---|---|
| Residence | Pittsburgh |
| Fields | Computer Science |
| Institutions | Carnegie Mellon University |
| Alma mater | Swarthmore College, Massachusetts Institute of Technology |
| Thesis | Vector Models for Data-Parallel Computing (1988) |
| Doctoral advisor | Charles E. Leiserson |
Guy Edward Blelloch is a professor of computer science at the Carnegie Mellon University.[1][2] He is known for his work in parallel programming and parallel algorithms.[3] He teaches the 15-853: Algorithms in the Real World[4] course, the 15-492: Parallel Algorithms (Spring 09) course, and the 15-210: Parallel and Sequential Data Structure and Algorithms (Fall 11) course at the Carnegie Mellon University.[1] In 2011 he was inducted as a Fellow of the Association for Computing Machinery.[5]
See also
References
- 1 2 "Guy Blelloch". Cs.cmu.edu. 1997-01-21. Retrieved 2011-03-12.
- ↑ "Is Parallel Programming Hard? Prof. Guy Blelloch Argues That It Isn't". InfoQ. Retrieved 2011-03-12.
- ↑ "Is Parallel Programming Hard? - Intel® Software Network". Software.intel.com. 2009-04-16. Retrieved 2011-03-12.
- ↑ "Algorithms in the Real World".
- ↑ http://fellows.acm.org/fellow_citation.cfm?id=3352499&srt=year&year=2011
External links
This article is issued from Wikipedia - version of the 10/31/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.