Most Cited Computer Science Citations

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. Zinaida Trybulec
    Properties of subsets. Formalized Mathematics, 1990
    1168
  2. L Rabiner, B H Juang
    Fundamentals of speech recognition PrenticeHall, Inc., Upper Saddle River, 1993
    1162
  3. R Axelrod
    The Evolution of Cooperation. 1984
    1160
  4. B H Bloom
    Space/Time Trade-offs in Hash coding with Allowable Errors. Comm. of the ACM, 1970
    1157
  5. D J Watts, S H Strogatz
    Collective dynamics of ’small-world’ networks Nature, 1998
    1155
  6. G E P Box, G M Jenkins
    Time Series Analysis: Forecasting and Control 1994
    1153
  7. M J Osborne, A Rubinstein
    A course in game theory 1994
    1151
  8. A Newell
    Unified Theories of Cognition 1990
    1147
  9. 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
  10. P Grice
    Logic and conversation Eds.), Syntax and Semantics, 3: Speech Acts, 1975
    1144
  11. M B Eisen, P T Spellman, P O Brown, D Botstein
    Cluster analysis and display of genome-wide expression patterns Proc. Natl Acad. Sci. USA, 1998
    1138
  12. Theodore S Rappaport
    Wireless Communications: Principles and Practice Prentice-Hall, Inc., Upper Saddle River, 2001
    1129
  13. S A Kent, R Atkinson
    Security architecture for the Internet protocol. RFC 2401, Internet Engineering Task Force, 1998
    1128
  14. L Kaelbling, M Littman, A Moore
    Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 1996
    1127
  15. Gerard J Holzmann
    The Model Checker SPIN. Special issue on Formal Methods in Software Practice, 1997
    1126
  16. C J C H Watkins
    Learning from Delayed Rewards 1989
    1125
  17. M Weiser
    Program slicing IEEE Transactions on Software Engineering, 1984
    1124
  18. M J Swain, D H Ballard
    Color indexing. International Journal of Computer Vision, 1991
    1122
  19. Phil E Gill, Walter Murray, Margaret H Wright
    Practical Optimization 1981
    1121
  20. Brian W Kernighan, Dennis M Ritchie
    The C Programming Language. 1988
    1120
  21. P Ciarlet
    The Finite Element Method for Elliptic Problems of Studies in Mathematics and its Applications, 1978
    1116
  22. S Wasserman, K Faust
    Social Network Analysis: Methods and Applications 1994
    1115
  23. M Granovetter
    The strength of weak ties In, 1982
    1113
  24. M Bellare, P Rogaway
    Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st CCS, 1993
    1108
  25. M Fowler, K Beck, J Brant, W Opdyke, D Roberts
    Refactoring: Improving the Design of Existing Code 1999
    1095
  26. J L Kolodner
    Case-Based Reasoning 1993
    1094
  27. J Shi, Tomasi C Good
    features to track. Proc. IEEE CCVPR, 1994
    1093
  28. F P Kelly, A K Maulloo, D K H Tan
    Rate control for communication networks: Shadow prices, proportional fairness and stability et al.: DISTRIBUTED FRAMEWORK FOR CORRELATED DATA GATHERING IN SENSOR NETWORKS 593, 1998
    1085
  29. Magnanti Ahuja, Orlin
    Network Flows: Theory, Algorithms, and Applications 1993
    1082
  30. J A Hartigan
    clustering algorithms 1975
    1080
  31. 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
  32. R M Karp
    Reducibility among combinatorial problems IEEE Transactions on Software Engineering, 1972
    1079
  33. T R Gruber
    Towards Principles for The Design of Ontologies Used for Knowledge Sharing. In N. Guarino and R. Poll (Eds.), Formal Ontology in Conceptual Analysis and Knowledge Representation, Kluwer, 1995
    1079
  34. P Belhumeur, J Hespanda, D Kriegman
    Eigenfaces vs. fisherfaces: recognition using class specific linear projectoin. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI, 1997
    1074
  35. S Bradner
    Key words for use in rfcs to indicate requirement levels Best Common Practice (BCP) 14, RFC 2119, 1997
    1074
  36. T Joachims
    Making large-scale svm learning practical Advances in Kernel Methods - Support Vector Learning, 1999
    1067
  37. M Weiser
    The computer for the 21st century Scientific American, 1991
    1066
  38. J M Spivey
    The Z Notation: A Reference Manual 1989
    1055
  39. J M Shapiro
    Embedded image coding using zerotrees of wavelets coefficients IEEE Trans. Signal Procesing, 1993
    1054
  40. W Hoeffding
    Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 1963
    1050
  41. L Lamport, R Shostak, M Pease
    The Byzantine General’s Problem. ACM Trans. Prog. Languages and System, 1982
    1049
  42. D L Parnas
    On the criteria to be used in decomposing systems into modules. Communications of the ACM, 1972
    1042
  43. M Burrows, M Abadi, R Needham
    A Logic for Authentication. ACM transactions on Computer Systems, 1990
    1041
  44. Y Saad, M H Schultz
    A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear System SIAM J. Sci. Stat. Comput, 1985
    1037
  45. T Smith, M Waterman
    Identification of common molecular subsequences Journal of Molecular Biology, 1981
    1034
  46. H Akaike
    A new look at the statistical model identification IEEE Transactions on Automatic Control, 1974
    1030
  47. C Pollard, I A Sag
    Head-Driven Phrase Structure Grammar 1994
    1029
  48. C H Papadimitriou, K Steiglitz
    Combinatorial Optimization, Algorithms and Complexity 1998
    1029
  49. Tim Lindholm, Frank Yellin
    The Java Virtual Machine Specification In Usenix Technical Conference, 1996
    1020
  50. M E Crovella, A Bestavros
    Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. IEEE/ACM Transactions on Networking, 1997
    1016
  51. N Chomsky
    Aspects of the theory of syntax 1965
    1015
  52. L G Valiant
    A Bridging Model for Parallel Computation Comm. ACM, 1990
    1014
  53. T F Cootes, G J Edwards, C J Taylor
    Active appearance models. In European Conference Computer Vision, 1998
    1013
  54. George C Necula
    Proof-carrying code. In Proceedings of the 24th ACM SIGPLANSIGACT Symposium on Principles of Programming Langauges (POPL ’97, 1997
    1013
  55. E A Emerson
    Temporal and Modal Logic. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (B, 1990
    1009
  56. David Chaum
    Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 1981
    1008
  57. Scott Shaobing Chen, David L Donoho, Michael A Saunders
    Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 1998
    1007
  58. R W Picard
    Affective computing. 1997
    1003
  59. G Lakoff, M Johnson
    Metaphors We Live By. 1981
    1001
  60. D Lowe
    Object recognition from local scale-invariant features. In Proceedings of ICCV, 1999
    998
  61. Czes̷law Byliński
    Functions from a set to a set. Formalized Mathematics, 1990
    995
  62. L J Savage
    The Foundations of Statistics 1972
    994
  63. S Goldwasser, S Micali
    Probabilistic encryption Special Issue of Journal of Computer and Systems Sciences, 1984
    992
  64. E W Dijkstra
    A note on two problems in connexion with graphs. Numerische Mathematik, 1959
    987
  65. M Wooldridge, Jennings
    N.R.: Intelligent Agents: Theory and Practice. The Knowledge Engineering Review, 1995
    986
  66. G A Miller
    WordNet: a lexical database for English. Commun. ACM, 1995
    986
  67. M Faloutsos, P Faloutsos, C Faloutsos
    On power-law relationships of the Internet topology. In ACM SIGCOMM, 1999
    986
  68. A Hyvärinen, J Karhunen, E Oja
    Independent Component Analysis. 0
    985
  69. A Pnueli
    The temporal logic of programs In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, 1977
    983
  70. Hugues Hoppe
    Progressive meshes. SIGGRAPH 96 Conference Proceedings, Annual Conference Series, 1996
    977
  71. Edmund Woronowicz
    Relations and their basic properties. Formalized Mathematics, 1990
    976
  72. J L Austin
    How to do things with words 1962
    976
  73. A Demers, S Keshav, S Shenker
    Analysis and simulation of a fair queueing algorithm. In Proceedings of ACM SIGCOMM ’89, 1989
    973