Most Cited Computer Science Articles

This list is generated from documents in the CiteSeerx database as of January 17, 2013. 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 | 2013
  1. A P Dempster, N M Laird, D B Rubin.
    Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 1977
    6082
  2. C A R Hoare.
    Communicating sequential processes. ISSN 0001-0782. URL http://doi.acm.org/10.1145/359576, 1978
    3098
  3. L Rabiner.
    A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE, 77:257–286, 1989. 176, 0
    3057
  4. I Stoica, R Morris, D Karger, M Kaashoek, H Balakrishnan.
    Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM 2001, 2001
    3011
  5. D G Lowe.
    Distinctive Image Features from ScaleInvariants Keypoints. 0
    2992
  6. J R Quinlan.
    Induction of Decision Trees. Machine Learning 1:81–106, 1986
    2858
  7. R S Sutton, Barto.
    A.G.: Reinforcement Learning: An introduction. 1998
    2766
  8. S Kirkpatrick, C D Gelatt, M P Vecchi.
    Optimization by simulation annealing. in Science, 1983
    2754
  9. R Bryant.
    Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, 1986
    2588
  10. C L Liu, J W Layland.
    Scheduling Algorithms for Multiprogramming in a HardReal-Time Environment. J. of the ACM, 1973
    2553
  11. S Brin, L Page.
    The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 1998
    2514
  12. R L Rivest, A Shamir, L M Adleman.
    A method for obtaining digital signatures and public-key cryptosystems. Special Topics and Techniques, 0
    2462
  13. M Kass, A Witkin, D Terzopoulos.
    Snakes — active contour models. International Journal of Computer Vision, 1987
    2417
  14. S Ratnasamy, P Francis, M Handley, R Karp.
    A scalable content-addressable network. In Proceedings of SIGCOMM 2001, 2001
    2337
  15. W Diffie, M E Hellman.
    New directions in cryptography. IEEE Trans. Info. IT-22, 1976
    2256
  16. M Turk, A Pentland.
    Eigenfaces for recognition. Journal of cognitive neuroscience, 1991
    2204
  17. J M Kleinberg.
    Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM, 1999
    2179
  18. S Deerwester.
    Indexing by latent semantic analysis. In Journal of the AmericanSociety for Information Science, 1990
    2130
  19. R Agrawal, R Srikant.
    Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases (VLDB'94, 1994
    2114
  20. Alfred J Menezes, Paul C van Oorschot, S A V.
    Handbook of Applied Cryptography. 1996
    2017
  21. E M Clarke, O Grumberg, D A Peled.
    Model checking. 1999
    2001
  22. Leo Breiman.
    Bagging predictors. Mach. Learn, 1996
    1959
  23. D Harel.
    Statecharts: A visual formalism for complex systems. Science of Computer Programming, 1987
    1954
  24. A Guttman.
    R-trees: A dynamic index structure for spatial searching. in: Proceedings of the 1984 ACM-SIGMOD Conference, 1984
    1954
  25. C Chang, C Lin.
    LIBSVM: a Library for Support Vector Machines. 2001
    1925
  26. S Floyd, V Jacobson.
    Random early detection gateways for congestion avoidance. In Proceedings of SIGCOMM, 1993
    1922
  27. R Baeza-Yates, B Ribeiro-Neto.
    Modern Information Retrieval. 1999
    1905
  28. R Agrawal, T Imielinski, A Swami.
    Mining association rules between sets of items in large database. In Proceedings of the International Conference on Management of Data (ACM SIGMOD 93, 1993
    1903
  29. C H Papadimitriou.
    Computational Complexity. 1993
    1887
  30. T R Gruber.
    A translation approach to portable ontologies. Knowledge Acquisition, 0
    1851
  31. S Mallat.
    A theory for multiresolution signal decomposition: the wavelet representation. IEEE Trans. Pattern Anal. Machine Intell, 1989
    1844
  32. D B Johnson, D A Maltz.
    Dynamic source routing in ad hoc wireless networks. in Mobile Computing, 1996
    1806
  33. J Shi, J Malik.
    Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
    1781
  34. W E Lorensen, H E Cline.
    Marching cubes: A high resolution 3D surface construction algorithm. Computer Graphics, 1987
    1727
  35. I Foster, C Kesselman.
    The Anatomy of the Grid - Enabling Scalable Virtual Organizations. Int. J. Supercomput. Appl, 0
    1685
  36. S F Altschul, T L Madden, A A Schaffer, J Zhang, Z Zhang, W Miller, D J Lipman.
    Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Research. 1997
    1684
  37. C E Perkins, E M Royer.
    Ad-hoc on-demand distance vector routing. in MILCOM ’97 panel on Ad Hoc Networks, 1997
    1680
  38. Y Freund, R E Schapire.
    A decision-theoretic generalization of on-line learning and an application to boosting. In Eur. Conf. on Comput. Learning Theory, 1995
    1672
  39. H Schulzrinne, S Casner, R Frederick, V Jacobson.
    RTP: A Transport Protocol for Real-Time Applications. STD 64, RFC 3550, July 2003. Watson, et al. Standards Track [Page 40] 6363 FEC Framework, 2011
    1663
  40. R Alur, D L Dill.
    A theory of timed automata. Theoretical Computer Science, 1994
    1640
  41. C J C Burges.
    A tutorial on support vector machines for pattern recognition. Knowledge Discovery and Data Mining, 1998
    1614
  42. M P Marcus, B Santorini, M A Marcinkiewicz.
    Building a large annotated corpus of English: The Penn treebank. Computational Linguistics, 1993
    1613
  43. W Leland, M Taqqu, W Willinger, D Wilson.
    On the self-similar nature of Ethernet traffic (extended version. IEEE/ACM Transactions on Netwrking, 1994
    1568
  44. L Page, S Brin, R Motwani, T Winograd.
    The pagerank citation ranking: Bringing order to the web. 1998
    1554
  45. P Gupta, P Kumar.
    Capacity of wireless networks. 1999
    1554
  46. A Parekh, R Gallager.
    A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Trans. Networking, 1993
    1501
  47. A Rowstron, P Druschel.
    Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proc. of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware, 2001
    1498
  48. J Lafferty, A McCallum, Pereira.
    F.: Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In: Proc. of ICML (2001), http://www.cs.cmu.edu/afs/cs.cmu.edu/user/mccallum/ www/papers/crf-icml01.ps.gz, 0
    1497
  49. B Schölkopf, A J Smola.
    Learning with Kernels. 2002
    1482
  50. D Burger, T M Austin.
    The SimpleScalar Tool Set, Version 2.0. 1997
    1459
  51. B D Lucas, T Kanade.
    An iterative image registration technique with an application to stereo vision. 1981
    1458
  52. D Kahneman, A Tversky.
    Prospect theory: An analysis of decision under risk. Econometrica, 1979
    1446
  53. C Intanagonwiwat, R Govindan, D Estrin.
    Directed diffusion: A scalable and robust communication paradigm for sensor networks. 0
    1444
  54. C Cortes, V Vapnik.
    Support Vector Networks. Mach. Learn, 1995
    1443
  55. I Foster, C Kesselman.
    Globus: A Metacomputing Infrastructure Toolkit. International Journal of Supercomputer Applications, 1997
    1417
  56. B Stroustrup.
    The C++ Programming Language. 1997
    1383
  57. A Shamir.
    How to share a secret. Communications of the ACM, 1979
    1359
  58. B K P Horn, B G Schunk.
    Determining optical flow. Artificial intel~~ence, 1981
    1359
  59. T Joachims.
    Text categorization with support vector machines: learning with many relevant features. In Proceedings of ECML-98,10th European Conference on Machine Learning, 1998
    1357
  60. Tim Berners-Lee, James Hendler, Ora Lassila.
    The semantic web. Scientific American, 0
    1355
  61. G Kiczales, J Lamping, A Mendhekar, C Maeda, C Lopes, J M Loingtier, J Irwin.
    Aspect-oriented programming. ECOOP’97Object-Oriented Programming, 1997
    1354
  62. J McCarthy, P J Hayes.
    Some philosophical problems from the standpoints of artificial intelligence. Machine Intelligence, 1969
    1350
  63. M Li, P Vitanyi.
    An Introduction to Kolmogorov Complexity and Its Applications. 1997
    1341
  64. P Viola, M Jones.
    Rapid object detection using a boosted cascade of simple features. Computer Vision and Pattern Recognition, 0
    1335
  65. B Meyer.
    Object-oriented Software Construction. 1988
    1335
  66. Y Freund, R E Schapire.
    Experiments with a new boosting algorithm. In Proc. of the 13th Int. Conf. on Machine Learning (ICML’1996, 1996
    1308
  67. J L Elman.
    Finding Structure in Time. 1988
    1300
  68. Michael J Fischer, Nancy A Lynch, Michael S Paterson.
    Impossibility of distributed consensus with one faulty process. J. ACM, 1985
    1286
  69. G A Miller, R Beckwith, C Fellbaum, D Gross, K Miller.
    Introduction to WordNet: An On-Line Lexical Database. 1993
    1277
  70. D Blei, A Ng, M Jordan.
    Latent Dirichlet allocation. Journal of Machine Learning Research, 0
    1277
  71. Andrzej Trybulec.
    Tarski Grothendieck set theory. Formalized Mathematics, 1990
    1275
  72. Michael Gelfond, Vladimir Lifschitz.
    The stable model semantics for logic programming. Proceedings of International Logic Programming Conference and Symposium, 1988
    1250
  73. V Paxson, S Floyd.
    Wide area traffic: The failure of poisson modeling. IEEE/ACM Transactions on Networking, 1995
    1249
  74. Czes̷law Byliński.
    Functions and their basic properties. Formalized Mathematics, 1990
    1242
  75. P Erdős, A Rényi.
    On the Evolution of Random Graphs. in Publications of the Math. Institute of the Hungarian Academy of Sciences, 1960
    1241
  76. 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
    1229
  77. J Hill, R Szewczyk, A Woo, S Hollar, D Culler, K Pister.
    System architecture directions for network sensors. In Proceedings of 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX, 2000
    1225
  78. C Harris, M Stephens.
    A combined corner and edge detector. In Alvey Vision Conference, 1988
    1220
  79. Philip Wadler.
    Monads for functional programming. Advanced Functional Programming, volume 925 of Lecture Notes in Computer Science, 1995
    1219
  80. B Karp, H Kung.
    Greedy perimeter stateless routing for wireless networks. in Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom, 2000
    1213
  81. C A R Hoare.
    An axiomatic basis for computer programming. Commun. ACM, 1969
    1205
  82. C E Perkins, P Bhagwat.
    Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. in ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, 1994
    1203
  83. G Salton, C Buckley.
    Term-weighting approaches in automatic text retrieval. Information Processing & Management, 1988
    1200
  84. Antony Rowstron, Peter Druschel.
    Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 0
    1190
  85. R A Brooks.
    Intelligence without Representation. Artificial Intelligence, 1991
    1190
  86. G Plotkin.
    A structural approach to operational semantics. 1981
    1180
  87. John K Ousterhout.
    Tcl and the Tk Toolkit. 1994
    1176
  88. Zinaida Trybulec.
    Properties of subsets. Formalized Mathematics, 1990
    1168
  89. R Axelrod.
    The Evolution of Cooperation. 1984
    1160
  90. B H Bloom.
    Space/Time Trade-offs in Hash coding with Allowable Errors. Comm. of the ACM, 1970
    1157
  91. J Broch, D A Maltz, D B Johnson, Y-C Hu, J Jetcheva.
    A performance comparison of multi-hop wireless ad hoc network routing protocols. in Mobile Computing and Networking, 1998
    1145
  92. S A Kent, R Atkinson.
    Security architecture for the Internet protocol. RFC 2401, Internet Engineering Task Force, 1998
    1128
  93. L Kaelbling, M Littman, A Moore.
    Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 1996
    1127
  94. Gerard J Holzmann.
    The Model Checker SPIN. Special issue on Formal Methods in Software Practice, 1997
    1126
  95. S T Roweis, L K Saul.
    Nonlinear dimensionality reduction by locally linear embedding,” Science 290. 2000
    1124
  96. M J Swain, D H Ballard.
    Color indexing. International Journal of Computer Vision, 1991
    1122
  97. Brian W Kernighan, Dennis M Ritchie.
    The C Programming Language. 1988
    1120
  98. M Bellare, P Rogaway.
    Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st CCS, 1993
    1108
  99. J Shi, Tomasi C Good.
    features to track. Proc. IEEE CCVPR, 1994
    1093
  100. E M Clarke, E A Emerson, A P Sistla.
    Automatic verification of finite-state concurrent systems using temporal logic. Hen88] Matthew Hennessy. Algebraic Theory of Processes. MIT Press Series in the Foundations of Computing, 1986
    1079