MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

Most Cited Computer Science Articles 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. 4184 D Goldberg. Genetic Algorithms. in Search, Optimization, and Machine Learning, , 1989.
  2. 2506 J Quinlan. Simplifying Decision Trees. International Journal of Man-Machine Studies, , 1987.
  3. 2393 R Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, , 1986.
  4. 2096 Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, , 1989.
  5. 2021 S Kirkpatrick, C D Gelatt, M P Vecchi. Optimization By Simulated Annealing. American Association for Advancement of Science, , 1983.
  6. 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.
  7. 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.
  8. 1744 Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, , 1989.
  9. 1717 Ronald L Rivest, Adi Shamir, Leonard M Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, , 1978.
  10. 1670 Czesław Byliński. Functions and their basic properties. Journal of Formalized Mathematics, , 1989.
  11. 1645 S Floyd, V Jacobson. Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking, , 1993.
  12. 1547 A Guttman. R-trees: A dynamic index structure for spatial searching. In B. Yormark (Ed.), SIGMOD’84, Proceedings of Annual Meeting, , 1984.
  13. 1545 Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, , 1989.
  14. 1454 Christos H Papadimitriou. Computational Complexity. , 1994.
  15. 1389 S G Mallat. A theory for multiresolution signal decomposition: the wavelet representation. IEEE Trans. Pattn. Anal. Mach. lntell, , 1989.
  16. 1374 S L Peyton Jones, P Wadler. Imperative functional programming. In POPL, , 1993.
  17. 1322 Czesław Byliński. Functions from a set to a set. Journal of Formalized Mathematics, , 1989.
  18. 1268 R Alur, D Dill. A theory of timed automata. Theoretical Computer Science B, , 1994.
  19. 1244 B Stroustrup. The C++ Programming Language. , 1997.
  20. 1238 L Breiman. Bagging predictors. Machine Learning, , 1996.
  21. 1233 S C Deerwester, S Dumais, T Landauer, G Furnas, R Harshman. Indexing by Latent Semantic Analysis. JASIS, , 1990.
  22. 1213 J K Ousterhout. Tcl and the Tk Toolkit. , 1994.
  23. 1198 R Agrawal, R Srikant. Fast algorithms for mining association rules. In Proc. of Int. conf. Very Large DataBases (VLDB’94, , 1994.
  24. 1171 Grzegorz Bancerek. The ordinal numbers. Journal of Formalized Mathematics, , 1989.
  25. 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.
  26. 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.
  27. 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.
  28. 1126 J Kleinberg. Authoritive sources in a hyperlinked environment. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, , 1998.
  29. 1114 M Gelfond, V Lifschitz. The stable model semantics of logic programming. In Proc. Fifth Int. Conference on Logic Programming, , 1988.
  30. 1109 S H Muggleton. Inductive Logic Programming. , 1992.
  31. 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.
  32. 1101 J L Elman. Finding structure in time. Cog. Sci, , 1990.
  33. 1096 Michael Burrows, Martín Abadi, Roger Needham. A Logic of Authentication. ACM. Transactions in Computer Systems, , 1990.
  34. 1081 S E Deering, D R Cheriton. Multicast routing in datagram internetworks and extended lans. ACM Trans. Comput. Syst, , 1990.
  35. 1053 S Ratnasamy, P Francis, M Handley, R Karp, S Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, , 2001.
  36. 1016 S Floyd, V Jacobson, C Liu, S McCanne, L Zhang. A reliable multicast framework for light-weight sessions and application level framing. IEEE/ACM Transactions on Networking, , 1997.
  37. 1004 Brian W Kernighan, Dennis M Ritchie. The C Programming Language. , 1988.
  38. 998 I Foster, C Kesselman. Globus: A Metacomputing Infrastructure Toolkit. International Journal of Supercomputer Applications, , 1997.
  39. 984 A Birrell, B Nelson. Implementing remote procedure calls. ACM Transactions on Computer Systems, , 1984.
  40. 971 D Burger, T Austin. The SimpleScalar Tool Set, Version 2.0. , 1997.
  41. 970 L Zhang, S Deering, D Estrin, S Shenker, D Zappala. RSVP: A New Resource ReSerVation Protocol. IEEE Network, , 1993.
  42. 946 M Bellare, P Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. ACM CCS 1993, ACM, , 1993.
  43. 939 Grzegorz Bancerek. The fundamental properties of natural numbers. Journal of Formalized Mathematics, , 1989.
  44. 917 D B Johnson, D A Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, , 1996.
  45. 882 Richard S Sutton. Learning to predict by the methods of temporal differences. Machine Learning, , 1988.
  46. 878 A Shamir. How to share a secret. Comm. ACM, , 1979.
  47. 849 Y Freund, R E Schapire. Experiments with a New Boosting Algorithm. Proceedings of the Thirteenth International Conference on Machine Learning, , 1996.
  48. 836 J Padhye, V Firoiu, D Towsley, J Kurose. Modeling TCP Throughput: A Simple Model and its Empirical Validation. in Proceedings of ACM SIGCOMM’98, , 1998.
  49. 834 J H Howard, M L Kazar, S G Menees, D A Nichols, M Satyanarayanan, R N Sidebotham, M J West. Scale and Performance in a Distributed File System. ACM Transactions on Computer Systems, , 1988.
  50. 828 T Finin, Y Labrou, J Mayfield. KQML as an Agent Communication Language. in Software Agents, , 1995.
  51. 821 R Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, , 1978.
  52. 819 J J Kistler, M Satyanarayanan. Disconnected Operation in the Coda File System. ACM Transactions on Computer Systems, , 1992.
  53. 814 D W Aha, D Kibler, M K Albert. Instance-based learning algorithms. Machine Learning, , 1991.
  54. 812 George Necula. Proof-carrying code. In TwentyFourth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, , 1997.
  55. 810 G J Holzmann. The model checker SPIN. Software Engineering, , 1997.
  56. 806 C Intanagonwiwat, R Govindan, D Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proc. of MOBICOM, , 2000.
  57. 799 L P Kaelbling, M L Littman, A W Moore. Reinforcement Learning: A Survey. Journal of Artificial Intelligence Research, , 1996.
  58. 797 K M Chandy, L Lamport. Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computer Systems, , 1985.
  59. 793 B D Lucas, T Kanade. An iterative image registration technique with an application to stereo vision. In International Joint Conference on Artificial Intelligence, , 1981.
  60. 785 V Sunderam. PVM: A Framework for Parallel Distributed Computing”, Concurrency: Practice. and Experience, , 1990.
  61. 778 C Burges. A Tutorial on Support Vector Machines for Pattern Recognition. , 1998.
  62. 770 G Wiederhold. Mediators in the Architecture of future Information Systems. IEEE Computer, , 1992.
  63. 767 M Crovella, A Bestavros. Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. In SIGMETRICS, , 1996.
  64. 767 T Joachims. Text categorization with support vector machines: Learning with many relevant features. In Proceedings of ECML-98, 10th European Conference on Machine Learning, , 1998.
  65. 764 N Dershowitz, J-P Jouannaud. Rewrite Systems. Handbook of Theoretical Computer Science, chapter 6, , 1990.
  66. 760 Leslie Lamport, Robert Shostak, Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS, , 1982.
  67. 748 R Dechter, A Dechter, J Pearl. Optimization in constraint networks. In In uence Diagrams, Belief Nets and Decision Analysis, , 1990.
  68. 742 R E Bryant. Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Computing Surveys, , 1992.
  69. 731 M E Wolf, M S Lam. A data locality optimizing algorithm. In Proc. of theSIGPLAN '91 Symp. on Programming Language Design and Implementation, , 1991.
  70. 728 A Blum, M Furst. Fast planning through planning graph analysis. Artificial Intelligence, , 1997.
  71. 724 L Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, , 1994.
  72. 724 Krzysztof Hryniewiecki. Basic properties of real numbers. Journal of Formalized Mathematics, , 1989.
  73. 711 P GUPTA, A. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proceedings of the ZnternatLonal Symposium on Computer Architecture, , 1990.
  74. 708 K Church. A stochastic parts program and noun phrase parser for unrestricted text. In Second Conference on Applied Natural Language Processing, , 1988.
  75. 704 G Kiczales, J Lamping, A Menhdhekar, C Maeda, C Lopes, J Loingtier, J Irwin. Aspect-oriented programming. In Proceedings European Conference on Object-Oriented Programming, , 1997.
  76. 691 B Schölkopf, A Smola. Learning with Kernels. , 2002.
  77. 691 D Ferrari, D Verma. A Scheme for Real-time Channel Establishment in Wide Area Networks. IEEE Journal on Selected Areas in Communications, , 1990.
  78. 689 S Goldwasser, S Micali, R Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, , 1988.
  79. 688 M Rosenblum, J K Ousterhout. The Design and Implementation of a Log-Structured File System. Proceedings of the 13th ACM Symposium on Operating Systems Principles, , 1991.
  80. 687 A Van Gelder, K A Ross, J S Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the ACM, , 1991.
  81. 683 J Shi, J Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, , 0.
  82. 676 A Srivastava, A Eustace. ATOM: A system for building customized program analysis tools. In Proceedings of the SIGPLAN ‘94 Conference on Programming Language Design and Implementation, , 1994.
  83. 670 T Chandra, S Toueg. Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, , 1996.
  84. 667 J R Koza. Genetic Programming. , 1992.
  85. 666 M Wooldridge, N R Jennings. Intelligent Agents: Theory and Practice. Knowledge Engineering Review, , 1995.
  86. 661 N C Hutchinson, L L Peterson. The x-Kernel: An Architecture for Implementing Network Protocols. IEEE Transactions on Software Engineering, , 1991.
  87. 660 R A Kowalski. Predicate logic as programming language. Proc. IFIP Congress, , 1974.
  88. 659 B Y Zhao, J D Kubiatowicz, A D Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. , 2001.
  89. 656 R Brooks. Intelligence Without Reason. Computers and Thoughts - IJCAI 91, , 1991.
  90. 655 J Broch, D Maltz, D Johnson, Y Hu, J Jetcheva. A performance comparison of multi-hop wireless ad-hoc network routing protocols. Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’98), ACM, , 1998.
  91. 654 T Hastie, R Tibshirani. Generalized Additive Models. , 1990.
  92. 642 J Hill, R Szewczyk, A Woo, S Hollar, D Culler, K Pister. System architecture directions for networked sensors. In Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, , 2000.
  93. 642 V Paxson. End-to-end Internet packet dynamics. IEEE/ACM Transactions on Networking, , 1999.
  94. 641 P J Burt, E H Adelson. The laplacian pyramid as a compact image code. IEEE Trans on Communications, , 1983.
  95. 639 J B Carter, J K Bennett, W Zwaenepoel. Implementation and Performance of Munin. Proc. 13th ACM Symp. on Operating System Principles, Pacific Grove, CA, , 1991.
  96. 637 J Ziv, A Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, , 1977.
  97. 635 Steven McCanne, Van Jacobson, Martin Vetterli. Receiver-driven layered multicast. In Proceedings of ACM Sigcomm, , 1996.
  98. 633 P Gupta, P R Kumar. The capacity of wireless networks. IEEE Trans. on Information Theory, , 2000.
  99. 632 A Y Levy, A Rajaraman, J J Ordille. Querying heterogeneous information sources using source descriptions. In Proc. of the 1996 Conference on Very Large Data Bases (VLDB’96, , 1996.
  100. 630 V Paxson, S Floyd. Wide-area traffic: The failure of poisson modeling. IEEE/ACM Transactions on Networking, , 1995.
Next 100 View Next Page