MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

Most Cited Computer Science Citations generated from documents in the CiteSeerX database as of February 26, 2008. 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.

Next 100 View Next Page
  1. 5236 T H Cormen, C E Leiserson, R L Rivest. Introduction to Algorithms. 1990.
  2. 4382 M Garey, D Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979.
  3. 4184 D Goldberg. Genetic Algorithms. in Search, Optimization, and Machine Learning, 1989.
  4. 4064 J Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. 1988.
  5. 3756 A Dempster, N Laird, D Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 1977.
  6. 3738 V Vapnik. The Nature of Statistical Learning Theory. 1995.
  7. 3660 T Cover, J Thomas. Elements of Information Theory. 1991.
  8. 3005 J R Quinlan. C4.5: Programs for Machine Learning. 1993.
  9. 2863 R O Duda, P E Hart. Pattern Classification and Scene Analysis. 1973.
  10. 2675 R Milner. Communication and Concurrency. 1989.
  11. 2643 C A R Hoare. Communicating Sequential Processes. 1985.
  12. 2605 E Gamma, R Helm, R Johnson, J Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley Professional Computing Series. 1995.
  13. 2530 C M Bishop. Neural Networks for Pattern Recognition. 1995.
  14. 2506 J Quinlan. Simplifying Decision Trees. International Journal of Man-Machine Studies, 1987.
  15. 2486 J Hopcroft, J D Ullman. Introduction to Automata Theory, Languages and Computation. 1979.
  16. 2393 R Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 1986.
  17. 2310 L Breiman, J Friedman, R Olshen, C Stone. Classification and Regression Trees. 1984.
  18. 2216 D E Rumelhart, J E Hinton, R J Williams. internal representations by error propagation. In, 1986.
  19. 2132 C L Liu, J W Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 1973.
  20. 2102 D A Patterson, J L Hennessy. Computer Architecture: A Quantitative Approach, Second Edition. 1996.
  21. 2096 Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, 1989.
  22. 2030 Rodney A Brooks. A robust layered control system for a mobile robot. A. I. Memo 864, MIT Artificial Intelligence Laboratory, 1985.
  23. 2021 S Kirkpatrick, C D Gelatt, M P Vecchi. Optimization By Simulated Annealing. American Association for Advancement of Science, 1983.
  24. 1977 G Salton, M J McGill. Introduction to Modern Information Retrieval. 1983.
  25. 1964 C E Shannon. A mathematical theory of communication. Bell System Technical Journal, 1948.
  26. 1917 A V Aho, J E Hopcroft, J D Ullman. The Design and Analysis of Computer Algorithms. 1974.
  27. 1911 Abhay K Parekh, Robert G Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking, 1993.
  28. 1909 V Jacobson. Congestion avoidance and control. In Proceedings of the SIGCOMM ’88 Symposium, 1988.
  29. 1891 I Stoica, R Morris, D Karger, M F Kaashoek, H Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001.
  30. 1836 L R Rabiner. A tutorial on hidden markov models and selected applications in speech recognition. Proc. of the IEEE, 1989.
  31. 1794 E K C Blake, C Merz. UCI repository of machine learning databases http://www.ics.uci.edu/- ∼mlearn/mlrepository.html. 2003.
  32. 1779 R Milner, M Tofte, R Harper, D MacQueen. The Definition of Standard ML. 1997.
  33. 1751 R A Horn, C R Johnson. Topics in Matrix Analysis. 1991.
  34. 1744 Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, 1989.
  35. 1737 J W Lloyd. Foundations of Logic Programming. 1987.
  36. 1717 Ronald L Rivest, Adi Shamir, Leonard M Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 1978.
  37. 1670 Czesław Byliński. Functions and their basic properties. Journal of Formalized Mathematics, 1989.
  38. 1658 T Kohonen. Self-Organizing Maps. 2001.
  39. 1645 S Floyd, V Jacobson. Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking, 1993.
  40. 1586 M Kass, A Witkin, D Terzopoulos. Snakes: Active Contour Models. Int. Journal of Computer Vision, 1988.
  41. 1554 James Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 1983.
  42. 1547 A Guttman. R-trees: A dynamic index structure for spatial searching. In B. Yormark (Ed.), SIGMOD’84, Proceedings of Annual Meeting, 1984.
  43. 1545 Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, 1989.
  44. 1527 John R Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. 1992.
  45. 1521 W Diffie, M E Hellman. New directions in Cryptography. IEEE Transactions on Information Theory, 1976.
  46. 1509 D Harel. StateCharts: a visual formalism for complex systems. Science ofProgramming, 1987.
  47. 1496 R E Fikes, N J Nilsson. strips, a new approach to the application of theorem proving to problem solving. Artificial Intelligence, 1971.
  48. 1492 J C Latombe. Robot Motion Planning. 1991.
  49. 1454 Christos H Papadimitriou. Computational Complexity. 1994.
  50. 1450 K Fukunaga. Introduction to Statistical Pattern Recognition, 2nd Ed. 1990.
  51. 1445 I Daubechies. Orthonormal bases of compactly supported wavelets. Communications on Pure and Applied Mathematics, 1988.
  52. 1431 J Rumbaugh, M H Blaha, W Premerlani, F Eddy, W Lorenson. Object-Oriented Modeling and Design. 1991.
  53. 1427 Leslie G Valiant. A theory of the learnable. Communications of the ACM, 1984.
  54. 1421 J Hertz, A Krogh, R G Palmer. Introduction to the Theory of Neural Computation. Allan M. Wylde, 1991.
  55. 1413 M Turk, A Pentland. Eigenfaces for recognition. J. Cognitive Neurosci, 1991.
  56. 1389 S G Mallat. A theory for multiresolution signal decomposition: the wavelet representation. IEEE Trans. Pattn. Anal. Mach. lntell, 1989.
  57. 1374 S L Peyton Jones, P Wadler. Imperative functional programming. In POPL, 1993.
  58. 1360 R T Rockafellar. Convex Analysis. 1970.
  59. 1356 S Geman, D Geman. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Machine Intel, 1984.
  60. 1340 P A Bernstein, V Hadzilacos, Goodman. N.: Concurrency Control and Recovery in Database Systems. 1987.
  61. 1339 R Bellman. Dynamic Programming. 1957.
  62. 1326 Z Manna, A Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. 1991.
  63. 1322 Czesław Byliński. Functions from a set to a set. Journal of Formalized Mathematics, 1989.
  64. 1319 P Billingsley. Convergence of Probability Measures. 1999.
  65. 1317 J H Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, 1975.
  66. 1287 J Canny. A Computational Approach to Edge Detection. IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol PAMI-8, 1986.
  67. 1282 J Gosling, B Joy, G Steele. The Java Language Specification. 1996.
  68. 1269 H Schulzrinne, S Casner, R Frederick, V Jacobson. RTP: A Transport Protocol for Real-Time Applications. IETF RFC 1889, 1996.
  69. 1268 R Alur, D Dill. A theory of timed automata. Theoretical Computer Science B, 1994.
  70. 1247 F T Leighton. Introduction to Parallel Algorithms and Architectures: Arrays. 1992.
  71. 1244 B Stroustrup. The C++ Programming Language. 1997.
  72. 1244 N Alon, J H Spencer. The probabilistic method. 1992.
  73. 1238 L Breiman. Bagging predictors. Machine Learning, 1996.
  74. 1233 S C Deerwester, S Dumais, T Landauer, G Furnas, R Harshman. Indexing by Latent Semantic Analysis. JASIS, 1990.
  75. 1232 D Knuth. The Art of Computer Programming. 1973.
  76. 1231 J McCarthy, P Hayes. Some Philosophical Problems from the Standpoint of Artificial Intelligence. Machine Intelligence 4, 1969.
  77. 1222 Richard S Sutton, Andrew G Barto. Reinforcement Learning: An Introduction. 0.
  78. 1219 A Menezes, P Van Oorschot, S Vanstone. Handbook of Applied Cryptography. 1997.
  79. 1213 J K Ousterhout. Tcl and the Tk Toolkit. 1994.
  80. 1203 E M Clarke, O Grumberg, D Peled. Model Checking. 1999.
  81. 1200 F P Preparata, M I Shamos. Computational Geometry: An Introduction. 1985.
  82. 1198 R Agrawal, R Srikant. Fast algorithms for mining association rules. In Proc. of Int. conf. Very Large DataBases (VLDB’94, 1994.
  83. 1195 S J Russell, P Norvig. Artificial Intelligence: A Modern Approach (2nd Ed. 2002.
  84. 1181 Z Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs, 3rd Revised and Extended Exition. 1999.
  85. 1171 Grzegorz Bancerek. The ordinal numbers. Journal of Formalized Mathematics, 1989.
  86. 1159 D Bertsekas, R Gallager. Data Networks. 1987.
  87. 1156 T von Eicken, D E Culler, S C Goldstein, K E Schauser. Active Messages: A Mechanism for Integrated Communication and Computation. Proc. of the 19th Int. Symp. on Computer Architecture, 1992.
  88. 1156 R Agrawal, T Imielinski, A Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, 1993.
  89. 1147 M Garey, D Johnson. Computers and Intractability: A Guide to the Theory of NPCompleteness. 1979.
  90. 1146 P Cousot, R Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Symp. on Princ. of Prog. Lang, 1977.
  91. 1140 W E Leland, M S Taqq, W Willinger, D V Wilson. On the self-similar nature of Ethernet traffic. In Proc. of ACM SIGCOMM ’93, 1993.
  92. 1135 Mitchell P Marcus, Beatrice Santori, Mary Ann Marcinkiewicz. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 1993.
  93. 1126 R Reiter. A logic for default reasoning. Readings in Nonmonotonic Reasoning, 1980.
  94. 1126 J Kleinberg. Authoritive sources in a hyperlinked environment. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.
  95. 1123 R Motwani, P Raghavan. Randomized Algorithms. 1995.
  96. 1117 K L McMillan. Symbolic Model Checking. 1992.
  97. 1114 M Gelfond, V Lifschitz. The stable model semantics of logic programming. In Proc. Fifth Int. Conference on Logic Programming, 1988.
  98. 1109 S H Muggleton. Inductive Logic Programming. 1992.
  99. 1102 S Brin, L Page. The Anatomy of a Large-Scale Hypertextual Web Search Engine. In Proceedings of the 7th International World Wide Web Conference, 1998.
  100. 1101 A K Jain, R C. Dubes. Algorithms for Clustering Data. 1988.
Next 100 View Next Page