| Optimal selection and sorting via dynamic programming. | 0 | 0.34 | 2013 |
| Further analysis of the remedian algorithm | 1 | 0.38 | 2013 |
| Service transparency considered harmful: letter to the editor | 0 | 0.34 | 2007 |
| An Efficient Algorithm for the Approximate Median Selection Problem | 18 | 1.03 | 2000 |
| The List Update Problem: Improved Bounds for the Counter Scheme | 0 | 0.34 | 1998 |
| Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms | 0 | 0.34 | 1998 |
| Matrix Transposition on a Mesh with Blocking Transmissions | 0 | 0.34 | 1998 |
| Efficient reorganization of binary search trees | 2 | 0.40 | 1994 |
| Asymptotic analysis of product-form distributions related to large interconnection networks | 1 | 0.36 | 1994 |
| On timeout for global deadlock detection in decentralized database systems | 10 | 2.81 | 1994 |
| Maximum size of a dynamic data structure: hashing with lazy deletion revisited | 2 | 0.77 | 1992 |
| On the optimality of the counter scheme for dynamic linear lists | 3 | 0.46 | 1991 |
| Self-organizing lists and independent references: a statistical synergy | 4 | 0.65 | 1991 |
| Exact and Asymptotic Analysis of Large Multiple Bus Multiprocessor Systems | 0 | 0.34 | 1990 |
| Padded lists revisited | 6 | 1.06 | 1987 |
| A Feedback-less Distributed Broadcast Algorithm for Multihop Radio Networks with Time-Varying Structure | 5 | 5.52 | 1987 |
| On the optimal control of two queues with server setup times and its analysis | 46 | 5.69 | 1987 |
| Packet delay under the golden ratio weighted TDM policy in a multiple-access channel | 27 | 2.60 | 1987 |
| Queueing systems with a procrastinating server | 7 | 1.10 | 1986 |
| A stochastic analysis of the NFD bin-packing algorithm | 2 | 0.42 | 1986 |
| The private workspace model feasibility and applications to 2PL performance improvements | 6 | 10.54 | 1985 |
| Analysis of interleaved storage via a constant-service queuing system with Markov-chain-driven input | 1 | 0.41 | 1984 |
| A probabilistic analysis of the Next-Fit bin packing algorithm | 9 | 1.04 | 1984 |
| Should The 2-Headed Disk Be Greedy - Yes, It Should | 34 | 7.90 | 1983 |
| The Working Set Size Distribution For The Markov-Chain Model Of Program Behavior | 3 | 0.42 | 1982 |
| On the Expected Performance of Scanning Disks | 21 | 5.45 | 1982 |
| On The Probability Of Intercepting A Pulsed Signal With Periodic Equipment | 0 | 0.34 | 1981 |
| A simple semaphore-queue management for multiprocessing systems | 0 | 0.34 | 1980 |
| Two-Dimensional Packing: Expected Performance of Simple Level Algorithms | 13 | 4.63 | 1980 |
| A Stochastic Model of Bin-Packing | 50 | 13.21 | 1980 |
| Disk scheduling: FCFS vs.SSTF revisited | 56 | 40.30 | 1980 |
| On the Working Set Size for the Markov Chain Model of Program Behaviour | 4 | 0.51 | 1979 |
| A generating-function analysis of multiprogramming queues | 1 | 0.36 | 1978 |
| On Scanning-Disks and the Analysis of their Steady State Behavior | 4 | 1.21 | 1977 |
| On Certain Output-Buffer Management Techniques—A Stochastic Model | 0 | 0.34 | 1977 |
| Multiprogramming with virtual memory—a queueing model | 0 | 0.34 | 1976 |
| On Scheduling Chains of Jobs on One Processor with Limited Preemption | 5 | 14.85 | 1975 |
| A Processor in Series with Demand-Interrupting Devices—A Stochastic Model | 1 | 0.47 | 1975 |
