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. E Charniak.
    Bayesian networks without tears. AI Magazine, 1991
    200
  2. M Abadi, L Lamport.
    An old-fashioned recipe for real time. In Real-Time: Theory in Practice, REX Workshop, LNCS 600, 1991
    199
  3. P Havlak, K Kennedy.
    An implementation of interprocedural bounded regular section analysis. IEEE Transactions on Parallel and Distributed Systems, 1991
    198
  4. M Naor.
    Bit commitment using pseudorandomness. J. Cryptology, 1991
    198
  5. J Ioannidis, D Duchamp, G Q Maguire.
    IP-based protocols for mobile internetworking. In Conf. on Communications architecture and protocols (SIGCOMM’91). ACM, 1991
    193
  6. J B Pollack.
    The induction of dynamical recognizers. Machine Learning, 1991
    193
  7. A W Appel, D B MacQueen.
    Standard ML of New Jersey. In Third Int’l Symp. on Prog. Lang. Implementation and Logic Programming, 1991
    192
  8. K Sims.
    Artificial Evolution for Computer Graphics. Computer Graphics, 1991
    190
  9. D Chaiken, J Kubiatowicz, A Agarwal.
    LimitLESS Directories: A Scalable Cache Coherence Scheme. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 1991
    190
  10. T Bäck, F Hoffmeister, H-P Schwefel.
    A Survey of Evolution Strategies. Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms, 1991
    189
  11. A Agrawal, P Klein, R Ravi.
    When trees collide: an approximation algorithm for the generalized steiner problem in networks. Proc. 23rd A CM Syrup. on Theory of Computing, 1991
    187
  12. P Feautrier.
    Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 1991
    184
  13. H Almuallim, T G Dietterich.
    Learning with many irrelevant features. Proceedings of the Ninth National Conference on Artificial Intelligence, 1991
    184
  14. C Ancourt, F Irigoin.
    Scanning polyhedra with DO loops. In Proc. of the Third ACM/SIGPLAN Symp. on Principles and Practice of Parallel Programming, ACM Press, 1991
    181
  15. H Zhang, S Keshav.
    Comparison of rate-based service disciplines. In SIGCOMM, 1991
    178
  16. E A Emerson, C S Jutla.
    Tree Automata, Mu-Calculus and Determinacy (Extended Abstract. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, FOCS ’91, 1991
    177
  17. P Foldiak.
    Learning invariance from transformation sequences. Neural Computation, 1991
    176
  18. R Cartwright, M Fagan.
    Soft Typing. Proceedings of the Conference on Programming Language Design and Implementation (PLDI, 1991
    175
  19. P Karn, C Partridge.
    Improving round-trip time estimates in reliable transport protocols. ACM Transactions on Computer Systems, 1991
    175
  20. J Pearl, T Verma.
    A theory of inferred causation. Knowledge Representation and Reasoning: Proceedings of the Second International Conference, 1991
    174
  21. J Pollock.
    A Theory of Defeasible Reasoning. International Journal of Intelligent Systems, 1991
    172
  22. F Pfenning.
    Logic programming in the lf logical framework. Logical Frameworks, 1991
    172
  23. R K Belew, J McInerney, N N Schraudolph.
    Evolving networks: using the genetic algorithm with connectionist learning. In Proc. of the 2nd Artificial Life Conference, 1991
    171
  24. M Bern, D Eppstein.
    Mesh generation and optimal triangulation. Computing in Euclidean Geometry, 1991
    170
  25. A Appel, K Li.
    Virtual Memory Primitives for User Programs. Proc. ASPLOS IV, 1991
    169
  26. Anant Agarwal.
    Limits on Interconnection Network Performance. IEEE Transations on Parallel and Distributed Systems, 1991
    167
  27. M Brown.
    Zeus: A system for algorithm animation and multi-view editing. In The Proceedings of the IEEE Annual Workshop on Visual Languages, 1991
    167
  28. F P Kelly.
    Effective bandwidths at multi-class queues. Queueing Systems, 1991
    166
  29. G Blelloch, C Leiserson, B Maggs, C G Plaxton, S Smith, M Zagha.
    A Comparison of Sorting Algorithms for the Connection Machine CM-2. In Proc. of SPAA, 1991
    166
  30. P V Rangan, H M Vin.
    Designing File Systems for Digital Video and Audio. Proceedings of the 13th ACM Symposium on Operating System Principles, ACM, 1991
    164
  31. S B Thrun, J Bala, E Bloedorn, I Bratko, B Cestnik, J Cheng, K De Jong, S Dzeroski, S E Fahlman, D Fisher, R Hamann, K Kaufman, S Keller, I Kononenko, J Kreuziger, R S Michalski, T Mitchell, P Pachowicz, Y Reich, H Vafaie, W Van de Welde, W Wenzel, J Wnek, J Zhang.
    The MONK's problems: a performance comparison of dierent learning algorithms. 1991
    163
  32. Henk Barendregt.
    Self-interpretations in lambda calculus. J. Funct. Program, 1991
    161
  33. P Devanbu, R Brachman, P Selfridge, B Ballard.
    LaSSIE: a Knowledge-based Software Information System. In Domain Analysis and Software Systems Modeling, 1991
    160
  34. J Kleinhans, G Sigl, F Johannes, K Antreich.
    GORDIAN: VLSI placement by quadratic programming and slicing optimization. IEEE Trans. Computer-Aided Design, 1991
    159
  35. Peter Brown, Stephen Della Pietra, Vincent Della Pietra, Robert Mercer.
    Word Sense Disambiguation using Statistical Methods. Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics, 1991
    159
  36. Naser S Barghouti, Gail Kaiser.
    Concurrency Control in Advanced Database Applications. BOH+ 91] [CJM+ 92] [CR91] [Dav73] [DB92] [DHL90] Alejandro Buchmann, M. Tamer Ozsu, Mark Hornick, Dimitrios Georgakopoulos, and, 1991
    159
  37. Marc H Scholl, Christian Laasch, Markus Tresch.
    Updatable views in object--oriented databases. In Proc. 2. Int. Conf. on Deductive and Object--Oriented Databases, number 566 in LNCS, 1991
    159
  38. E P Simoncelli, E H Adelson, D J Heeger.
    Probability distributions of optical flow. In Proceedings of the IEEE conference on computer �ision and pattern recognition, 1991
    157
  39. J C M Baeten, J A Bergstra.
    Real time process algebra. Form. Asp. Comput, 1991
    157
  40. A Ricciardi, K P Birman.
    Using process groups to implement failure detection in asynchronous environments. In Proc. of the 11th ACM Symp. on Principles of Distributed Computing, 1991
    156
  41. L Console, D Theseider, P Porasso.
    On the relationship between abduction and deduction. J. Logic Programming, 1991
    155
  42. J C MOGUL, A BORG.
    The Effect of Context Switches on Cache Performance. In Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS, 1991
    154
  43. W Buntine.
    Theory refinement on Bayesian networks. In Proceedings of Seventh Conference on Uncertainty in Artificial lntelligence, 1991
    152
  44. B Liskov, S Ghemawat, R Gruber, P Johnson, L Shrira, M Williams.
    Replication in the Harp file system. SIGOPS Oper. Syst. Rev, 1991
    152
  45. Amos Fiat, Richard M Karp, Michael Luby, Lyle A McGeoch, Daniel Dominic Sleator, Neal E Young.
    Competitive paging algorithms. Journal of Algorithms, 1991
    152
  46. Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano.
    Noninteractive zero-knowledge. SIAM J. Comput, 1991
    152
  47. J Anderson.
    The adaptive nature of human categorization. Psychological Review, 1991
    151
  48. R Cooper, K Marzullo.
    Consistent detection of global predicates. In Proc. of the Workshop on Parallel and Distributed Debugging, 1991
    149
  49. T Freeman, F Pfenning.
    Refinement types for ml. In Conference on Programming Language Design and Implementation, 1991
    149
  50. T C Przymusinski.
    Stable semantics for disjunctive programs. New Generation Computing 9, 1991
    149
  51. W J Orlikowski, J J Baroudi.
    Studying information technology in organizations: research approaches and assumptions. Information Systems Research, 1991
    148
  52. T Anderson, H Levy, B Bershad, E Lazowska.
    The Interaction of Architecture and Operating System Design, volume 26. 1991
    148
  53. �PU91� C Pu, A Le�.
    Replica control in distributed systems: An asynchronous approach. Proc. 1991 ACM SIGMOD Conf. on Management of Data, 1991
    148
  54. M Abadi, L Cardelli, B C Pierce, G Plotkin.
    Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems, 1991
    147
  55. J R Burch, E M Clarke, D E Long.
    Symbolic model checking with partitioned transition relations. Proceedings of the 1991 International Conference on Very Large Scale Integration, 1991
    147
  56. Kourosh Gharachorloo, Anoop Gupta, John Hennessy.
    Performance evaluation of memory consistency models for shared-memory multiprocessors. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 1991
    147
  57. Craig Chambers, David Ungar, Elgin Lee.
    An Efficient Implementation of Self, a Dynamically-Typed Object-Oriented Language Based on Prototypes. In Lisp and Symbolic Computation, 1991
    147
  58. M Gupta, P Bannerjee.
    Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 1991
    146
  59. R Williams.
    Performance of dynamic load balancing algorithms for unstructured mesh calculations. Ph.D. in Electrical and Computer Engineering from The Ohio State University in 2008 and B.S. in Electrical and Electronic Engineering and B.S. in Physics from Bo˘gaziçi University, Turkey, in 2002. Robert T. Heaphy holds a Ph.D. in physics, M.A in mathema, 1991
    146
  60. M C Lin, J F Canny.
    A fast algorithm for incremental distance calculation. In Proc. IEEE Int. Conf. on Robotics & Automation, 1991
    146
  61. S Russell, E Wefald.
    Principles of metareasoning. Artificial Intelligence, 1991
    143
  62. Agata Darmochwał.
    The Euclidean space. Formalized Mathematics, 1991
    141
  63. D Wall.
    Predicting program behavior using real or estimated profiles. In Proceedings of PLDI, Toronto,Canada, 1991
    141
  64. R-Q Jia, C A Micchelli.
    Using the refinement equations for the construction of pre-wavelets. II: Powers of two. In: “Curves and Surfaces, 1991
    138
  65. Anant Agarwal, David Chaiken, Kirk Johnson, David Kranz, John Kubiatowicz, Kiyoshi Kurihara, Beng-Hong Lim, Gino Maa, Dan Nussbaum.
    The MIT Alewife Machine: A Large-Scale Distributed-Memory Multiprocessor. 1991
    138
  66. N Robertson, P D Seymour.
    Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B, 1991
    137
  67. David E Culler, Anurag Sah, Klaus Erik Schauser, Thorsten von Eicken, John Wawrzynek.
    Fine-grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine. In Proceedings of the Fourth International Conference onArchitectural Support for Programming Languages and Operating Systems (ASPLOS, 1991
    137
  68. W A Gale, K W Church.
    Identifying word correspondences in parallel texts. In Fourth DARPA Workshop on Speech and Natural Language, pages152–157. Djoerd Hiemstra, 1991
    136
  69. E Welzl.
    Smallest enclosing disks (balls and ellipsoids. Results and New Trends in Computer Science, 1991
    136
  70. Luca Cardelli, John C Mitchell.
    Operations on records. Mathematical Structures in Computer Science, 1991
    136
  71. O Maler, Z Manna, A Pnueli.
    From timed to hybrid systems. Proceedings REX Workshop on Real-Time: Theory in Practice, 1991
    133
  72. M Sullivan, R Chillarege.
    Software defects and their impact on system availability - A study of field failures in operating systems. In: Digest of Papers., 21 st International Symposium on Fault Tolerant Computing (FTCS-21, 1991
    133
  73. G Goff, K Kennedy, C W.
    Tseng "Practical dependence testing. Proceedings of the ACM SIGPLAN ’91 Conference on Programming Language Design and Implementation, 1991
    133
  74. F Teraoka, Y Yokore, M Tokoro.
    A network architecture providing host migration transparency. In Conf. on Communications Architecture and Protocols (SIGCOMM’91). ACM, 1991
    133
  75. L Cardelli.
    Typeful programming. In Formal Description of Programming Concepts, E.J. Neuhold and, 1991
    133
  76. C Bischof, A Carle, G Corliss, A Grienwank, P Hovland.
    ADIFOR: Generating derivative codes from Fortran programs. Scientific Programming, 1991
    132
  77. D J C MacKay.
    Bayesian Methods for Adaptive Models. 1991
    131
  78. M Kojima, N Meggiddo, T Noma, A Yoshise.
    A unified approach to interior point algorithms for linear complementarity problems. Lecture Notes i2n Comput. Sci, 1991
    130
  79. M Schroeder, A Birrell, M Burrows, H Murray, R Needham, T Rodeheffer, E Satterthwaite, C Thacker.
    Autonet: a high-speed, self-configuring local area network using point-to-point links. IEEE Journal on Selected Areas in Communications, 1991
    130
  80. M Mantei, R Baecker, A Sellen, W Buxton, T Milligan.
    Experience in the Use of a Media Space. in CHI’95, 1991
    130
  81. Xavier Nicollin, Joseph Sifakis.
    An overview and synthesis of timed process algebras. Proceedings of the 3rd International Workshop on Computer Aided Verification (CAV’91), volume 575 of Lecture Notes in Computer Science, 1991
    128
  82. S M Burns, A J Martin.
    Performance analysis and optimization of asynchronous circuits. Advanced Research in VLSI: Proceedings of the 1991 UC Santa Cruz Conference, 1991
    128
  83. Y Koren, J Borenstein.
    Potential field methods and their inherent limitations for mobile robot navigation. in IEEE International Conference on Robotics and Automation, 1991
    128
  84. R E Burkard, S Karisch, F Rendl.
    QAPLIB—A quadratic assignment problem library. Eur. J. Oper. Res, 1991
    128
  85. U Dayal, M Hsu, Ladin.
    R.: A transactional model for long-running activities. In: Proceedings of the 17th Very Large Data Base Conference (VLDB’91, 1991
    128
  86. Kenneth Church, William Gale, Patrick Hanks, Donald Hindle.
    Using statistics in lexical analysis. Lexical Acquisition: Exploiting On-Line Resources to Build a Lexicon, 1991
    127
  87. A Baker.
    Nonmonotonic reasoning in the framework of situation calculus. Arti cial Intelligence, 1991
    127
  88. Campbell R HARVEY.
    The World Price of Covariance Risk. Journal of Finance, 1991
    127
  89. D G Cantor, E Kaltofen.
    On fast multiplication of polynomials over arbitrary algebras. Acta Inform, 1991
    127
  90. Hans-J Boehm, Alan J Demers, Scott Shenker.
    Mostly parallel garbage collection. In Programming Languages Design and Implementation (PLDI, 1991
    126
  91. J M CHAMBERS.
    Statistical Models in S. 1991
    125
  92. K Gharachorloo, A Gupta, J Hennessy.
    Two Techniques to Enhance the Performance of Memory Consistency Models. In Proceedings of the International Conference on Parallel Processing, volume I, 1991
    122
  93. R J Collins, D R Jefferson.
    Selection in Massively Parallel Genetic Algorithms. Proc. of ICGA-91, 1991
    121