Most Cited Computer Science Articles
This list is generated from documents in the CiteSeer^{x} 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 CiteSeer^{x} 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

Bayesian networks without tears. AI Magazine, 1991200

Deriving production rules for incremental view maintenance. In VLDB, 1991199

An oldfashioned recipe for real time. In RealTime: Theory in Practice, REX Workshop, LNCS 600, 1991199

An implementation of interprocedural bounded regular section analysis. IEEE Transactions on Parallel and Distributed Systems, 1991198

Bit commitment using pseudorandomness. J. Cryptology, 1991198

Compositional modeling: finding the right model for the job, Artificial Intel15 ligence 51. Proc. of AAAI94, 1991194

IPbased protocols for mobile internetworking. In Conf. on Communications architecture and protocols (SIGCOMM’91). ACM, 1991193

The induction of dynamical recognizers. Machine Learning, 1991193

Standard ML of New Jersey. In Third Int’l Symp. on Prog. Lang. Implementation and Logic Programming, 1991192

Artificial Evolution for Computer Graphics. Computer Graphics, 1991190

LimitLESS Directories: A Scalable Cache Coherence Scheme. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 1991190

Generating textures on arbitrary surfaces using reactiondiffusion. Computer Graphics, 1991190

A Survey of Evolution Strategies. Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms, 1991189

When trees collide: an approximation algorithm for the generalized steiner problem in networks. Proc. 23rd A CM Syrup. on Theory of Computing, 1991187

Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 1991184

Learning with many irrelevant features. Proceedings of the Ninth National Conference on Artificial Intelligence, 1991184

Scanning polyhedra with DO loops. In Proc. of the Third ACM/SIGPLAN Symp. on Principles and Practice of Parallel Programming, ACM Press, 1991181

Comparison of ratebased service disciplines. In SIGCOMM, 1991178

