Most Cited Computer Science Articles
This list is generated from documents in the CiteSeer^{x} database as of March 19, 2015. 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
 2013
 2014
 2015

Eigenfaces for recognition. Journal of Cognitive Neuroscience, 19913017

Intelligence without representation. Artificial Intelligence, 19911528

Color Indexing. Int’l J. Computer Vision, 19911406

Handbook of genetic algorithms. 19911302

InstanceBased Learning Algorithms. Machine Learning, 19911140

Economic Growth in a Cross Section of Countries. Quarterly Journal of Economics 106, 19911092

The theory of planned behavior. Organizational Behavior and Human Decision Processes, 19911044

Increasing Returns and Economic Geography. Journal of Political Economy, 19911006

Modeling rational agents within a bdiarchitecture. in Proc. KR’92, 1991895

Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst, 1991883

Classical negation in logic programs and disjunctive databases. New Generation Computing, 1991882

The wellfounded semantics for general logic programs. J. of the ACM, 1991880

Grounding in Communication. Perspectives on Socially Shared Cognition, 1991850

Intelligence Without Reason. in ‘Proceedings of the 1991 International Joint Conference on Arti Intelligence, 1991832

Groupware: Some Issues and Experiences. Communications of the ACM, 1991782

Waitfree synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS, 1991763

A data locality optimizing algorithm. In Proc. Conference on Programming Language Design and Impl, 1991737

Culture and the self: Implications for cognition, emotion, and motivation. Psychological Review, 1991703

MPEG: A Video Compression Standard for Multimedia Applications. Comm. of the ACM, 1991628

The xkernel: An architecture for implementing network protocols. IEEE Transactions on Software Engineering, 1991624

The NAS Parallel Benchmarks. The International Journal of Supercomputer Applications, 1991618

Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Survey, 1991613

Where the really hard problems are. Proc. of the 12th Int’l Joint Conf. on Artificial Intelligence, 1991612

Multitask PrincipalAgent Analyses: Incentive Contracts, Asset Ownership, and Job Design. The Journal of Law, Economics, and Organization, 1991596

Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems, 1991586

Implementation and performance of munin. SIGOPS Oper. Syst. Rev, 1991561

ªDifferential Cryptanalysis of DESLike Cryptosystems,º. J. Cryptology, 1991549

e al; The Synchronous Data Flow Programming Language LUSTRE. Proceedings of the IEEE, vol 79, no 9, 1991540

The cache performance and optimizations of blocked algorithms. In Proceedings of the fourth international conference on Architectural, 1991530

Internet time synchronization: The network time protocol. IEEE Transactions on Communications, 1991514

Algorithms for scalable synchronization on sharedmemory multiprocessors. ACM Transactions on Computer Systems, 1991510

Cone Trees: Animated 3D Visualizations of Hierarchical Information. Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI '91), ACM, 1991502

Unsupervised texture segmentation using gabor filters. Pattern Recognition, 1991497

LongRun Policy Analysis and LongRun Growth. Journal of Political Economy, 1991496

NOTE on active contour models and balloons. CVGIP: Image Understanding, 1991489

The plenoptic function and the elements of early vision. Computational Models of Visual Processing, 1991486

The Omega test: a fast and practical integer programming algorithm for dependence analysis. In Conference on Supercomputing, 1991478

Graph drawing by forcedirected placement. Software: Practice and Experience, 1991471

Nonmalleable cryptography. In STOC ’91: Proceedings of the 23rd Annual ACM symposium on Theory of computing, 1991471

Detection and Tracking of Point Features. 1991470

W.: Introduction to ObjectOriented Databases. Computer System Series, 1991467

The existence of refinement mappings. Theoretical Computer Science, 1991462

Divergence Measures Based on the Shannon Entropy. IEEE Trans. Information Theory, 1991450

Measurements of a Distributed Filesystem. in Proceedings of 13th ACM Symposium on Operating Systems Principles, 1991433

On the difference between updating a knowledge base and revising it. In Proceedings of KR’91, 1991432

A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms, 1991421

Systematic nonlinear planning. In Proceedings of the 9th National Conference on Arti Intelligence, 1991408

