 | 2007 |
|---|
| 40 |       | Micha Hofri:
Service transparency considered harmful: letter to the editor.
Operating Systems Review 41(4): 77 (2007) |
| 2001 |
|---|
| 39 | | Micha Hofri,
Hadas Shachnai:
Efficient Reorganization of Binary Search Trees.
Algorithmica 31(3): 378-402 (2001) |
| 2000 |
|---|
| 38 | | Sebastiano Battiato,
Domenico Cantone,
Dario Catalano,
Gianluca Cincotti,
Micha Hofri:
An Efficient Algorithm for the Approximate Median Selection Problem.
CIAC 2000: 226-238 |
| 1998 |
|---|
| 37 | | Micha Hofri,
Philippe Jacquet:
Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms.
Algorithmica 22(4): 516-528 (1998) |
| 36 | | Hadas Shachnai,
Micha Hofri:
The List Update Problem: Improved Bounds for the Counter Scheme.
Algorithmica 22(4): 650-659 (1998) |
| 35 |  | Micha Hofri,
David L. Thomson:
Matrix Transposition on a Mesh with Blocking Transmissions.
Parallel Processing Letters 8(4): 561-566 (1998) |
| 1994 |
|---|
| 34 | | Micha Hofri,
Hadas Shachnai:
Efficient Reorganization of Binary Search Trees.
CIAC 1994: 152-166 |
| 33 | | Micha Hofri:
On Timeout for Global Deadlock Detection in Decentralized Database Systems.
Inf. Process. Lett. 51(6): 295-302 (1994) |
| 32 | | Micha Hofri,
Yaakov Kogan:
Asymptotic Analysis of Product-Form Distributions Related to Large Interconnection Networks.
Theor. Comput. Sci. 125(1): 61-90 (1994) |
| 1992 |
|---|
| 31 | | David Aldous,
Micha Hofri,
Wojciech Szpankowski:
Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited.
SIAM J. Comput. 21(4): 713-732 (1992) |
| 1991 |
|---|
| 30 | | Micha Hofri,
Hadas Shachnai:
On the Optimality of the Counter Scheme for Dynamic Linear Lists.
Inf. Process. Lett. 37(3): 175-179 (1991) |
| 29 | | Micha Hofri,
Hadas Shachnai:
Self-Organizing Lists and Independent References: A Statistical Synergy.
J. Algorithms 12(4): 533-555 (1991) |
| 1990 |
|---|
| 28 | | Micha Hofri,
Yaakov Kogan:
Exact and Asymptotic Analysis of Large Multiple Bus Multiprocessor Systems.
Performance 1990: 373-389 |
| 27 | | Micha Hofri:
Proof of a Mutual Exclusion Algorithm - A 'Class'ic Example.
Operating Systems Review 24(1): 18-22 (1990) |
| 1987 |
|---|
| 26 | | Micha Hofri:
A Feedback-less Distributed Broadcast Algorithm for Multihop Radio Networks with Time-Varying Structure.
Computer Performance and Reliability 1987: 353-368 |
| 25 | | Micha Hofri,
Zvi Rosberg:
Packet delay under the golden ratio weighted TDM policy in a multiple-access channel.
IEEE Transactions on Information Theory 33(3): 341-349 (1987) |
| 24 | | Micha Hofri,
Keith W. Ross:
On the Optimal Control of Two Queues with Server Setup Times and its Analysis.
SIAM J. Comput. 16(2): 399-420 (1987) |
| 23 | | Micha Hofri,
Alan G. Konheim:
Padded Lists Revisited.
SIAM J. Comput. 16(6): 1073-1114 (1987) |
| 1986 |
|---|
| 22 | | Micha Hofri:
Queueing Systems with a Procrastinating Server.
SIGMETRICS 1986: 245-253 |
| 21 | | Micha Hofri,
Sami Kamhi:
A Stochastic Analysis of the NFD Bin-Packing Algorithm.
J. Algorithms 7(4): 489-509 (1986) |
| 20 | | Edward G. Coffman Jr.,
Micha Hofri:
Queueing Models of Secondary Storage Devices.
Queueing Syst. 1(2): 129-168 (1986) |
| 1985 |
|---|
| 19 | | Israel Gold,
Oded Shmueli,
Micha Hofri:
The Private Workspace Model Feasibility and Applications to 2PL Performance Improvements.
VLDB 1985: 192-208 |
| 18 | | Guy Fayolle,
Philippe Flajolet,
Micha Hofri,
Philippe Jacquet:
Analysis of a stack algorithm for random multiple-access communication.
IEEE Transactions on Information Theory 31(2): 244-254 (1985) |
| 1984 |
|---|
| 17 | | Micha Hofri:
Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input.
J. ACM 31(3): 628-648 (1984) |
| 16 | | Micha Hofri:
A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm.
J. Algorithms 5(4): 547-556 (1984) |
| 1983 |
|---|
| 15 | | Micha Hofri:
Should the Two-Headed Disk be Greedy? - Yes, it Should.
Inf. Process. Lett. 16(2): 83-85 (1983) |
| 1982 |
|---|
| 14 | | Edward G. Coffman Jr.,
Micha Hofri:
On the Expected Performance of Scanning Disks.
SIAM J. Comput. 11(1): 60-70 (1982) |
| 13 | | Micha Hofri,
Percy Tzelnic:
The Working Set Size Distribution for the Markov Chain Model of Program Behavior.
SIAM J. Comput. 11(3): 453-466 (1982) |
| 1981 |
|---|
| 12 | | Micha Hofri:
On the probability of intercepting a pulsed signal with periodic equipment.
Computers & OR 8(1): 49-55 (1981) |
| 1980 |
|---|
| 11 | | Micha Hofri:
Disk Scheduling: FCFS vs. SSTF Revisited.
Commun. ACM 23(11): 645-653 (1980) |
| 10 | | Edward G. Coffman Jr.,
Kimming So,
Micha Hofri,
Andrew Chi-Chih Yao:
A Stochastic Model of Bin-Packing
Information and Control 44(2): 105-115 (1980) |
| 9 | | Micha Hofri:
Two-Dimensional Packing: Expected Performance of Simple Level Algorithms
Information and Control 45(1): 1-17 (1980) |
| 8 | | Neta Amit,
Micha Hofri:
A Simple Semaphore-Queue Management for Multiprocessing Systems.
Operating Systems Review 14(3): 13-15 (1980) |
| 1979 |
|---|
| 7 | | Micha Hofri,
Percy Tzelnic:
On the Working Set Size for the Markov Chain Model of Program Behaviour.
Performance 1979: 393-405 |
| 1977 |
|---|
| 6 | | Edward G. Coffman Jr.,
Micha Hofri:
On Scanning-Disks and the Analysis of their Steady State Behavior.
Performance 1977: 251-263 |
| 5 | | Micha Hofri:
On Certain Output-Buffer Management Techniques--A Stochastic Model.
J. ACM 24(2): 241-249 (1977) |
| 1976 |
|---|
| 4 | | Micha Hofri,
Micha Yadin:
Multiprogramming with virtual memory - a queueing model.
Inf. Sci. 11(3): 187-221 (1976) |
| 1975 |
|---|
| 3 | | Micha Hofri,
Micha Yadin:
A Processor in Series with Demand-Interrupting Devices - A Stochastic Model.
J. ACM 22(2): 270-290 (1975) |
| 2 | | John L. Bruno,
Micha Hofri:
On Scheduling Chains of Jobs on One Processor with Limited Preemption.
SIAM J. Comput. 4(4): 478-490 (1975) |
| 1973 |
|---|
| 1 | | Igal Adiri,
Micha Hofri,
Micha Yadin:
A Multiprogramming Queue.
J. ACM 20(4): 589-603 (1973) |
