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. M Turk, A Pentland.
    Eigenfaces for recognition. Journal of Cognitive Neuroscience, 1991
    2187
  2. R A Brooks.
    Intelligence without representation. Artif. Intell, 1991
    1179
  3. M J Swain, D H Ballard.
    Color indexing. International Journal of Computer Vision, 1991
    1107
  4. L Davis.
    Ed.”Handbook of Genetic Algorithms. International Journal of Computer Science and Security, Volume (1): Issue, 1991
    969
  5. D W Aha, D Kibler, M K Albert.
    Instancebased learning algorithms. 1991
    882
  6. R Dechter, I Meiri, J Pearl.
    Temporal constraint networks. Artificial Intelligence, 1991
    831
  7. Ron Cytron, Jeanne Ferrante, Barry K Rosen, Mark N Wegman, F Kenneth Zadeck.
    Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 1991
    741
  8. A Van Gelder, K A Ross, J S Schlipf.
    The well-founded semantics for general logic programs. JACM, 1991
    734
  9. Anand S Rao, Michael P Georgeff.
    Modeling rational agents within a BDIarchitecture. 1991
    728
  10. G K Wallace.
    The JPEG Still Picture Compression Standard. IEEE Transactions on Consumer Electronics, 1991
    718
  11. R A BROOKS.
    Intelligence without reason. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, 1991
    708
  12. M Gelfond, V Lifschitz.
    Classical negation in logic programs and disjunctive databases. New Generation Computing, 1991
    679
  13. W Freeman, E Adelson.
    The design and use of steerable filters. IEEE TPAMI, 1991
    674
  14. M E Wolf, M S Lam.
    A data locality optimizing algorithm. In Proc. SIGPLAN conf. on programming language design and implementation (pp. 30–43, 1991
    673
  15. E Moggi.
    Notions of computation and monads. Information and Computation, 1991
    644
  16. C A Ellis, S J Gibbs, G Rein.
    Groupware: some issues and experiences. Communications of the ACM, 1991
    640
  17. Maurice Herlihy.
    Wait-free synchronization. ACM Transaction on Programming Languages and Systems (TOPLAS, 1991
    638
  18. N Hutchinson, L L Peterson.
    The x-kernel: An architecture for implementing network protocols. IEEE Transactions on Software Engineering, 1991
    576
  19. K P Birman, A Schiper, P Stephenson “Lightweight.
    causal and atomic group multicast. ACM Transactions on Computer Systems, 1991
    541
  20. H H Clark, Susan E Brennan.
    Grounding in communication. In, 1991
    525
  21. J Carter, J Bennett, W Zwaenepoel.
    Implementation and performance of Munin. ACM SIGOPS Operating Systems Review, 1991
    519
  22. David H Bailey, Eric Barszcz, John T Barton, David S Browning, Robert L Carter, Leonardo Dagum, Rod A Fatoohi, Paul O Frederickson, Tom A Lasinski, Robert S Schreiber, Horst D Simon, V Venkatakrishnan, Sisira K Weeratunga.
    The NAS Parallel Benchmarks. The International Journal of Supercomputer Applications, 1991
    518
  23. P Cheeseman, B Kanefsky, W Taylor.
    Where the really hard problems are. In Proceedings of IJCAI-91, 1991
    496
  24. Monica S Lam, Edward E Rothberg, Michael E Wolf.
    The cache performance and optimizations of blocked algorithms. In In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 1991
    485
  25. F Aurenhammer.
    Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys (CSUR, 1991
    456
  26. J Mellor-Crummey, M Scott.
    Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM TOCS, 1991
    426
  27. D Mills.
    Internet time synchronization: The network time protocol. IEEE Trans. Commun, 1991
    417
  28. G G Robertson, J D Mackinlay, S K Card.
    Cone trees: animated 3d visualizations of hierarchical information. In Proceedings of CHI, 1991
    416
  29. N Halbwachs, P Caspi, P Raymond, D Pilaud.
    The synchronous dataflow programming language lustre. In Proceedings of the IEEE, 1991
    410
  30. M Abadi, L Lamport.
    The existence of refinement mappings. Theoretical Computer Science, 1991
    405
  31. Butler Lampson, Martín Abadi, Michael Burrows, Edward Wobber.
    Authentication in distributed systems: Theory and practice. In Proc. 13th ACM Symp. on Operating System Principles (SOSP, 1991
    400
  32. M Baker, J Hartman, M Kupfer, L Shirriff, J Ousterhout.
    Measurements of a Distributed File System. Proceedings of the 13th Symposium on Operating System Principles, 1991
    399
  33. E H Adelson, J R Bergen.
    The plenoptic function and the elements of early vision. Computational Models of Visual Processing, 1991
    376
  34. L D Cohen.
    On active contour models and balloons. CVGIP: Image Understanding, 1991
    374
  35. Paul Krugman.
    Increasing Returns and Economic Geography. Journal of Political Economy, 1991
    373
  36. Benjamin Kuipers, Yung-Tai Byun.
    A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations. Robotics and Autonomous Systems, 1991
    372
  37. K G Larsen, A Skou.
    Bisimulation through probabilistic testing. Information and Computation, 1991
    364
  38. D McAllester, D Rosenblitt.
    Systematic nonlinear planning. In Proc. AAAI-91, 1991
    355
  39. M Abadi, L Cardelli, P-L Curien, L J-J.
    évy. Explicit substitutions. Journal of Functional Programming, 1991
    354
  40. Pat Hanrahan, David Salzman, Larry Aupperle.
    A rapid hierarchical radiosity algorithm. In SIGGRAPH 91, 1991
    347
  41. M C Fitting.
    Bilattices and the semantics of logic programming. Journal of Logic Programming, 1991
    344
  42. S Keshav.
    A control-theoretic approach to flow control. in Proceedings of ACM SIGCOMM, 1991
    342
  43. D W WALL.
    Limits of instruction-level parallelism. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 1991
    336
  44. K Honda, M Tokoro.
    An Object Calculus for Asynchronous Communication. In Proceedings of the European Conference on Object-oriented Programming (ECOOP’91), number 512 in LNCS, 1991
    336
  45. Hirofumi Katsuno, Alberto O Mendelzon.
    On the difference between updating a knowledge base and revising it. In KR, 1991
    334
  46. W A Gale, Church.
    K.W.: A program for aligning sentences in bilingual corpora. In: 29th Annual Meeting on Association for Computational Linguistics, 1991
    334
  47. D E Goldberg, K Deb.
    A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms, 1991
    332
  48. Jeroen Groenendijk, Martin Stokhoff.
    Dynamic predicate logic. Linguistics and Philosophy 14:39–100, 1991
    330
  49. D Miller, G Nadathur, F Pfenning, A Scedrov.
    Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 1991
    330
  50. A Benveniste, G Berry.
    The synchronous approach to reactive real-time systems. Proceedings of the IEEE, 1991
    326
  51. R Scheifler.
    FYI On the X Window System. 1991
    318
  52. D J Felleman, D C Van Essen.
    Distributed hierarchical processing in the primate cerebral cortex. Cereb. Cortex, 1991
    315
  53. T M J Fruchterman, E M Reingold.
    Graph Drawing by Force-directed Placement. Software - Practice and Experience, 1991
    313
  54. O Goldreich, S Micali, A Wigderson.
    Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 1991
    313
  55. C Tomasi, T Kanade.
    Detection and tracking of point features. 1991
    309
  56. L Zhang, S Shenker, D D Clark.
    Observations on the Dynamics of a Congestion Control Algorithm: the Effects of Two-Way Traffic. SIGCOMM Comput. Commun. Rev, 1991
    307
  57. K W Currie, A Tate.
    O-Plan: the Open Planning Architecture. Artijicial Intelligence Journal, 1991
    293
  58. Mark N Wegman, F Kenneth Zadeck.
    Constant propagation with conditional branches. ACM Trans. Program. Lang. Syst, 1991
    292
  59. R W Freund, N M Nachtigal.
    QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math, 1991
    289
  60. Peter Clark, Robin Boswell.
    Rule induction with CN2: Some recent improvements. In Machine Learning - Proceeding of the Fifth Europen Conference (EWSL91, 1991
    288
  61. S P Abney.
    Parsing by chunks. Principle-based parsing: Computation and Psycholinguistics, 1991
    287
  62. J Hodas, D Miller.
    Logic programming in a fragment of intuitionistic linear logic. In Sixth Ann. Symp. on Logic in Comp. Science. IEEE, 1991
    278
  63. J Lin.
    Divergence measures based on the shannon entropy. IEEE Trans. Inform. Theory, 1991
    275
  64. Erik Meijer, Maarten Fokkinga, Ross Paterson.
    Functional programming with bananas, lenses, envelopes and barbed wire. Proceedings 5th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA’91, 1991
    272
  65. David Goldberg.
    What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 1991
    264
  66. S J Teller, C H Séquin.
    Visibility preprocessing for interactive walkthroughs. In ACM SIGGRAPH 91, 1991
    263
  67. E Charniak, R Goldman.
    A probabilistic model of plan recognition. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91, 1991
    260
  68. F Douglis, J Ousterhout.
    Transparent Process Migration: Design Alternatives and the Sprite Implementation. Software - Practice And Experience, 1991
    249
  69. K B Gallagher, J R Lyle.
    Using program slicing in software maintenance. IEEE Transactions on Software Engineering, 1991
    242
  70. F Baader, P Hanschke.
    A Scheme for Integrating Concrete Domains into Concept Languages. In Proc. IJCAI ’91, 1991
    242
  71. S Abiteboul, A Bonner.
    Objects and views. Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, volume 20:2 of SIGMOD Record, 1991
    240
  72. O Grumberg, D E Long.
    Model checking and modular verification. Proceedings of CONCUR '91: gnd International Conference on Concurrency Theory, volume 527 of Lecture Notes in Computer Science, 1991
    239
  73. Klaus Schild.
    A correspondence theory for terminological logics: Preliminary report. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI’91, 1991
    234
  74. V A Saraswat, M Rinard, P Panangaden.
    Semantics foundations of concurrent constraint programming. In Proceedings of POPL, 1991
    229
  75. R E Bryant.
    On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, 1991
    227
  76. M Stonebraker, G Kemnitz.
    The postgres next generation database management system. Commun. ACM, 1991
    224
  77. E A Brewer, C N Dellarocas, A Colbrook, W E Weihl.
    PROT~.US: A highperformance parallel-architecture simulator. 1991
    221
  78. Francesco M Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt.
    The Complexity of Concept Languages. Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, 1991
    219
  79. R Brachman, D MacGuiness, P Patel-Schneider, L Resnick, A Borgida.
    Living with Classic: when and How to Use a KL-ONE-like Language. In Principles of Semantic Networks, 1991
    213
  80. Samson Abramsky.
    Domain theory in logical form. Journal of Pure and Applied Logic, 1991
    211
  81. L BABAI, L FORTNOW, L A LEVIN, M SZEGEDY.
    Checking computations in polylogarithmic time. In Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC). ACM, 1991
    210
  82. E Mohr, D A Kranz, R H Halstead.
    Lazy task creation: A technique for increasing the granularity of parallel programs. IEEE Trans. Parallel Distrib. Syst, 1991
    210
  83. J AND SCHWARTZBACH PALSBERG, M I.
    Object-oriented type inference. In Proceedings of the ACM SIGPLAN ’91 Conference on Object-Oriented Programming Systems, Languages, and Applications. SIGPLAN, ACM, 1991
    208
  84. S A Plotkin, D B Shmoys, É Tardos.
    Fast approximation algorithms for fractional packing and covering problems. In IEEE FOCS, 1991
    208
  85. L Lovász, A Schrijver.
    Cones of matrices and set-functions, and 0-1 optimization. SIAM Journal on Optimization, 1991
    203
  86. B A Price, I S Small, R M Baecker.
    A Principled Taxonomy of Software Visualization. Journal of Visual Languages and Computing, 1991
    203
  87. P P Chang, S A Mahlke, W Y Chen, N J Warter, W-m W Hwu.
    IMPACT: an architectural framework for multiple-instruction-issue processors. In ISCA ’91: Proceedings of the 18th annual international symposium on Computer architecture, 1991
    203
  88. S Arnborg, J Lagergren, D Seese.
    Easy problems for tree-decomposable graphs. J. Algorithms, 1991
    202
  89. R AND OFFUTT DEMILLO, A.
    Constraint-based automatic test data generation. IEEE Trans. Softw. Eng, 1991
    201
  90. J-M Andreoli, Pareschi.
    R.: Linear objects: Logical processes with built-in inheritance. New Generation Computing 9, 1991
    201
  91. H Turtle, W B Croft.
    Evaluation of an inference network-based retrieval model. ACM Trans. Inf. Syst, 1991
    201