Most Cited Computer Science Citations

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. J B Tenenbaum, V Silva, J Langford
    A Global Geometric Framework for Nonlinear Dimensionality Reduction,” Science, 2000
    1157
  2. L R Rabiner, B H Juang
    Fundamentals of Speech Recognition 1993
    1148
  3. J Nocedal, S J Wright
    Numerical optimization 1999
    1146
  4. R Axelrod, W Hamilton
    The evolution of cooperation. 0
    1144
  5. Zinaida Trybulec
    Properties of subsets. Formalized Mathematics, 1990
    1143
  6. George Box, Gwilym M Jenkins
    Time Series Analysis: Forecasting and Control 1970
    1143
  7. 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
  8. A Newell
    Unified Theories of Cognition 1990
    1138
  9. B H BLOOM
    Space/time trade-offs in hash coding with allowable errors. Communications of ACM, 1970
    1134
  10. Martin J Osborne, Ariel Rubinstein
    A Course in Game Theory 1994
    1133
  11. M Spellman, P Brown, P, D Botstein
    Cluster analysis and display of genome-wide expression patterns Proc. Nat. Acad. Sci 95, 1998
    1127
  12. D J Watts, S H Strogatz
    Collective dynamics of ’small-world’ networks 0
    1125
  13. G Holzmann
    The model checker SPIN. Transactions on Software Engineering (TSE, 1997
    1116
  14. L P Kaelbling, M L Littman, A W Moore
    Reinforcement learning: A survey. JAIR, 1996
    1113
  15. Brian W Kernighan, Dennis M Ritchie
    The C Programming Language. 1988
    1112
  16. P E Gill, W Murray, M H Wright
    Practical Optimization 1981
    1111
  17. C J C H Watkins
    Learning from delayed rewards Cambridge University, 1992
    1108
  18. Mark Weiser
    Program slicing In Proceedings of the 5th International Conference on Software Engineering, ICSE ’81, 1981
    1107
  19. M J Swain, D H Ballard
    Color indexing. International Journal of Computer Vision, 1991
    1107
  20. P Ciarlet
    The finite element method for elliptic problems, volume 40 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM, 2002
    1104
  21. Paul Grice
    Logic and conversation Syntax and Semantics, 1975
    1101
  22. M Bellare, Rogaway
    P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, 1993
    1091
  23. J L Kolodner
    Case-based Reasoning 1993
    1081
  24. S Roweis, L Saul
    Nonlinear Dimensionality Reduction by Locally Linear. Embedding,” Science, 2000
    1079
  25. M Granovetter
    The strength of weak ties The American Journal of Sociology, 1973
    1073
  26. 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
  27. R K Ahuja, T L Magnanti, J B Orlin
    Network Flows: Theory, Algorithms and Applications. Prentice Hall. personal copy 1800 N. Suri et al. / The Journal of Systems and Software 83 (2010) 1780–1800 Avizienis, 1993
    1070
  28. T R Gruber
    Toward principles for the design of ontologies used for knowledge sharing. International Journal of Human-Computer Studies, 1995
    1066
  29. S Wasserman, K Faust
    Social Network Analysis: Methods and Applications 1994
    1066
  30. Frank P Kelly, Aman K Maulloo, David K H Tan
    Rate control for communication networks: shadow prices, proportional fairness and stability Journal of the Operational Research Society, 1998
    1064
  31. J Shi, C Tomasi
    Good features to track. In CVPR, 1994
    1062
  32. J A Hartigan
    Clustering Algorithms 1975
    1062
  33. S L Lauritzen, D J Spigelhalter
    Local computations with probabilities on graphical structures and their application to expert systems Journal of the Royal Statistical Society, Series B, 1988
    1062
  34. P N Belhumeur, J P Hespanha, D J Kriegman
    Eigenfaces vs. Fisherfaces: Recognition using class-specific linear projection. Trans. Pat. Anal. Mach. Intell, 1997
    1061
  35. R M Karp
    Reducibility among combinatorial problems Complexity of Computer Computations, 1972
    1061
  36. J M Spivey
    The Z notation: a reference manual 1992
    1055
  37. J SHAPIRO
    M.: Embedded image coding using zerotrees of wavelet coefficients In IEEE Transactions of Signal Processing, 1993
    1051
  38. T Joachims
    Making large-Scale SVM Learning Practical Advances in Kernel Methods - Support Vector Learning. MIT-Press, 1999
    1051
  39. Y Benjamini, Y Hochberg
    Controlling the false discovery rate: a practical and powerful approach to multiple testing Journal of the Royal Statist. Soc., Ser. B, 1995
    1046
  40. S Bradner
    Key words for use in RFCs to Indicate Requirement Levels BCP 14, RFC 2119, 1997
    1046
  41. R S Sutton
    Learning to predict by the method of temporal difference. Machine Learning, 1988
    1044
  42. Mark Weiser
    The Computer for the 21st Century Scientific American, 1991
    1044
  43. Michael Burrows, Martín Abadi, Roger Needham
    A logic of authentication. ACM Transactions on Computer Systems, 1990
    1039
  44. W Hoeffding
    Probability inequalities for sums of bounded random variables. Journal of American Statistical Association, 1963
    1037
  45. L Lamport, R Shostak, M Pease
    The Byzantine Generals problem. ACM Trans. Program. Lang. Syst, 1982
    1032
  46. Y Saad, M H Schultz
    GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems SIAM Journal on Scientific Computing, 1986
    1026
  47. D L Parnas
    On the criteria to be used in decomposing systems into modules. Communications of the ACM, 1972
    1024
  48. T F Smith, M S Waterman
    Identification of common molecular subsequences in JMB, 1981
    1017
  49. C H Papadimitriou, K Steiglitz
    Combinatorial Optimization: Algorithms and Complexity 1998
    1016
  50. Tim Lindholm, Frank Yellin
    The Java Virtual Machine Specification In Usenix Technical Conference, 1996
    1016
  51. Mark Crovella, Azer Bestavros
    Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. In Proceedings of SIGMETRICS’96: The ACM International Conference on Measurement and Modelling of Computer Systems, 1996
    1009
  52. L G Valiant
    A bridging model for parallel computation Commun. ACM, 1990
    1007
  53. E A Emerson
    Temporal and modal logics. Handbook of Theoret. Comput. Sci., volume B, 1990
    1004
  54. P Comon
    Independent component analysis, a new concept Signal Process, 1994
    1003
  55. N Chomsky
    Aspects of the Theory of Syntax 1965
    1002
  56. D Chaum
    Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 1981
    1001
  57. G C Necula
    Proof-carrying code. In 24th Symposium on Principles of Programming Languages, POPL’97, 1997
    1000
  58. H Akaike
    A new look at the statistical model identification IEEE Transactions on Automatic Control, 1974
    999
  59. Y Saad
    Iterative Methods for Sparse Linear Systems Second Edition, SIAM, 2003
    996
  60. Rosalind W Picard
    Affective Computing. 1997
    992
  61. L Savage
    The Foundations of Statistics 1954
    983
  62. T Cootes, K Walker, C Taylor
    View-based active appearance models. in IEEE Conf. on Automatic Face and Gesture Recognition, 2000
    982
  63. S Goldwasser, Micali
    S.: Probabilistic encryption J. Comput. Syst. Sci, 1984
    981
  64. J Padhye, V Firoiu, D Towsley, J Kurose
    Modeling TCP Throughput: A Simple Model and its Empirical Validation. In Proc. ACM SIGCOMM, 1998
    980
  65. G Lakoff, M Johnson
    Metaphors we live by. University of Chicago Press. Chicago: the child. London: Routledge & Kegan, 1980
    979
  66. M Faloutsos, P Faloutsos, C Faloutsos
    On Power-Law Relationships of the Internet Topology. Computer Comm. Rev, 1999
    979
  67. Czes̷law Byliński
    Functions from a set to a set. Formalized Mathematics, 1990
    975
  68. A Pnueli
    The temporal logic of programs Proc. 18th IEEE Symposium on Foundations of Computer Science, 1977
    973
  69. M Wooldridge, N R Jennings
    Intelligent Agents: Theory and Practice. Knowledge Engineering Review, 1995
    972
  70. Scott Shaobing Chen, David L Donoho, Michael A Saunders
    Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 1999
    971
  71. H Hoppe
    Progressive meshes. In Proc. of the 23rd Annual Conf. on Computer Graphics and Interactive Techniques, 1996
    971
  72. L Davis
    Ed.”Handbook of Genetic Algorithms. International Journal of Computer Science and Security, Volume (1): Issue, 1991
    969
  73. A Hyvärinen, J Karhunen, E Oja
    Independent Component Analysis. 2001
    968
  74. M C Golumbic
    Algorithmic Graph Theory and Perfect Graphs. Second edition Annals of Discrete Mathematics 57, Elsevier, 2004
    967
  75. A Demers, S Keshav, S Shenker
    Analysis and simulation of a fair queueing algorithm. SIGCOMM ’89: Symposium proceedings on Communications architectures & protocols, 1989
    966
  76. Edmund Woronowicz
    Relations and their basic properties. Formalized Mathematics, 1990
    964
  77. E W Dijkstra
    A note on two problems in connexion with graphs. Numerische Mathematik, 2004
    963
  78. A M Law
    Simulation Modeling and Analysis 4th Edition, McGraw-Hill, 2007
    963