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

Indexing by latent semantic analysis. Journal of the American Society of Information Science, 19902089

Finding structure in time. Cognitive Science, 19901290

Tarski Grothendieck set theory. Formalized Mathematics, 19901274

Introduction to WordNet: An Online Lexical Database. International Journal of Lexicography, 19901252

Functions and their basic properties. Formalized Mathematics, 19901222

Properties of subsets. Formalized Mathematics, 19901143

A logic of authentication. ACM Transactions on Computer Systems, 19901039

Temporal and modal logics. Handbook of Theoret. Comput. Sci., volume B, 19901004

Functions from a set to a set. Formalized Mathematics, 1990975

Relations and their basic properties. Formalized Mathematics, 1990964

Federated database systems for managing distributed, heterogeneous, and autonomous databases. Computing Surveys, 1990952

Multicast Routing in Datagram Internetworks and extended LANs. ACM Transactions on Computer Systems, 1990914

Generalized additive models. 1990913

Scalespace and edge detection using anisotropic diffusion. IEEE Trans. Pattern Anal. Mach. Intell, 1990891

The R*tree: an efficient and robust access method for points and rectangles. SIGMOD Rec, 1990846

Learning logical definitions from relations. Machine Learning, 1990781

Linearizability: A correctness condition for concurrent objects. A CM Trunsactions on Programming Languages and Systems, 1990743

Rewrite systems. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B, 1990711

Some basic properties of sets. Formalized Mathematics, 1990700

Implementing faulttolerant services using the state machine approach: A tutorial. ACM Comput. Surv, 1990699

The symbol grounding problem. Physica D, 1990657

The fundamental properties of natural numbers. Formalized Mathematics, 1990619

A Scheme For RealTime Channel Establishment In WideArea Networks. IEEE Journal On Selected Areas In Communications, 1990605

The ordinal numbers. Formalized Mathematics, 1990605

The strength of weak learnability. Machine Learning, 1990534

