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. 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
  2. J L Elman.
    Finding structure in time. Cognitive Science, 1990
    1290
  3. Andrzej Trybulec.
    Tarski Grothendieck set theory. Formalized Mathematics, 1990
    1274
  4. 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
  5. Czes̷law Byliński.
    Functions and their basic properties. Formalized Mathematics, 1990
    1222
  6. Zinaida Trybulec.
    Properties of subsets. Formalized Mathematics, 1990
    1143
  7. Michael Burrows, Martín Abadi, Roger Needham.
    A logic of authentication. ACM Transactions on Computer Systems, 1990
    1039
  8. E A Emerson.
    Temporal and modal logics. Handbook of Theoret. Comput. Sci., volume B, 1990
    1004
  9. Czes̷law Byliński.
    Functions from a set to a set. Formalized Mathematics, 1990
    975
  10. Edmund Woronowicz.
    Relations and their basic properties. Formalized Mathematics, 1990
    964
  11. S E Deering, D R Cheriton.
    Multicast Routing in Datagram Internetworks and extended LANs. ACM Transactions on Computer Systems, 1990
    914
  12. T Hastie, R Tibshirani.
    Generalized additive models. 1990
    913
  13. P PERONA, J MALIK.
    Scale-space and edge detection using anisotropic diffusion. IEEE Trans. Pattern Anal. Mach. Intell, 1990
    891
  14. Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger.
    The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec, 1990
    846
  15. J R Quinlan.
    Learning logical definitions from relations. Machine Learning, 1990
    781
  16. M Herlihy, J Wing.
    Linearizability: A correctness condition for concurrent objects. A CM Trunsactions on Programming Languages and Systems, 1990
    743
  17. N Dershowitz, J P Jouannaud.
    Rewrite systems. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B, 1990
    711
  18. Czeslaw Byli'nski.
    Some basic properties of sets. Formalized Mathematics, 1990
    700
  19. S Harnad.
    The symbol grounding problem. Physica D, 1990
    657
  20. K Gharachorloo, D Lenoski, J Laudon, P Gibbons, A Gupta, J Hennessy.
    Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. In ISCA, 1990
    628
  21. Grzegorz Bancerek.
    The fundamental properties of natural numbers. Formalized Mathematics, 1990
    619
  22. Domenico Ferrari, Dinesh C Verma.
    A Scheme For Real-Time Channel Establishment In Wide-Area Networks. IEEE Journal On Selected Areas In Communications, 1990
    605
  23. Grzegorz Bancerek.
    The ordinal numbers. Formalized Mathematics, 1990
    605
  24. R Schapire.
    The strength of weak learnability. Machine Learning, 1990
    534
  25. G Salton, C Buckley.
    Improving retrieval performance by relevance feedback. In Journal of the American Society for Information Science (JASIS, 1990
    525
  26. Krzysztof Hryniewiecki.
    Basic properties of real numbers. Formalized Mathematics, 1990
    523
  27. P F Brown, J Cocke, S A D Pietra, V J D Pietra, F Jelinek, J D Lafferty, R L Mercer, Roossin.
    P.S.: A statistical approach to machine translation. Computational Linguistics, 1990
    485
  28. G W Stewart, J G Sun.
    Matrix Perturbation Theory. 1990
    452
  29. F Glover.
    Tabu Search. Part II, ORSA Journal on Computing, 1990
    448
  30. Edmund Woronowicz.
    Relations defined on sets. Formalized Mathematics, 1990
    429
  31. Karl S Brace, Richard L Rudell, Randal E Bryant.
    Efficient implementation of a bdd package. In DAC, 1990
    424
  32. M Satyanarayanan, J Kistler, P Kumar, M Okasaki, E Siegel, D Steere.
    Coda: A Highly Available File System for a Distributed Workstation Environment. IEEE Transactions on Computer, 1990
    423
  33. Gérard Berry, Gérard Boudol.
    The chemical abstract machine. In Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages—POPL’90, 1990
    417
  34. L Westover.
    Footprint evaluation for volume rendering. In Proceedings of ACM SIGGRAPH 90, 1990
    398
  35. V A Saraswat, M Rinard.
    Concurrent constraint programming. In Seventeenth Ann. ACM Symp. on Princ. of Program. Lang, 1990
    396
  36. G Bracha, W Cook.
    Mixin-based inheritance. Proc. Conf. O-O. Prog.: Syst., Lang., and Appl. / Proc. ECOOP, 1990
    382
  37. D Harel, H Lachover, A Naamad, A Pnueli, M Politi, R Sherman, A Shtull-Trauring, M Trakhtenbrot.
    Statemate: a working environment for the development of complex reactive systems. IEEE Trans. on Software Eng, 1990
    379
  38. Yann Le Cun, John S Denker, Sara A Solla.
    Optimal brain damage. In Advances in Neural Information Processing Systems, 1990
    373
  39. Robert Alverson, David Callahan, Daniel Cummings, Brian Koblenz, Allan Porterfield, Burton Smith.
    The Tera computer system. In Proceedings of the 4th International Conference on Supercomputing, ICS ’90, 1990
    352
  40. Yoav Freund.
    Boosting a weak learning algorithm by majority. In COLT: Proceedings of the Workshop on Computational Learning Theory, 1990
    347
  41. Czes̷law Byliński.
    Binary operations. Formalized Mathematics, 1990
    323
  42. Agata Darmochwał.
    Finite sets. Formalized Mathematics, 1990
    300
  43. J B Pollack.
    Recursive distributed representations. Artificial Intelligence, 1990
    299
  44. Beata Padlewska.
    Families of sets. Formalized Mathematics, 1990
    297
  45. M Levoy.
    Efficient ray tracing of volume data. ACM Transactions on Graphics, 1990
    293
  46. J ‘‘Why Ousterhout.
    Aren’t Operating Systems Getting Faster As Fast as Hardware. Proceedings of the 1990 Summer Usenix, 1990
    293
  47. R A Brooks.
    Elephants don’t play chess. Robotics and Autonomous Systems, 1990
    292
  48. K K Ramakrishnan, R Jain.
    A binary feedback scheme for congestion avoidance in computer networks. ACM Trans. Comp. Systems, 1990
    291
  49. N DYN, D LEVINE, J GRAPHORY.
    A.: A butterfly subdivision scheme for surface interpolation with tension control. ACM Trans. Graph. 9, 1990
    291
  50. Andrzej Trybulec.
    Domains and their Cartesian products. Formalized Mathematics, 1990
    282
  51. Czes̷law Byliński.
    Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1990
    279
  52. G Fox, S Hiranandani, K Kennedy, C Koelbel, U Kremer, C-W Tseng, M-Y Wu.
    Fortran D language specification. 1990
    278
  53. H Agrawal, J R Horgan.
    Dynamic program slicing. In Proceedings of the ACM SIGPLAN ’90 Conference on Programming Language Design and Implementation (PLDI ’90, 1990
    277
  54. B Falkenhainer, K D Forbus, D Gentner.
    The Structure-Mapping Engine: Algorithm and Examples. Artificial Intelligence, 1990
    277
  55. W Dally.
    Performance Analysis of k-ary n-cube Interconnection Networks. in Proceedings of the ACM/IEEE conference on Supercomputing (SC'03, 1990
    272
  56. Andrzej Trybulec.
    Tuples, projections and Cartesian products. Formalized Mathematics, 1990
    268
  57. William Pugh.
    Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 1990
    267
  58. J Hughes.
    Why functional programming matters. In Research Topics in Functional Programming, Univ. of Texas at Austin Year of Programming Series, chapter 2, 1990
    264
  59. J K Bennett, J B Carter, W Zwaenepoel.
    Munin: Distributed shared memory based on type-specific memory coherence. in PPOPP ’90: Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1990
    260
  60. Wojciech A Trybulec.
    Pigeon hole principle. Journal of Formalized Mathematics, 1990
    258
  61. C Lund, L Fortnow, H Karloff, N Nisan.
    Algebraic methods for interactive proof systems. In Proc. 31st IEEE Symp. Foundations of Computer Science, 1990
    258
  62. Jitendra Malik, Pietro Perona.
    Preattentive texture discrimination with early vision mechanisms. Journal of the Optical Society of America A, 1990
    254
  63. A Agarwal, B H Lim, D Kranz, J Kubiatowicz.
    APRIL: a processor architecture for multiprocessing. In 17th Annual International Symposium on Computer Architecture, 1990
    253
  64. Andrzej Trybulec.
    Binary operations applied to functions. Formalized Mathematics, 1990
    245
  65. B N Bershad, T E Anderson, E D Lazowska, H M Levy.
    Lightweight remote procedure call. ACM Trans. Comput. Syst, 1990
    239
  66. J Y Halpern.
    An analysis of first-order logics of probability. Artificial Intelligence, 1990
    238
  67. Herbert Edelsbrunner, Ernst Peter.
    M"ucke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 1990
    234
  68. Wojciech A Trybulec.
    Vectors in real linear space. Formalized Mathematics, 1990
    233
  69. Grzegorz Bancerek.
    The reflection theorem. Formalized Mathematics, 1990
    225
  70. D R Smith.
    Kids: A semi-automatic program development system. IEEE Trans. on Soft. Eng., Spec. Issue on Formal Methods, 1990
    224
  71. J Kramer, J Magee.
    The evolving philosophers problem: Dynamic change management. IEEE TSE, 1990
    220
  72. P Shirley, A Tuchman.
    A polygonal approximation to direct scalar volume rendering. Proceedings of San Diego Workshop on Volume Visualization, 1990
    217
  73. P Hudak, P Wadler.
    Report on the programming language Haskell, A non-strict purely functional language (Version 1.0. Dep. of Computer Sc., Yale University, 1990
    214
  74. D Ferrari.
    Client Requirements for Real-Time Communication Services. IEEE Comm. Magazine, 1990
    214
  75. H Turtle, W B Croft.
    Inference Networks for Document Retrieval. Proceedings of the 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1990
    212
  76. M E Pollack.
    Plans as complex mental attitudes. Intentions in communication, 1990
    210
  77. S V ADVE, M D HILL.
    Weak ordering — a new definition. In Proc. ISCA, 1990
    210
  78. S Ceri, J Widom.
    Deriving Production Rules for Constraint Maintenance. Proc. 16th Int’l Conf. Very Large Databases, 1990
    207
  79. M Naor, M Yung.
    Public-key cryptosystems provably secure against chosen ciphertext attacks. In Symposium on Theory of Computing – STOC 1990, ACM, 1990
    205
  80. J Mylopoulos, A Borgida, M Jarke, M Koubarakis.
    Telos: Representing Knowledge about Information Systems. ACM Transactions on Information Systems, 1990
    203
  81. Timothy Griffin.
    The formulae-as-types notion of control. In 17th Annual ACM Symp. on Principles of Programming Languages, 1990
    201
  82. A S Tanenbaum, R van Renesse, H van Staveren, G J Sharp, S J Mullender.
    Experiences with the Amoeba distributed operating system. Commun. ACM, 1990
    199
  83. D DeWitt, S Ghandeharizadeh, D Schneider, A Bricker, H Hsiao, R Rasmussen.
    The Gamma database machine project. IEEE Transactions on Knowledge and Data Engineering, 1990
    197
  84. M Seltzer, P Chen, J Osterhout.
    Disk scheduling revisited. In Proceedings of the Winter 1990 USENIX Technical Conference, 1990
    197
  85. D Johnson, W Zwaenepoel.
    Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing. Journal of Algorithms, 1990
    196
  86. D Callahan, S Carr, K Kennedy.
    Improving Register Allocation for subscripted Variables. In Proceedings of the ACM SIGPLAN ’90 Conference on Programming Language Design and Implementation, 1990
    193
  87. H TOKUDA, T NAKAJIMA, P RAO.
    RealTime Mach: Towards a predictable real-time system. In Proc. USENIX Mach Workshop, 1990
    193
  88. D Hindle.
    Noun classification from predicateargument structures. In Proceedings of ACL-90, 1990
    191
  89. �ALON90� R Alonso, D Barbara, H Garcia-Molina.
    Data caching issues in an informational retrieval system. ACM Trans. on Database Sys, 1990
    191