2026 Harold S. Stone: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	National Ranking	Publications	Citations
Computer Science	40	9077	3858	115	11319

Discipline name

D-Index

World Ranking

National Ranking

Publications

Citations

Computer Science

9077

3858

115

11319

Research.com Recognitions

1994 - ACM Fellow
1987 - IEEE Fellow For contributions to parallel and distributed computing, and computer education.

Overview

Harold S. Stone is affiliated with Princeton University in the United States.

Recent research contributions include the paper titled Exceptional Congruences for Eta-quotient newforms, published in 2025 at arXiv (Cornell University).

Exceptional Congruences for Eta-quotient newforms, 2025, arXiv (Cornell University)

Frequent coauthors of Harold S. Stone include:

Eddie O'Sullivan
Swati
Xiaolan Jin

Publication venues associated with Harold S. Stone's work include:

arXiv (Cornell University)

Harold S. Stone has been recognized by the following awards:

ACM Fellow, 1994
IEEE Fellow, 1987, for contributions to parallel and distributed computing, and computer education

Best Publications

Parallel Processing with the Perfect Shuffle

H.S. Stone

1886
Citations
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

Peter M. Kogge;Harold S. Stone

1840
Citations
Multiprocessor Scheduling with the Aid of Network Flow Algorithms

H.S. Stone

1028
Citations
A fast direct Fourier-based algorithm for subpixel registration of images

H.S. Stone;M.T. Orchard;Ee-Chien Chang;S.A. Martucci

527
Citations
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

Harold S. Stone

470
Citations
A Logic-in-Memory Computer

Harold S. Stone

342
Citations
Optimal partitioning of cache memory

H.S. Stone;J. Turek;J.L. Wolf

290
Citations
Introduction to Computer Architecture

Harold S. Stone

273
Citations
Control of Distributed Processes

H.S. Stone;S.H. Bokhari

256
Citations
Parallel Tridiagonal Equation Solvers

Harold S. Stone

239
Citations
Critical Load Factors in Two-Processor Distributed Systems

H.S. Stone

232
Citations
Discrete Mathematical Structures and Their Applications

Harold S. Stone

211
Citations
Optimizing Murty's ranked assignment method

M.L. Miller;H.S. Stone;I.J. Cox

210
Citations
Footprints in the cache

Dominique Thiebaut;Harold S. Stone

186
Citations
Improving disk cache hit-ratios through cache partitioning

D. Thiebaut;H.S. Stone;J.L. Wolf

161
Citations
A Shuffle-Exchange Network with Simplified Control

Tomas Lang;Harold S. Stone

152
Citations
Multiple reservations and the Oklahoma update

J.M. Stone;H.S. Stone;P. Heidelberger;J. Turek

146
Citations
Synthetic traces for trace-driven simulation of cache memories

D. Thiebaut;J.L. Wolf;H.S. Stone

140
Citations
Posting multiple reservations with a conditional store atomic operations in a multiprocessing environment

Harold Stuart Stone;Janice Murphy Stone

138
Citations
Footprints in the cache

Harold S. Stone;Dominique Thibaut

17
Citations
High-performance computer architecture

Harold S. Stone

0
Citations

Frequent Co-Authors

Joel L. Wolf IBM (United States)

Michael T. Orchard Rice University

Ingemar J. Cox University College London

Matthew L. Miller NEC (United States)

Peter M. Kogge University of Notre Dame

Yale N. Patt The University of Texas at Austin

Philip Heidelberger IBM (United States)

Colin McDiarmid University of Oxford

Lawrence H. Snyder Washington University in St. Louis

Thomas W. Ebbesen University of Strasbourg

External Links

Wikipedia of Harold S. Stone Personal website of Harold S. Stone Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring Computer Science opens many doors to related online degrees and professional pathways. For those seeking specialized technical skills, options like an online master’s in electrical engineering degree offer advanced training in essential areas such as circuits, communications, and embedded systems—all from the flexibility of home.

If quick career advancements are the goal, consider picking up certifications that pay well. These programs can be completed in a shorter timeframe and provide a fast route into high-demand tech roles.

For those balancing time and cost, exploring the quickest cheapest masters degree can help you earn an advanced credential without a lengthy commitment or excessive student debt.

Finally, focusing on the most useful masters degrees ensures your investment leads to opportunities in growing tech industries. Each pathway has unique advantages, so assess your interests, schedule, and career goals to choose the best fit.