Improving retrieval performance by relevance feedback. In Journal of the American Society for Information Science (JASIS, 1990525

Basic properties of real numbers. Formalized Mathematics, 1990523

P.S.: A statistical approach to machine translation. Computational Linguistics, 1990485

Matrix Perturbation Theory. 1990452

Tabu Search. Part II, ORSA Journal on Computing, 1990448

Relations defined on sets. Formalized Mathematics, 1990429

Efficient implementation of a bdd package. In DAC, 1990424

Coda: A Highly Available File System for a Distributed Workstation Environment. IEEE Transactions on Computer, 1990423

The chemical abstract machine. In Proceedings of the 17th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages—POPL’90, 1990417

Footprint evaluation for volume rendering. In Proceedings of ACM SIGGRAPH 90, 1990398

Concurrent constraint programming. In Seventeenth Ann. ACM Symp. on Princ. of Program. Lang, 1990396

Mixinbased inheritance. Proc. Conf. OO. Prog.: Syst., Lang., and Appl. / Proc. ECOOP, 1990382

Statemate: a working environment for the development of complex reactive systems. IEEE Trans. on Software Eng, 1990379

Optimal brain damage. In Advances in Neural Information Processing Systems, 1990373

The Tera computer system. In Proceedings of the 4th International Conference on Supercomputing, ICS ’90, 1990352

Boosting a weak learning algorithm by majority. In COLT: Proceedings of the Workshop on Computational Learning Theory, 1990347

Binary operations. Formalized Mathematics, 1990323

Finite sets. Formalized Mathematics, 1990300

Recursive distributed representations. Artificial Intelligence, 1990299

Families of sets. Formalized Mathematics, 1990297

Efficient ray tracing of volume data. ACM Transactions on Graphics, 1990293

Aren’t Operating Systems Getting Faster As Fast as Hardware. Proceedings of the 1990 Summer Usenix, 1990293

Elephants don’t play chess. Robotics and Autonomous Systems, 1990292

A binary feedback scheme for congestion avoidance in computer networks. ACM Trans. Comp. Systems, 1990291

A.: A butterfly subdivision scheme for surface interpolation with tension control. ACM Trans. Graph. 9, 1990291

Domains and their Cartesian products. Formalized Mathematics, 1990282

Finite sequences and tuples of elements of a nonempty sets. Formalized Mathematics, 1990279

Fortran D language specification. 1990278

Dynamic program slicing. In Proceedings of the ACM SIGPLAN ’90 Conference on Programming Language Design and Implementation (PLDI ’90, 1990277

The StructureMapping Engine: Algorithm and Examples. Artificial Intelligence, 1990277

Performance Analysis of kary ncube Interconnection Networks. in Proceedings of the ACM/IEEE conference on Supercomputing (SC'03, 1990272

Tuples, projections and Cartesian products. Formalized Mathematics, 1990268

Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 1990267

Why functional programming matters. In Research Topics in Functional Programming, Univ. of Texas at Austin Year of Programming Series, chapter 2, 1990264

Munin: Distributed shared memory based on typespecific memory coherence. in PPOPP ’90: Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1990260

Pigeon hole principle. Journal of Formalized Mathematics, 1990258

Algebraic methods for interactive proof systems. In Proc. 31st IEEE Symp. Foundations of Computer Science, 1990258

Preattentive texture discrimination with early vision mechanisms. Journal of the Optical Society of America A, 1990254

APRIL: a processor architecture for multiprocessing. In 17th Annual International Symposium on Computer Architecture, 1990253

Binary operations applied to functions. Formalized Mathematics, 1990245

The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1990243

Lightweight remote procedure call. ACM Trans. Comput. Syst, 1990239

An analysis of firstorder logics of probability. Artificial Intelligence, 1990238

M"ucke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 1990234

Vectors in real linear space. Formalized Mathematics, 1990233

The reflection theorem. Formalized Mathematics, 1990225

Kids: A semiautomatic program development system. IEEE Trans. on Soft. Eng., Spec. Issue on Formal Methods, 1990224

The evolving philosophers problem: Dynamic change management. IEEE TSE, 1990220

A polygonal approximation to direct scalar volume rendering. Proceedings of San Diego Workshop on Volume Visualization, 1990217

Connecting Tools Using Message Passing in the Field Environment. IEEE Software, 1990217

Report on the programming language Haskell, A nonstrict purely functional language (Version 1.0. Dep. of Computer Sc., Yale University, 1990214

Client Requirements for RealTime Communication Services. IEEE Comm. Magazine, 1990214

Inference Networks for Document Retrieval. Proceedings of the 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1990212

Plans as complex mental attitudes. Intentions in communication, 1990210

Weak ordering — a new definition. In Proc. ISCA, 1990210

Deriving Production Rules for Constraint Maintenance. Proc. 16th Int’l Conf. Very Large Databases, 1990207

Publickey cryptosystems provably secure against chosen ciphertext attacks. In Symposium on Theory of Computing – STOC 1990, ACM, 1990205

Telos: Representing Knowledge about Information Systems. ACM Transactions on Information Systems, 1990203

The formulaeastypes notion of control. In 17th Annual ACM Symp. on Principles of Programming Languages, 1990201

Experiences with the Amoeba distributed operating system. Commun. ACM, 1990199

The Gamma database machine project. IEEE Transactions on Knowledge and Data Engineering, 1990197

Disk scheduling revisited. In Proceedings of the Winter 1990 USENIX Technical Conference, 1990197

Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing. Journal of Algorithms, 1990196

Improving Register Allocation for subscripted Variables. In Proceedings of the ACM SIGPLAN ’90 Conference on Programming Language Design and Implementation, 1990193

RealTime Mach: Towards a predictable realtime system. In Proc. USENIX Mach Workshop, 1990193

Noun classification from predicateargument structures. In Proceedings of ACL90, 1990191

Data caching issues in an informational retrieval system. ACM Trans. on Database Sys, 1990191