Most Cited Computer Science Articles

This list is generated from documents in the CiteSeerx database as of May 20, 2012. This list is automatically generated and may contain errors. The list is generated in batch mode and citation counts may differ from those currently in the CiteSeerx database, since the database is continuously updated.

All Years | 1990 | 1991 | 1992 | 1993 | 1994 | 1995 | 1996 | 1997 | 1998 | 1999 | 2000 | 2001 | 2002 | 2003 | 2004 | 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012
  1. A P Dempster, N M Laird, D B Rubin.
    Maximum likelihood from incomplete data via the em algorithm. Journal of Royal Statistical Society, Series B, 1977
    5972
  2. C A R Hoare.
    Communicating sequential processes. ISSN 0001-0782. URL http://doi.acm.org/10.1145/359576, 1978
    3056
  3. I Stoica, R Morris, D Liben-Nowell, D Karger, M F Kaashoek, F Dabek, H Balakrishnan.
    Chord: A scalable peer-to-peer lookup service for Internet applications. In SIGCOMM, 2001
    2971
  4. J R QUINLAN.
    Induction of Decision Trees. 0
    2845
  5. D G Lowe.
    Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision, 0
    2804
  6. S Kirkpatrick, C D Gelatt, M P Vecchi.
    Optimization by simulated annealing. Science, 1983
    2741
  7. R S Sutton, A G Barto.
    Reinforcement Learning: An Introduction. 1998
    2674
  8. Randal E Bryant.
    Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 1986
    2577
  9. C L Liu, J W Layland.
    Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the Association for Computing Machinery, 1973
    2515
  10. S Brin, L Page.
    The anatomy of a large-scale hypertextual web search engine. in: Proceedings of the 7th World Wide Web Conference, 1998
    2453
  11. R L Rivest, A Shamir, L Adleman.
    A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM, 1978
    2440
  12. M Kass, A Witkin, D Terzopoulos.
    Snakes: Active contour models. International Journal of Computer Vision, 1988
    2391
  13. S Ratnasamy, P Francis, M Handley, R Karp, S Shenker.
    A scalable content-addressable network. SIGCOMM Computer Communication Review, 0
    2304
  14. W Diffie, M Hellman.
    New directions in cryptography. IEEE Trans. Inform. Theory, 1976
    2230
  15. M Turk, A Pentland.
    Eigenfaces for recognition. Journal of Cognitive Neuroscience, 1991
    2187
  16. J M Kleinberg.
    Authoritative sources in a hyperlinked environment. Journal of the ACM, 1999
    2152
  17. R Agrawal, R Srikant.
    Fast Algorithm for Mining Association Rules. Proc. 20th Int’l Conf. Very Large Data Bases (VLDB ’94, 1994
    2096
  18. S Deerwester, S Dumais, T Landauer, G Furnas, R Harshman.
    Indexing by latent semantic analysis. Journal of the American Society of Information Science, 1990
    2089
  19. A Menezes, P van Oorschot, S Vanstone.
    Handbook of Applied Cryptography. 1997
    1990
  20. E M Clarke, O Grumberg, D A Peled.
    Model Checking. 1999
    1975
  21. L Breiman.
    Bagging predictors. Machine Learning, 1996
    1940
  22. D Harel.
    Statecharts: A visual formalism for complex systems. Science of Computer Programming, 1987
    1935
  23. S Floyd, V Jacobson.
    Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking, 1993
    1908
  24. T Imielinski, R Agrawal, A Swami.
    Mining association rules between sets of items in large databases. Proc. ACM SIGMOD Conf. Management of Data, 0
    1885
  25. C H Papadimitriou.
    Computational Complexity. 1994
    1867
  26. R Baeza-Yates, B Ribeiro-Neto.
    Modern Information Retrieval. 1999
    1867
  27. S Mallat.
    A Theory for Multiresolution Signal Decomposition: the Wavelet Representation. IEEE Trans. on Patt. Anal. Mach Intell, 1989
    1836
  28. T R Gruber.
    A Translation Approach to Portable Ontology Specifications. Knowledge Acquisition, 1993
    1828
  29. D Johnson, D Maltz.
    Dynamic source routing in ad-hoc wireless networks routing protocols. In Mobile Computing, 1996
    1793
  30. J Shi, J Malik.
    Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
    1735
  31. William E Lorensen, Harvey E Cline.
    Marching cubes: A high resolution 3d surface construction algorithm. Computer Graphics, 1987
    1684
  32. S F Altschul, T L Madden, A A Schaffer.
    Gapped blast and psi-blast: a new generation of protein database search programs. Nucleic Acids Res. 25, 3389–3402. FU ET AL, 1997
    1671
  33. C E Perkins, E M Royer.
    Ad Hoc On-Demand Distance Vector Routing. Proceedings of IEEE Workshop on Mobile Computing Systems and Applications, Pages, 1999
    1662
  34. I Foster, C Kesselman, S Tuecke.
    The anatomy of the Grid: Enabling scalable virtual organizations. International Journal of Supercomputing Applications, 0
    1660
  35. Casner Schulzrinne, Jacobson Frederick.
    RTP: A Transport Protocol for Real-Time Applications. 1996
    1650
  36. Y Freund, R E.
    Schapire, Decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 1997
    1629
  37. R Alur, D L Dill.
    A theory of timed automata. Theoretical Computer Science, 1994
    1626
  38. C J C Burges.
    A Tutorial on support vector machines for pattern recognition. Data Min. Knowledge Discovery, 0
    1594
  39. Mitchell P Marcus, Beatrice Santorini, Mary Ann Marcinkiewicz.
    Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 1993
    1587
  40. Will E Leland, Murad S Taqq, Walter Willinger, Daniel V Wilson.
    On the selfsimilar nature of Ethernet traffic. In Deepinder P. Sidhu, editor, ACM SIGCOMM, 1993
    1567
  41. L Page, S Brin, R Motwani, T Winograd.
    The Pagerank citation ranking: Bring order to the web. Stanford University, 1998
    1520
  42. P Gupta, P R Kumar.
    The Capacity of Wireless Networks. IEEE Trans. on Information Theory, 2000
    1515
  43. A K Parekh.
    A generalized processor sharing approach to flow control in integrated services network. Ph.D. dissertation, EECS Dept., M.I.T, 1992
    1492
  44. A Rowstron, P Druschel.
    Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Sys-tems. Proc. IFIP/ACM Int’l Conf. Distributed Systems Platforms (Middleware ’01, 2001
    1488
  45. B Schölkopf, A Smola.
    Learning with kernels. 2002
    1456
  46. D C Burger, T M Austin.
    The SimpleScalar tool set, version 2.0. Computer Architecture News, 1997
    1456
  47. J Lafferty, A McCallum, F Pereira.
    Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of 18th International Conference on Machine Learning (ICML2001, 2001
    1444
  48. B D Lucas, Takeo Kanade.
    An iterative image registration technique with an application in stereo vision. In Intl. Joint Conf. on AI (IJCAI, 1981
    1424
  49. D Kahneman, A Tversky.
    Prospect theory: An analysis of decision under risk. Econometrica, 1979
    1411
  50. C Cortes, V Vapnik.
    Support-vector networks. Machine Learning, 1995
    1409
  51. Ian Foster, Carl Kesselman.
    Globus: a Metacomputing Infrastructure Toolkit. International Journal of High Performance Computing Applications, 1997
    1397
  52. Bjarne Stroustrup.
    The C++ Programming Language. 2000
    1378
  53. A Shamir.
    How to share a secret. Communications of the ACM, 1979
    1347
  54. B Schunck B K P Horn.
    Determining optical flow. Bla] [ea99] Dr. Ronald Blakey. Global Plate Tectonics and Paleogeography, 1981
    1338
  55. T Berners-Lee, J Hendler, Lassila.
    O.: The Semantic Web. Scientific American, 2001
    1337
  56. John McCarthy, Patrick J Hayes.
    Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4, 1969
    1332
  57. T Joachims.
    Text Categorization with Support Vector Machines: Learning with Many Relevant Features. Proceedings of 10th ECML Conference, 1998
    1330
  58. Gregor Kiczales, John Lamping, Anurag Menhdhekar, Chris Maeda, Cristina Lopes, JeanMarc Loingtier, John Irwin.
    Aspect-oriented programming. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP, 1997
    1320
  59. Y Freund, R Shapire.
    Experiments with a new boosting algorithm. in Intl. Conf. on Machine Learning (ICML, 1996
    1293
  60. J L Elman.
    Finding structure in time. Cognitive Science, 1990
    1290
  61. Andrzej Trybulec.
    Tarski Grothendieck set theory. Formalized Mathematics, 1990
    1274
  62. M J Fisher, N A Lynch, M S Paterson.
    Impossibility of distributed consensus with one faulty process. in Proc. 2nd ACM Symp. Principles of Database Syst, 1983
    1267
  63. George A Miller, Richard Beckwith, Christiane Fellbaum, Derek Gross, Katherine J Miller.
    Introduction to WordNet: An On-line Lexical Database. International Journal of Lexicography, 1990
    1252
  64. V Paxson, S Floyd.
    Wide-area traffic: The failure of poisson modeling. IEEE/ACM Transactions on Networking, 1995
    1247
  65. M Gelfond, V Lifschitz.
    The stable model semantics for logic programming. Proceedings of the 5th International Conference and Symposium on Logic Programming, 1988
    1241
  66. P Erdos, A Renyi.
    The evolution of random graphs. Magyar Tud. Akad. Mat. Kutato Int. Kozl, 1960
    1229
  67. Czes̷law Byliński.
    Functions and their basic properties. Formalized Mathematics, 1990
    1222
  68. Peter Pin-Shan Chen.
    The entity-relationship model — toward a unified view of data. Database Systems — Special Issue: Papers from the International Conference on Very Large Data Bases, 1976
    1220
  69. R S Bird, P Wadler.
    Introduction to Functional Programming. 0
    1217
  70. Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David E Culler, Kristofer S J Pister.
    System architecture directions for networked sensors. In Architectural Support for Programming Languages and Operating Systems, 2000
    1213
  71. C Hoare.
    An axiomatic basis for computer programming. Communications of the ACM, 1969
    1192
  72. C E Perkins, P Bhagwat.
    Highly Dynamic DestinationSequenced Distance-Vector Routing (DSDV) for Mobile Computers. SIGCOMM 94 -8/94 London England UK @ 1994 ACM, 0
    1192
  73. D M Blei, A Ng, M I Jordan.
    Latent Dirichlet allocation. Journal of Machine Learning Research, 0
    1189
  74. B Karp, H T Kung.
    GPSR: greedy perimeter stateless routing for wireless networks. in Proc. International Conference on Mobile Computing and Networking (MobiCom'00, 2000
    1188
  75. R A Brooks.
    Intelligence without representation. Artif. Intell, 1991
    1179
  76. J K Ousterhout.
    Tcl and the Tk Toolkit. 1994
    1177
  77. G Salton, C Buckley.
    Term-weighting approaches in automatic text retrieval. In Information Processing and Management, 1988
    1175
  78. G D Plotkin.
    A structural approach to operational semantics. J. Log. Algebr. Program, 2004
    1168
  79. R Axelrod, W Hamilton.
    The evolution of cooperation. 0
    1144
  80. Zinaida Trybulec.
    Properties of subsets. Formalized Mathematics, 1990
    1143
  81. J Broch, D A Maltz, D B Johnson, Y C Hu, J Yetcheva.
    A performance comparison of multi-hop wireless ad hoc network routing protocols. in Proceedings of the ACM/IEEE International Conferenceon Mobile Computing and Networking (MOBICOM’98),1998, 0
    1141
  82. B H BLOOM.
    Space/time trade-offs in hash coding with allowable errors. Communications of ACM, 1970
    1134
  83. G Holzmann.
    The model checker SPIN. Transactions on Software Engineering (TSE, 1997
    1116
  84. L P Kaelbling, M L Littman, A W Moore.
    Reinforcement learning: A survey. JAIR, 1996
    1113
  85. Brian W Kernighan, Dennis M Ritchie.
    The C Programming Language. 1988
    1112
  86. M J Swain, D H Ballard.
    Color indexing. International Journal of Computer Vision, 1991
    1107
  87. M Bellare, Rogaway.
    P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, 1993
    1091
  88. S Roweis, L Saul.
    Nonlinear Dimensionality Reduction by Locally Linear. Embedding,” Science, 2000
    1079
  89. E M Clarke, E A Emerson, A P Sistla.
    Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 1986
    1072
  90. T R Gruber.
    Toward principles for the design of ontologies used for knowledge sharing. International Journal of Human-Computer Studies, 1995
    1066
  91. J Shi, C Tomasi.
    Good features to track. In CVPR, 1994
    1062