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. S Deerwester.
    Indexing by latent semantic analysis. In Journal of the AmericanSociety for Information Science, 1990
    2130
  2. Andrzej Trybulec.
    Tarski Grothendieck set theory. Formalized Mathematics, 1990
    1275
  3. Czes̷law Byliński.
    Functions and their basic properties. Formalized Mathematics, 1990
    1242
  4. Zinaida Trybulec.
    Properties of subsets. Formalized Mathematics, 1990
    1168
  5. M Burrows, M Abadi, R Needham.
    A Logic for Authentication. ACM transactions on Computer Systems, 1990
    1041
  6. E A Emerson.
    Temporal and Modal Logic. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (B, 1990
    1009
  7. Czes̷law Byliński.
    Functions from a set to a set. Formalized Mathematics, 1990
    995
  8. Edmund Woronowicz.
    Relations and their basic properties. Formalized Mathematics, 1990
    976
  9. A P Sheth, J A Larson.
    Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases. AQUARELLE - IE-2005 D4.6: Querying heterogeneous data, 1990
    956
  10. T Hastie, R Tibshirani.
    Generalized Additive Models. 1990
    927
  11. P Perona, J Malik.
    Scale-space and edge detection using anisotropic diffusion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1990
    905
  12. N Beckmann, H-P Kriegel, R Schneider, B Seeger.
    The R∗-tree: An efficient and robust access method for points and rectangles. In SIGMOD, 1990
    846
  13. J R Quinlan.
    Learning logical definitions from relations. Machine Learning, 1990
    786
  14. M P HERLIHY, J M WING.
    Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst, 1990
    757
  15. N P Jouppi.
    Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers. in ISCA ’90: Proceedings of the 17th Annual International Symposium on Computer Architecture, 1990
    742
  16. N Dershowitz, J-P Jouannaud.
    Rewrite systems. In Handbook of Theoretical Computer Science, vol. B: Formal Models and Sematics, 1990
    720
  17. Czes̷law Byliński.
    Some basic properties of sets. Formalized Mathematics, 1990
    713
  18. Fred B Schneider.
    Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 1990
    706
  19. V Sunderam.
    PVM: A framework for parallel distributed computing. Concurrency – Pract. Exp, 1990
    691
  20. S Harnad.
    The Symbol Grounding Problem. in Proceedings of CHI'95 Conference on Computer Human Interaction, 1990
    662
  21. Grzegorz Bancerek.
    The fundamental properties of natural numbers. Formalized Mathematics, 1990
    634
  22. Kourosh Gharachorloo, Daniel Lenoski, James Laudon, Phillip Gibbons, Anoop Gupta, John Hennessy.
    Memory consistency and event ordering in scalable shared-memory multiprocessors. McGill University, School of Computer, 1990
    626
  23. Grzegorz Bancerek.
    The ordinal numbers. Formalized Mathematics, 1990
    620
  24. K Church.
    Word association norms, mutual information, and lexicography. Computational Linguistics, 1990
    610
  25. D Ferrari, D Verma.
    A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications, 1990
    607
  26. S E Fahlman, C Lebiere.
    The Cascade-Correlation Learning Architecture. Advances in Neural Information Processing Systems II, 1990
    589
  27. R E Schapire.
    The strength of weak learnability. In Machine Learning, 1990
    548
  28. S M Shieber, Schabes.
    Y.: Synchronous tree-adjoining grammars. In: Proc. of COLING, 1990
    544
  29. Krzysztof Hryniewiecki.
    Basic properties of real numbers. Formalized Mathematics, 1990
    538
  30. G Salton, C Buckley.
    Improving retrieval performance by relevance feedback. Journal of the American Society for Information Science, 1990
    532
  31. Jerry R Hobbs, Mark Stiekel, Douglas Appelt, Paul Martin.
    Interpretation as Abduction. SRI International Artificial Intelligence Center Technical Note 499, 1990
    515
  32. P F Brown, J Cocke, Della Pietra, S A, Della Pietra, V J, F Jelinek, J D Lafferty, R L Mercer, P S Roossin.
    A statistical approach to machine translation. Computational Linguistics, 1990
    487
  33. J R Burch, E M Clarke, K L McMillan, D L Dill, L J Hwang.
    Symbolic Model Checking: 10 20 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, 1990
    483
  34. F P Brooks.
    No Silver Bullet: Essence and Accidents of Software Engineering. Software State-of-the-Art: Selected, 1990
    481
  35. G W Stewart, J-G Sun.
    Matrix Perturbation Theory. 1990
    457
  36. Sarit Kraus, Daniel Lehmann, Menachem Magidor.
    Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 1990
    452
  37. F Glover.
    Tabu Search. Part II, ORSA Journal on Computing, 1990
    450
  38. Edmund Woronowicz.
    Relations defined on sets. Formalized Mathematics, 1990
    445
  39. J Y Halpern.
    Knowledge and common knowledge in a distributed environment. Journal of the ACM, 1990
    433
  40. Richard Sutton.
    Integrated architectures for learning, planning, and reacting based on approximating dynamic programming. In Proceedings of the Seventh International Conference on Machine Learning, 1990
    423
  41. K S Brace, R L Rudell, R E Bryant.
    Efficient Implementation of a BDD Package. In Proc. of 27 th ACM/IEEE Design Automation Conference (DAC, 1990
    423
  42. M Satyanarayanan, J J Kistler, P Kumar, M E Okasaki, E H Siegel, D C Steere.
    Coda: a highly available file system for a distributed workstation environment. In IEEE Transactions Computers, 1990
    422
  43. Czes̷law Byliński.
    Partial functions. Formalized Mathematics, 1990
    414
  44. P L Wadler.
    Comprehending monads. In Proceedings of ACM Conference on LISP and Functional Programming, 1990
    414
  45. L WESTOVER.
    Footprint evaluation for volume rendering. In Proc. of ACM SIGGRAPH, 1990
    410
  46. G Bracha, W Cook.
    Mixin-Based Inheritance. In Proceedings of the OOPSLA/ECOOP'90 Conference, 1990
    385
  47. David Harel, Hagi Lachover, Amnon Naaad, Amir Pnueli, Michal Politi, Rivi Sherman, Aharon Shtull-Trauring, Mark Trakhtenbrot.
    STATEMATE: A working environment for the development of complex reactive systems. IEEE Transactions on Software Engineering, 1990
    381
  48. Philip Wadler.
    Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 1990
    375
  49. W Härdle.
    Applied nonparametric regression. 1990
    350
  50. R ALVERSON, D CALLAHAN, D CUMMINGS, B KOBLENZ, A PORTERFIELD, B SMITH.
    The Tera computer system. In Proceedings of the International Conference on Supercomputing, 1990
    350
  51. M Vilain, H Kautz, P van Beek.
    Constraint propagation algorithms for temporal reasoning: A revised report. In Readings on Qualitative Reasoning about Physical Systems, 1990
    341
  52. Czesław Byliński.
    Binary operations. Formalized Mathematics, 1990
    327
  53. Agata Darmochwał.
    Finite sets. Formalized Mathematics, 1990
    305
  54. Beata Padlewska.
    Families of sets. Formalized Mathematics, 1990
    299
  55. J B Pollack.
    Recursive distributed representations. Artificial Intelligence, 1990
    298
  56. M Levoy.
    Efficient ray tracing of volume data. ACM Transactions on Graphics, 1990
    296
  57. N Dyn, D Levin, J A Gregory.
    A butterfly subdivision scheme for surface interpolation with tension control. ACM Transaction on Graphics, 1990
    295
  58. K K Ramakrishnan, R Jain.
    A Binary Feedback Scheme for Congestion Avoidance in Computer Networks. ACM Transactions on Computer Systems, 1990
    291
  59. J K Ousterhout.
    Why Aren't Operating Systems Getting Faster As Fast as Hardware. Proceedings Usenix Summer Conference, 1990
    291
  60. Andrzej Trybulec.
    Domains and their Cartesian products. Formalized Mathematics, 1990
    288
  61. Czesław Byliński.
    Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1990
    283
  62. H AGRAWAL, J R HORGAN.
    Dynamic program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, 1990
    282
  63. W PUGH.
    Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 1990
    273
  64. W Dally.
    Performance Analysis of k-ary n-cube Interconnection Networks. IEEE Transactions on Computers, 1990
    272
  65. H Samet.
    Application of Spatial Data Structures. Computer Graphics, Image Processing and GIS, Addison-Wesley, 1990
    272
  66. Andrzej Trybulec.
    Tuples, projections and Cartesian products. Formalized Mathematics, 1990
    268
  67. 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
  68. Wojciech A Trybulec.
    Pigeon hole principle. Formalized Mathematics, 1990
    259
  69. J Malik, P Perona.
    Preattentive texture discrimination with early vision mechanisms. Journal of the Optical Society of America A, 1990
    258
  70. A Agarwal, B H Lim, D Kranz, J Kubiatowicz.
    APRIL: a processor architecture for multiprocessing. In Proceedings of the 17th Annual International Symposium on Computer Architecture, 1990
    254
  71. R van Glabbeek.
    The linear time – branching time spectrum. in Proceedings CONCUR 90, 1990
    253
  72. Andrzej Trybulec.
    Binary operations applied to functions. Formalized Mathematics, 1990
    248
  73. E Helpman, Paul Krugman.
    Market structure and foreign trade. 1990
    248
  74. Wojciech A Trybulec.
    Vectors in real linear space. Formalized Mathematics, 1990
    244
  75. R Agrawal, T Imielinski, A Swami.
    Database mining: A performance perspective. IEEE Trans. Knowledge and Data Engineering, 1990
    243
  76. Czesław Byliński.
    The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1990
    243
  77. B Bershad, T Anderson, E Lazowska, H Levy.
    Lightweight remote procedure call. inria-00354580, version 1, 1990
    241
  78. D Chaum, A Fiat, M Naor.
    Untraceable Electronic Cash. Proc. Ann. Int’l Cryptology Conf. (CRYPTO, 1990
    240
  79. H Edelsbrunner, E P Mücke.
    Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph, 1990
    240
  80. J Y Halpern.
    An analysis of first-order logics of probability. Artificial Intelligence, 1990
    238
  81. J DOYLE, B FRANCIS, A TANNENBAUM.
    Feedback Control Theory. 1990
    229
  82. Grzegorz Bancerek.
    König’s theorem. Formalized Mathematics, 1990
    227
  83. N ALON, O GOmIIEIC, J H&TAD, R PERALTA.
    Simple constructions of almost k-wise independent random variables. In Proceedings of the 3/st lEEE Symposium on Foundations of Computer Science. IEEE, 1990
    227
  84. J Kramer, J Magee.
    The Evolving Philosophers Problem: Dynamic Change Management. IEEE Transactions on Software Engineering, 1990
    225
  85. X D HUANF, Y ARIKI, M A JACK.
    Hidden Markov Models for Speech Recognition. 1990
    225
  86. D R Smith.
    KIDS: a semi-automatic program development system. IEEE Transactions on Software Engineering --- Special Issue on Formal Methods, 1990
    224
  87. M R Jerrum, A Sinclair.
    Polynomialtime approximation algorithms for the Ising model. Proc. 17th ICALP, EATCS, 1990
    222
  88. S Abramsky.
    The Lazy Lambda Calculus. Research Topics in Functional Programming, 1990
    219
  89. S P Reiss.
    Connecting Tools Using Message Passing in the Field Environment. IEEE Software, 1990
    218
  90. P Shirley, A Tuchman.
    A polygonal approximation to direct scalar volume rendering. Proceedings of San Diego Workshop on Volume Visualization, 1990
    216
  91. D Ferrari.
    Client Requirements for Real-Time Communication Services. IEEE Communications Magazine, 1990
    213
  92. H R Turtle, W B Croft.
    Inference networks for document retrieval. In Vidick, J.L. (Ed.), Proceedings of the Thirteenth International Conference on Research and Development in Information Retrieval, 1990
    212
  93. S V Adve, M D Hill.
    Weak ordering — a new definition. In Proc. ISCA, 1990
    212
  94. E MOHR, D A KRANZ, R H HALSTEAD.
    Lazy task creation: A technique for increasing the granularity of parallel programs. In Proceedings of the ACM Conference on Lisp and Functional Programming, 1990
    211
  95. M E Pollack.
    Plans as complex mental attitudes. Intentions in communication, 1990
    210
  96. Moni Naor, Moti Yung.
    Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In STOC’90: 22nd Theory of computing Symposium. In EUROCRYPT’91: 10th International Conference on the Theory and Applications of Cryptographic Techniques, number 547 in LNCS, 1990
    208
  97. S Ceri, J Widom.
    Deriving production rules for constraint maintenance. In Proceedings of the Sixteenth International Conference on Very Large Data Bases, 1990
    207
  98. T G Griffin.
    The Formulae-as-Types Notion of Control. In: Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL’90, S an, 1990
    203
  99. J Mylopoulos, A Borgida, M Jarke, M Koubarakis.
    Telos: Representing Knowledge about Information Systems. ACM Transactions on Information Systems, 1990
    203
  100. J Dewitt, S Ghandeharizadeh D, A Schneider, A Bricker D, I Hsiao, H, R Rasmussen.
    The gamma database machine project. IEEE Trans. on Knowl. and Data Eng, 1990
    200