| Quantitative System Performance: Computer System Analysis Using Computer Network Models EE Lazowska, J Zhorjan, GS Graham, KC Sevcik Englewood Cliffs, NJ: Prentice Hall, 1984 | 2061 | 1984 |
| The grid file: An adaptable, symmetric multikey file structure J Nievergelt, H Hinterberger, KC Sevcik ACM Transactions on Database Systems (TODS) 9 (1), 38-71, 1984 | 1918 | 1984 |
| Theory and practice in parallel job scheduling D Feitelson, L Rudolph, U Schwiegelshohn, K Sevcik, P Wong Job Scheduling Strategies for Parallel Processing, 1-34, 1997 | 732 | 1997 |
| Optimal histograms with quality guarantees HV Jagadish, N Koudas, S Muthukrishnan, V Poosala, K Sevcik, T Suel Proceedings of the International Conference on Very Large Data Bases, 275-286, 1998 | 635 | 1998 |
| The method of layers JA Rolia, KC Sevcik Software Engineering, IEEE Transactions on 21 (8), 689-700, 1995 | 574 | 1995 |
| LIMBO: Scalable clustering of categorical data P Andritsos, P Tsaparas, RJ Miller, KC Sevcik Advances in Database Technology-EDBT 2004, 123-146, 2004 | 388 | 2004 |
| The New Jersey data reduction report D Barbar'a, W DuMouchel, C Faloutsos, PJ Haas, JM Hellerstein, ... IEEE Data Engineering Bulletin, 1997 | 381 | 1997 |
| The distribution of queuing network states at input and output instants KC Sevcik, I Mitrani Journal of the ACM (JACM) 28 (2), 358-371, 1981 | 342 | 1981 |
| Characterizations of parallelism in applications and their use in scheduling KC Sevcik ACM SIGMETRICS Performance Evaluation Review 17 (1), 171-180, 1989 | 279 | 1989 |
| Size separation spatial join N Koudas, KC Sevcik ACM SIGMOD Record 26 (2), 324-335, 1997 | 205 | 1997 |
| Balanced job bound analysis of queueing networks J Zahorjan, KC Sevcik, DL Eager, B Galler Communications of the ACM 25 (2), 134-141, 1982 | 192 | 1982 |
| Achieving robustness in distributed database systems DL Eager, KC Sevcik ACM Transactions on Database Systems (TODS) 8 (3), 354-381, 1983 | 188 | 1983 |
| Application scheduling and processor allocation in multiprogrammed parallel processing systems KC Sevcik Performance Evaluation 19 (2), 107-140, 1994 | 177 | 1994 |
| Locality and loop scheduling on NUMA multiprocessors H Li, S Tandri, M Stumm, KC Sevcik Parallel Processing, 1993. ICPP 1993. International Conference on 2, 140-147, 1993 | 168 | 1993 |
| High dimensional similarity joins: Algorithms and performance evaluation N Koudas, KC Sevcik Knowledge and Data Engineering, IEEE Transactions on 12 (1), 3-18, 2000 | 137 | 2000 |
| Performance evaluation of a relational associative processor EA Ozkarahan, SA Schuster, KC Sevcik ACM Transactions on Database Systems (TODS) 2 (2), 175-195, 1977 | 127 | 1977 |
| Analysis of update synchronization for multiple copy data bases E Gelenbe, KC Sevcik IEEE Transactions on Computers 28 (10), 737-747, 1979 | 120 | 1979 |
| Improving approximations of aggregated queueing network subsystems University of Toronto. Computer Systems Research Group, KC Sevcik, ... | 112 | 1977 |
| Priority scheduling disciplines in queueing network models of computer systems University of Toronto. Computer Systems Research Group, KC Sevcik | 102 | 1977 |
| Parallel sorting by over partitioning H Li, KC Sevcik Proceedings of the sixth annual ACM symposium on Parallel algorithms and …, 1994 | 94 | 1994 |
Ed LazowskaBill & Melinda Gates Chair in Computer Science & Engineering, University of WashingtonVerifisert e-postadresse på cs.washington.edu
