Most cited papers from Digital Wave (United States)
What are the most cited papers from Digital Wave (United States)?
The most cited paper from Digital Wave (United States) is "The JPEG still picture compression standard" (Gregory K. Wallace, 1991), with 3,800 citations. Next come "Advances in molecular quantum chemistry contained in the Q-Chem 4 program package" (3,174) and "The part-time parliament" (2,747).
Showing 50 of 58 papers. Every paper with more than 300 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | The JPEG still picture compression standard Gregory K. Wallace · Communications of the ACM | Apr 1991 | 3,800 |
| 2 | Advances in molecular quantum chemistry contained in the Q-Chem 4 program package Yihan Shao et al. · Molecular Physics | 3 Sep 2014 | 3,174 |
| 3 | The part-time parliament Leslie Lamport · ACM Transactions on Computer Systems | May 1998 | 2,747 |
| 4 | A logic of authentication Michael T. Burrows, Martı́n Abadi, Roger M. Needham · ACM Transactions on Computer Systems | Feb 1990 | 2,541 |
| 5 | Wait-free synchronization Maurice P. Herlihy · ACM Transactions on Programming Languages and Systems | 1991 | 1,853 |
| 6 | Summary cache: a scalable wide-area Web cache sharing protocol Li Fan, Pei Cao, Jussara Marques Almeida et al. · IEEE/ACM Transactions on Networking | Jun 2000 | 1,827 |
| 7 | Eraser Stefan Savage, Michael T. Burrows, Greg M. Nelson et al. · ACM Transactions on Computer Systems | Nov 1997 | 1,576 |
| 8 | Software for the frontiers of quantum chemistry: An overview of developments in the Q-Chem 5 package Evgeny Epifanovsky et al. · The Journal of Chemical Physics | 23 Aug 2021 | 1,434 |
| 9 | The log-structured merge-tree (LSM-tree) Patrick Eugene O'Neil, Edward T. Cheng, Dieter Gawlick et al. · Acta Informatica | Jun 1996 | 1,326 |
| 10 | Parallel database systems David J. DeWitt, Jim Gray · Communications of the ACM | Jun 1992 | 1,293 |
| 11 | Efficient erasure correcting codes Michael G. Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · IEEE Transactions on Information Theory | 2001 | 1,195 |
| 12 | Shared memory consistency models: a tutorial Sarita V. Adve, Kourosh Gharachorloo · Computer | 1996 | 1,124 |
| 13 | Mobile ambients Luca Cardelli, Andrew D. Gordon · Theoretical Computer Science | Jun 2000 | 1,050 |
| 14 | FASTHENRY: a multipole-accelerated 3-D inductance extraction program Mattan Kamon, M.J. Ttsuk, Jacob White · IEEE Transactions on Microwave Theory and Techniques | 1994 | 1,028 |
| 15 | Fractured polymer/silica fiber surface studied by tapping mode atomic force microscopy Qian Zhong, Daryl Inniss, K. Kjoller et al. · Surface Science | Jun 1993 | 908 |
| 16 | Energy dissipation in tapping-mode atomic force microscopy J. P. Cleveland, Boris Anczykowski, A. E. Schmid et al. · Applied Physics Letters | 18 May 1998 | 877 |
| 17 | Signal Delay in RC Tree Networks J. Rubinstein, Paul Penfield, Mark Horowitz · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems | Jul 1983 | 851 |
| 18 | On interprocess communication Leslie Lamport · Distributed Computing | Jun 1986 | 849 |
| 19 | Improved low-density parity-check codes using irregular graphs Michael G. Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · IEEE Transactions on Information Theory | 2001 | 811 |
| 20 | Global Supply Chain Management at Digital Equipment Corporation Bruce C. Arntzen, Gerald G. Brown, Terry P. Harrison et al. · INFORMS Journal on Applied Analytics | Feb 1995 | 803 |
| 21 | Exploiting choice Dean Michael Tullsen, Susan J. Eggers, Joel Emer et al. | May 1996 | 782 |
| 22 | The existence of refinement mappings Martı́n Abadi, Leslie Lamport · Theoretical Computer Science | May 1991 | 740 |
| 23 | Kalman filter-based algorithms for estimating depth from image sequences Larry H. Matthies, Takeo Kanade, Richard Szeliski · International Journal of Computer Vision | Sep 1989 | 716 |
| 24 | Improved Algorithms for Topic Distillation in a Hyperlinked Environment Krishna A. Bharat, Monika Rauch Henzinger · ACM SIGIR Forum | 2 Aug 2017 | 678 |
| 25 | Autonet: a high-speed, self-configuring local area network using point-to-point links Michael D. Schroeder, Andrew D. Birrell, Michael T. Burrows et al. · IEEE Journal on Selected Areas in Communications | 1991 | 656 |
| 26 | A 160-MHz, 32-b, 0.5-W CMOS RISC microprocessor J. Montanaro, Richard T. Witek, K. Anne et al. · IEEE Journal of Solid-State Circuits | Nov 1996 | 644 |
| 27 | Authentication in distributed systems Butler Lampson, Martín Abadi, Michael T. Burrows et al. · ACM Transactions on Computer Systems | Nov 1992 | 610 |
| 28 | Prudent engineering practice for cryptographic protocols M. Abadi, Rodney Needham · IEEE Transactions on Software Engineering | 1996 | 577 |
| 29 | A calculus for access control in distributed systems Martı́n Abadi, Michael T. Burrows, Butler Lampson et al. · ACM Transactions on Programming Languages and Systems | Sep 1993 | 577 |
| 30 | Scheduling real-time transactions Robert K. Abbott, Héctor García-Molina · ACM Transactions on Database Systems | Sep 1992 | 575 |
| 31 | Packet Trains--Measurements and a New Model for Computer Network Traffic Raj Kumar Jain, S. Routhier · IEEE Journal on Selected Areas in Communications | Sep 1986 | 550 |
| 32 | Usability Engineering: Our Experience and Evolution John Whiteside, John L. Bennett, Karen Holtzblatt · Elsevier eBooks | 1988 | 520 |
| 33 | Short cantilevers for atomic force microscopy Deron A. Walters, J. P. Cleveland, Neil H. Thomson et al. · Review of Scientific Instruments | Oct 1996 | 493 |
| 34 | A fast mutual exclusion algorithm Leslie Lamport · ACM Transactions on Computer Systems | 5 Jan 1987 | 489 |
| 35 | Continuous profiling Jennifer M. L. Anderson, Lance M. Berc, Jeffrey A. Dean et al. · ACM Transactions on Computer Systems | Nov 1997 | 482 |
| 36 | A methodology for implementing highly concurrent data objects Maurice P. Herlihy · ACM Transactions on Programming Languages and Systems | Nov 1993 | 471 |
| 37 | Composing specifications Martı́n Abadi, Leslie Lamport · ACM Transactions on Programming Languages and Systems | 1993 | 460 |
| 38 | Conjoining specifications Martı́n Abadi, Leslie Lamport · ACM Transactions on Programming Languages and Systems | May 1995 | 451 |
| 39 | Mobile ambients Luca Cardelli, Andrew D. Gordon · Lecture notes in computer science | 1998 | 448 |
| 40 | A cluster-based approach for routing in dynamic networks Parimala Venkata Krishna, Nitin H. Vaidya, Mainak Chatterjee et al. · ACM SIGCOMM Computer Communication Review | Apr 1997 | 439 |
| 41 | Graphical fisheye views Manojit Sarkar, Marc H. Brown · Communications of the ACM | Dec 1994 | 424 |
| 42 | Dithering with blue noise Robert A. Ulichney · Proceedings of the IEEE | 1988 | 415 |
| 43 | Experience with a learning personal assistant Tom M. Mitchell, Rich Caruana, Dayne Freitag et al. · Communications of the ACM | Jul 1994 | 414 |
| 44 | Simultaneous multithreading: a platform for next-generation processors Susan J. Eggers, Joel Emer, Henry M. Levy et al. · IEEE Micro | Sep 1997 | 409 |
| 45 | When the Interface Is a Face Lee S. Sproull, Mani Subramani, Sara B. Kiesler et al. · Human-Computer Interaction | Jun 1996 | 398 |
| 46 | A 200-MHz 64-b dual-issue CMOS microprocessor D.W. Dobberpuhl et al. · IEEE Journal of Solid-State Circuits | 1992 | 392 |
| 47 | Providing high availability using lazy replication Rivka Ladin, Barbara H. Liskov, Liuba Shrira et al. · ACM Transactions on Computer Systems | Nov 1992 | 387 |
| 48 | The multiflow trace scheduling compiler P. Geoffrey Lowney, Stefan M. Freudenberger, Thomas J. Karzes et al. · The Journal of Supercomputing | May 1993 | 379 |
| 49 | A binary feedback scheme for congestion avoidance in computer networks Kadangode K. Ramakrishnan, Raj Kumar Jain · ACM Transactions on Computer Systems | May 1990 | 367 |
| 50 | Generating random spanning trees Arndt Bröder | 1989 | 358 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for an institution when any of its authors gave it as an affiliation; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.