Probabilistic analysis of algorithms: on computing methodologies for computer algorithms performance evaluation M Hofri Springer Science & Business Media, 2012 | 170 | 2012 |
Analysis of a stack algorithm for random multiple-access communication G Fayolle, P Flajolet, M Hofri, P Jacquet IEEE Transactions on Information Theory 31 (2), 244-254, 1985 | 164 | 1985 |
Disk scheduling: FCFS vs. SSTF revisited M Hofri Communications of the ACM 23 (11), 645-653, 1980 | 164 | 1980 |
On the optimal control of two queues with server setup times and its analysis M Hofri, KW Ross SIAM Journal on computing 16 (2), 399-420, 1987 | 152 | 1987 |
The coupon-collector problem revisited—a survey of engineering problems and computational methods A Boneh, M Hofri Stochastic Models 13 (1), 39-66, 1997 | 139 | 1997 |
A stochastic model of bin-packing EG Coffman Jr, K So, M Hofri, AC Yao Information and control 44 (2), 105-115, 1980 | 134 | 1980 |
On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel G Fayolle, P Flajolet, M Hofri Advances in applied probability 18 (2), 441-472, 1986 | 115 | 1986 |
Analysis of algorithms: Computational methods and mathematical tools M Hofri Oxford University Press, Inc., 1995 | 108 | 1995 |
On the expected performance of scanning disks EG Coffman, Jr, M Hofri SIAM Journal on Computing 11 (1), 60-70, 1982 | 75 | 1982 |
Packet delay under the golden ratio weighted TDM policy in a multiple-access channel M Hofri, Z Rosberg IEEE Transactions on Information Theory 33 (3), 341-349, 1987 | 72 | 1987 |
An efficient algorithm for the approximate median selection problem S Battiato, D Cantone, D Catalano, G Cincotti, M Hofri Italian Conference on Algorithms and Complexity, 226-238, 2000 | 54 | 2000 |
Queueing models of secondary storage devices EG Coffman, M Hofri queueing Systems 1, 129-168, 1986 | 54 | 1986 |
Should the two-headed disk be greedy?-Yes, it should M Hofri Information processing letters 16 (2), 83-85, 1983 | 50 | 1983 |
Two-dimensional packing: Expected performance of simple level algorithms M Hofri Information and Control 45 (1), 1-17, 1980 | 46 | 1980 |
The maximum of a random walk and its application to rectangle packing EG Coffman, P Flajolet, L Flatto, M Hofri Probability in the Engineering and Informational Sciences 12 (3), 373-386, 1998 | 43 | 1998 |
On scheduling chains of jobs on one processor with limited preemption J Bruno, M Hofri SIAM Journal on Computing 4 (4), 478-490, 1975 | 34 | 1975 |
Proof of a mutual exclusion algorithm—a classic example M Hofri ACM SIGOPS Operating Systems Review 24 (1), 18-22, 1990 | 31 | 1990 |
Scheduling stochastic jobs with a two-point distribution on two parallel machines EG Coffman, M Hofri, G Weiss Probability in the Engineering and Informational Sciences 3 (1), 89-116, 1989 | 31 | 1989 |
Queueing systems with a procrastinating server M Hofri ACM SIGMETRICS Performance Evaluation Review 14 (1), 245-253, 1986 | 31 | 1986 |
Stack algorithms for collision-detecting channels and their analysis: A limited survey M Hofri Technion, 1983 | 30* | 1983 |