World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
65
Citations
17936
World Ranking
2450
National Ranking
1228

Research.com Recognitions

  • 2011 - ACM Fellow For contributions to parallel computing.

Overview

Guy E. Blelloch is affiliated with Carnegie Mellon University in the United States and specializes in Computer Science. Their research contributions span various subfields including Computer Networks and Communications, Artificial Intelligence, Hardware and Architecture, Computational Theory and Mathematics, and Computer Vision and Pattern Recognition.

The scientist's recent scholarly output reflects a focus on topics related to Parallel Computing and Optimization Techniques, Distributed Systems and Fault Tolerance, Graph Theory and Algorithms, Optimization and Search Problems, Complexity and Algorithms in Graphs, Advanced Database Systems and Queries, and Algorithms and Data Compression.

Their recent publications include:

  • Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable, 2021, ACM Transactions on Parallel Computing
  • Joinable Parallel Balanced Binary Trees, 2022, ACM Transactions on Parallel Computing
  • PIM-Tree, 2022, Proceedings of the VLDB Endowment
  • Sage, 2020, Proceedings of the VLDB Endowment
  • Parallelism in Randomized Incremental Algorithms, 2020, Journal of the ACM

Frequent coauthors collaborating with Guy E. Blelloch include Laxman Dhulipala, Yuanhao Wei, Yihan Sun, Charles McGuffey, and Phillip B. Gibbons.

The scientist has published predominantly in the following venues:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • ACM Transactions on Parallel Computing
  • Proceedings of the VLDB Endowment
  • Journal of the ACM

In recognition of their contributions to the field of parallel computing, Guy E. Blelloch was named an ACM Fellow in 2011.

Best Publications

  • GraphChi: large-scale graph computation on just a PC

    Aapo Kyrola;Guy Blelloch;Carlos Guestrin

  • Ligra: a lightweight graph processing framework for shared memory

    Julian Shun;Guy E. Blelloch

  • Vector models for data-parallel computing

    Guy E. Blelloch

  • Scans as primitive parallel operations

    G.E. Blelloch

  • Programming parallel algorithms

    Guy E. Blelloch

  • Prefix sums and their applications

    Guy E. Blelloch

  • Implementation of a portable nested data-parallel language

    Guy E. Blelloch;Jonathan C. Hardwick;Jay Sipelstein;Marco Zagha

  • A comparison of sorting algorithms for the connection machine CM-2

    Guy E. Blelloch;Charles E. Leiserson;Bruce M. Maggs;C. Greg Plaxton

  • The data locality of work stealing

    Umut A. Acar;Guy E. Blelloch;Robert D. Blumofe

  • NESL: A Nested Data-Parallel Language

    Guy E. Blelloch

  • Methods and apparatus for scheduling parallel processors

    Guy E. Blelloch;Phillip B. Gibbons;Yossi Matias;Girija J. Narlikar

  • Scheduling threads for constructive cache sharing on CMPs

    Shimin Chen;Phillip B. Gibbons;Michael Kozuch;Vasileios Liaskovitis

  • NESL: A Nested Data-Parallel Language. (Version 3.1),

    Guy E. Blelloch

  • Brief announcement: the problem based benchmark suite

    Julian Shun;Guy E. Blelloch;Jeremy T. Fineman;Phillip B. Gibbons

  • A parallel, real-time garbage collector

    Perry Cheng;Guy E. Blelloch

  • Implementation of a portable nested data-parallel language

    Guy E. Blelloch;Jonathan C. Hardwick;Siddhartha Chatterjee;Jay Sipelstein

  • Compiling collection-oriented languages onto massively parallel computers

    Guy E. Blelloch;Gary W. Sabot

  • Provably efficient scheduling for languages with fine-grained parallelism

    Guy E. Blelloch;Phillip B. Gibbons;Yossi Matias

  • Radix sort for vector multiprocessors

    Marco Zagha;Guy E. Blelloch

  • A provable time and space efficient implementation of NESL

    Guy E. Blelloch;John Greiner

  • The Data Locality of Work Stealing

    Umut A. Acar;Guy E. Blelloch;Robert D. Blumofe

  • Adaptive functional programming

    Umut A. Acar;Guy E. Blelloch;Robert Harper

  • A Comparison of Sorting Algorithms for the Connection Machine CM-2.

    Guy E. Blelloch;Charles E. Leiserson;Bruce M. Maggs;C. Greg Plaxton

Frequent Co-Authors

Phillip B. Gibbons
Phillip B. Gibbons Carnegie Mellon University
Robert Harper
Robert Harper Carnegie Mellon University
R. Ravi
R. Ravi Carnegie Mellon University
Gary L. Miller
Gary L. Miller Carnegie Mellon University
Bruce M. Maggs
Bruce M. Maggs Duke University
Perry Cheng
Perry Cheng IBM (United States)
Yossi Matias
Yossi Matias Google (United States)
Anupam Gupta
Anupam Gupta Carnegie Mellon University
Todd C. Mowry
Todd C. Mowry Carnegie Mellon University
Eran Halperin
Eran Halperin University of California, Los Angeles

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a degree in Computer Science opens doors to a wide variety of academic and professional pathways. It’s helpful to explore the best degrees that align with your career ambitions, whether you’re interested in software engineering, data analytics, or cybersecurity.

If you’re looking to specialize further or advance quickly, consider programs like an easy online masters degree, designed to be more flexible and faster to complete. These options are ideal for busy professionals seeking a boost in credentials without a major time commitment.

For those aspiring to the highest academic levels, finding affordable PhD programs is crucial. Cost-effective online doctorates provide opportunities to conduct research or teach in academia.

Alternatively, educators and leaders in technology may benefit from cheapest EdD programs online. These programs focus on educational leadership and can be completed in a shorter timeframe—ideal for those looking to make an impact in academic or training settings.

Best Scientists Citing Guy E. Blelloch

Trending Scientists

Recently Published Articles