Tree Automata, MuCalculus and Determinacy (Extended Abstract. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, FOCS ’91, 1991177

Learning invariance from transformation sequences. Neural Computation, 1991176

Soft Typing. Proceedings of the Conference on Programming Language Design and Implementation (PLDI, 1991175

Improving roundtrip time estimates in reliable transport protocols. ACM Transactions on Computer Systems, 1991175

A theory of inferred causation. Knowledge Representation and Reasoning: Proceedings of the Second International Conference, 1991174

A Theory of Defeasible Reasoning. International Journal of Intelligent Systems, 1991172

Logic programming in the lf logical framework. Logical Frameworks, 1991172

Evolving networks: using the genetic algorithm with connectionist learning. In Proc. of the 2nd Artificial Life Conference, 1991171

Mesh generation and optimal triangulation. Computing in Euclidean Geometry, 1991170

Virtual Memory Primitives for User Programs. Proc. ASPLOS IV, 1991169

Limits on Interconnection Network Performance. IEEE Transations on Parallel and Distributed Systems, 1991167

Task decomposition through competition in a modular connectionist architecture: the what and where vision tasks. Cognitive Science, 1991167

Zeus: A system for algorithm animation and multiview editing. In The Proceedings of the IEEE Annual Workshop on Visual Languages, 1991167

Effective bandwidths at multiclass queues. Queueing Systems, 1991166

A Comparison of Sorting Algorithms for the Connection Machine CM2. In Proc. of SPAA, 1991166

Designing File Systems for Digital Video and Audio. Proceedings of the 13th ACM Symposium on Operating System Principles, ACM, 1991164

Selfinterpretations in lambda calculus. J. Funct. Program, 1991161

LaSSIE: a Knowledgebased Software Information System. In Domain Analysis and Software Systems Modeling, 1991160

GORDIAN: VLSI placement by quadratic programming and slicing optimization. IEEE Trans. ComputerAided Design, 1991159

Word Sense Disambiguation using Statistical Methods. Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics, 1991159

Concurrency Control in Advanced Database Applications. BOH+ 91] [CJM+ 92] [CR91] [Dav73] [DB92] [DHL90] Alejandro Buchmann, M. Tamer Ozsu, Mark Hornick, Dimitrios Georgakopoulos, and, 1991159

Updatable views in objectoriented databases. In Proc. 2. Int. Conf. on Deductive and ObjectOriented Databases, number 566 in LNCS, 1991159

Probability distributions of optical flow. In Proceedings of the IEEE conference on computer �ision and pattern recognition, 1991157

Real time process algebra. Form. Asp. Comput, 1991157

Using process groups to implement failure detection in asynchronous environments. In Proc. of the 11th ACM Symp. on Principles of Distributed Computing, 1991156

On the relationship between abduction and deduction. J. Logic Programming, 1991155

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, 1991154

Theory refinement on Bayesian networks. In Proceedings of Seventh Conference on Uncertainty in Artificial lntelligence, 1991152

Replication in the Harp file system. SIGOPS Oper. Syst. Rev, 1991152

Competitive paging algorithms. Journal of Algorithms, 1991152

Noninteractive zeroknowledge. SIAM J. Comput, 1991152

The adaptive nature of human categorization. Psychological Review, 1991151

Consistent detection of global predicates. In Proc. of the Workshop on Parallel and Distributed Debugging, 1991149

Refinement types for ml. In Conference on Programming Language Design and Implementation, 1991149

Stable semantics for disjunctive programs. New Generation Computing 9, 1991149

Studying information technology in organizations: research approaches and assumptions. Information Systems Research, 1991148

Replica control in distributed systems: An asynchronous approach. Proc. 1991 ACM SIGMOD Conf. on Management of Data, 1991148

Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems, 1991147

Symbolic model checking with partitioned transition relations. Proceedings of the 1991 International Conference on Very Large Scale Integration, 1991147

Performance evaluation of memory consistency models for sharedmemory multiprocessors. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 1991147

An Efficient Implementation of Self, a DynamicallyTyped ObjectOriented Language Based on Prototypes. In Lisp and Symbolic Computation, 1991147

Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 1991146

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, 1991146

A fast algorithm for incremental distance calculation. In Proc. IEEE Int. Conf. on Robotics & Automation, 1991146

Principles of metareasoning. Artificial Intelligence, 1991143

The Euclidean space. Formalized Mathematics, 1991141

Predicting program behavior using real or estimated profiles. In Proceedings of PLDI, Toronto,Canada, 1991141

Using the refinement equations for the construction of prewavelets. II: Powers of two. In: “Curves and Surfaces, 1991138

Graph minors. X. Obstructions to treedecomposition. J. Comb. Theory, Ser. B, 1991137

Finegrain parallelism with minimal hardware support: A compilercontrolled threaded abstract machine. In Proceedings of the Fourth International Conference onArchitectural Support for Programming Languages and Operating Systems (ASPLOS, 1991137

Identifying word correspondences in parallel texts. In Fourth DARPA Workshop on Speech and Natural Language, pages152–157. Djoerd Hiemstra, 1991136

Smallest enclosing disks (balls and ellipsoids. Results and New Trends in Computer Science, 1991136

Operations on records. Mathematical Structures in Computer Science, 1991136

From timed to hybrid systems. Proceedings REX Workshop on RealTime: Theory in Practice, 1991133

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 (FTCS21, 1991133

Tseng "Practical dependence testing. Proceedings of the ACM SIGPLAN ’91 Conference on Programming Language Design and Implementation, 1991133

A network architecture providing host migration transparency. In Conf. on Communications Architecture and Protocols (SIGCOMM’91). ACM, 1991133

Typeful programming. In Formal Description of Programming Concepts, E.J. Neuhold and, 1991133

ADIFOR: Generating derivative codes from Fortran programs. Scientific Programming, 1991132

Bayesian Methods for Adaptive Models. 1991131

A unified approach to interior point algorithms for linear complementarity problems. Lecture Notes i2n Comput. Sci, 1991130

Autonet: a highspeed, selfconfiguring local area network using pointtopoint links. IEEE Journal on Selected Areas in Communications, 1991130

Experience in the Use of a Media Space. in CHI’95, 1991130

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, 1991128

Performance analysis and optimization of asynchronous circuits. Advanced Research in VLSI: Proceedings of the 1991 UC Santa Cruz Conference, 1991128

Potential field methods and their inherent limitations for mobile robot navigation. in IEEE International Conference on Robotics and Automation, 1991128

QAPLIB—A quadratic assignment problem library. Eur. J. Oper. Res, 1991128

R.: A transactional model for longrunning activities. In: Proceedings of the 17th Very Large Data Base Conference (VLDB’91, 1991128

Using statistics in lexical analysis. Lexical Acquisition: Exploiting OnLine Resources to Build a Lexicon, 1991127

Nonmonotonic reasoning in the framework of situation calculus. Arti cial Intelligence, 1991127

The World Price of Covariance Risk. Journal of Finance, 1991127

On fast multiplication of polynomials over arbitrary algebras. Acta Inform, 1991127

Mostly parallel garbage collection. In Programming Languages Design and Implementation (PLDI, 1991126

Statistical Models in S. 1991125

Reaching agreement on processorgroup membership in synchronous distributed systems. Distributed Computing, 1991125

Two Techniques to Enhance the Performance of Memory Consistency Models. In Proceedings of the International Conference on Parallel Processing, volume I, 1991122

Partial global planning: A coordination framework for distributed hypothesis formation. IEEE Trans. SMC, 1991122

Selection in Massively Parallel Genetic Algorithms. Proc. of ICGA91, 1991121