Does Compulsory School Attendance Affect Schooling and Earnings?” Quarterly. Journal of Economics, 1991408

NonDeterministic Exponential Time has TwoProver Interactive Protocols. On the Role of Shared Randomness in Two Prover Proof Systems. Proceedings of the third Israel Symposium on Theory and Computing Systems, IEEE, 1991406

Dynamic predicate logic. Linguistics & Philosophy, 1991402

A controltheoretic approach to flow control. ACM SIGCOMM Computer Communication Review, 1991398

Bilattices and the semantics of logic programming. J. of Logic Programming, 1991394

Treemaps: A spaceFilling Approach to the Visualization of Hierarchical Information Structures. Proceedings of IEEE Information Visualization ’91, 1991393

The synchronous approach to reactive and realtime systems. IEEE Proceedings, 1991391

The vector field histogram: Fast obstacle avoidance for mobile robots. IEEE Transactions on Robotics and Automation, 1991385

Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 1991384

What every computer scientist should know about floatingpoint arithmetic. ACM Computing Surveys, 1991379

Limits of instructionlevel parallelism. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 1991375

An Object Calculus for Asynchronous Communications. In Proceedings of ECOOP’91, 1991375

Parsing by chunks. PrincipleBased Parsing: Computation and Psycholinguistics, 1991361

Half a century of research on the Stroop effect: An integrative review. Psychological Bulletin, 1991361

Observations and Dynamics of a Congestion Control Algorithm: The Effects of TwoWay Traffic. In Proc. ACM SIGCOMM ’91, 1991356

QMR: a quasiminimal residual method for nonHermitian linear systems. Numer. Math, 1991354

Imagined Communities. 1991353

Retiming synchronous circuitry. Algorithmica, 1991346

OPlan: the Open Planning Architecture. Artificial Intelligence, 1991343

Rule Induction with CN2: Some Recent Improvements. In Machine Learning: Proc. of the Ffth European Conference, 15 I, 1991341

Understanding faulttolerant distributed systems. Comm. ACM, 1991336

Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 1991319

Measuring the information content of stock trades. Journal of Finance, 1991316

Critical values for cointegration tests. 1991311

Social networks and labor market outcomes: Toward an economic analysis. American Economic Review, 1991311

Fitting parameterized threedimensional models to images. IEEE Trans. Pattern Anal. Mach. Intell, 1991310

Functional programming with bananas, lenses, envelopes and barbed wire. Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, volume 523 of LNCS, 1991307

The Consumption of Stockholders and Nonstockholders. Journal of Financial Economics, 1991299

Visibility preprocessing for interactive walkthroughs. Computer Graphics (SIGGRAPH 91 Conference Proceedings, 1991297

Logic synthesis and optimization benchmarks user guide version. D == 6'h00  D == 6'hff) ? 1:0; endmodule module SumCompare2Bit(A,B,C,f) input[1:0] A,B,C; output f; reg f; always @ (A or B or C) f = (A+B == C) ? 1:0; endmodule module PriorityChecker6Bit(D,f) input[5:0] D, 1991294

The role of demandable debt in structuring optimal banking arrangements. American Economic Review, 1991290

Tolerating Latency Through SoftwareControlled Prefetching in SharedMemory Multiprocessors. 1: of Parallel and Distributed Computing, 1991287

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

Using program slicing in software maintenance. IEEE Transactions on Software Engineering, 1991284

Connections with multiple congested gateways in packetswitched networks part 1: oneway traffic. ACM Computer Communication Review, 1991284

Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab, 1991283

Cones of matrices and setfunctions and 01 optimization. SIAM Journal on Optimization, 1991272

A correspondence theory for terminological logics. In Proceedings of the 12th IJCAI, 1991271

Model Checking in Dense Realtime. 1991270

A schema for integrating concrete domains into concept languages. In Proc. of IJCAI91, 1991269

Transparent process migration: Design alternatives and the Sprite implementation. Software  Practice And Experience, 1991269

Artificial evolution for computer graphics. in Computer Graphics, 1991267

Semantic Foundation of Concurrent Constraint Programming. In Proc. of 18th ACM POPL. ACM, 1991264

Constraintbased automatic test data generation. Software Engineering, IEEE Transactions on, 1991260