A Multiprogramming Queue. - Igal Adiri; Micha Hofri; Micha Yadin (J. ACM, 1973)

A Processor in Series with Demand-Interrupting Devices - A Stochastic Model. - Micha Hofri; Micha Yadin (J. ACM, 1975)

On Scheduling Chains of Jobs on One Processor with Limited Preemption. - John L. Bruno; Micha Hofri (SIAM J. Comput., 1975)

Multiprogramming with virtual memory - a queueing model. - Micha Hofri; Micha Yadin (Inf. Sci., 1976)

On Scanning-Disks and the Analysis of their Steady State Behavior. - Edward G. Coffman Jr.; Micha Hofri (Performance, 1977)

On Certain Output-Buffer Management Techniques–A Stochastic Model. - Micha Hofri (J. ACM, 1977)

A generating-function analysis of multiprogramming queues. - Micha Hofri (Int. J. Parallel Program., 1978)

A Class of FIFO Queues Arising in Computer Systems. - Edward G. Coffman Jr.; Micha Hofri (Oper. Res., 1978)

On the Working Set Size for the Markov Chain Model of Program Behaviour. - Micha Hofri; Percy Tzelnic (Performance, 1979)

Disk Scheduling: FCFS vs. SSTF Revisited. - Micha Hofri (Commun. ACM, 1980)

A Simple Semaphore-Queue Management for Multiprocessing Systems. - Neta Amit; Micha Hofri (ACM SIGOPS Oper. Syst. Rev., 1980)

A Stochastic Model of Bin-Packing - Edward G. Coffman Jr.; Kimming So; Micha Hofri; Andrew Chi-Chih Yao (Inf. Control., 1980)

Two-Dimensional Packing: Expected Performance of Simple Level Algorithms - Micha Hofri (Inf. Control., 1980)

On the probability of intercepting a pulsed signal with periodic equipment. - Micha Hofri (Comput. Oper. Res., 1981)

On the Expected Performance of Scanning Disks. - Edward G. Coffman Jr.; Micha Hofri (SIAM J. Comput., 1982)

The Working Set Size Distribution for the Markov Chain Model of Program Behavior. - Micha Hofri; Percy Tzelnic (SIAM J. Comput., 1982)

Should the Two-Headed Disk be Greedy? - Yes, it Should. - Micha Hofri (Inf. Process. Lett., 1983)

Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input. - Micha Hofri (J. ACM, 1984)

A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm. - Micha Hofri (J. Algorithms, 1984)

The Private Workspace Model Feasibility and Applications to 2PL Performance Improvements. - Israel Gold; Oded Shmueli; Micha Hofri (VLDB, 1985)

Analysis of a stack algorithm for random multiple-access communication. - Guy Fayolle; Philippe Flajolet; Micha Hofri; Philippe Jacquet (IEEE Trans. Inf. Theory, 1985)

Queueing Systems with a Procrastinating Server. - Micha Hofri (SIGMETRICS, 1986)

A Stochastic Analysis of the NFD Bin-Packing Algorithm. - Micha Hofri; Sami Kamhi (J. Algorithms, 1986)

Queueing Models of Secondary Storage Devices. - Edward G. Coffman Jr.; Micha Hofri (Queueing Syst. Theory Appl., 1986)

Probabilistic Analysis of Algorithms - On Computing Methodologies for Computer Algorithms Performance Evaluation. - Micha Hofri (Springer, 1987)

A Feedback-less Distributed Broadcast Algorithm for Multihop Radio Networks with Time-Varying Structure. - Micha Hofri (Computer Performance and Reliability, 1987)

Padded Lists Revisited. - Micha Hofri; Alan G. Konheim (SIAM J. Comput., 1987)

On the Optimal Control of Two Queues with Server Setup Times and its Analysis. - Micha Hofri; Keith W. Ross (SIAM J. Comput., 1987)

Packet delay under the golden ratio weighted TDM policy in a multiple-access channel. - Micha Hofri; Zvi Rosberg (IEEE Trans. Inf. Theory, 1987)

Exact and Asymptotic Analysis of Large Multiple Bus Multiprocessor Systems. - Micha Hofri; Yaakov Kogan (Performance, 1990)

Proof of a Mutual Exclusion Algorithm - A 'Class'ic Example. - Micha Hofri (ACM SIGOPS Oper. Syst. Rev., 1990)

On the Optimality of the Counter Scheme for Dynamic Linear Lists. - Micha Hofri; Hadas Shachnai (Inf. Process. Lett., 1991)

Self-Organizing Lists and Independent References: A Statistical Synergy. - Micha Hofri; Hadas Shachnai (J. Algorithms, 1991)

Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited. - David J. Aldous; Micha Hofri; Wojciech Szpankowski (SIAM J. Comput., 1992)

On Timeout for Global Deadlock Detection in Decentralized Database Systems. - Micha Hofri (Inf. Process. Lett., 1994)

Asymptotic Analysis of Product-Form Distributions Related to Large Interconnection Networks. - Micha Hofri; Yaakov Kogan (Theor. Comput. Sci., 1994)

Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms. - Micha Hofri; Philippe Jacquet (Algorithmica, 1998)

The List Update Problem: Improved Bounds for the Counter Scheme. - Hadas Shachnai; Micha Hofri (Algorithmica, 1998)

Matrix Transposition on a Mesh with Blocking Transmissions. - Micha Hofri; David L. Thomson (Parallel Process. Lett., 1998)

An Efficient Algorithm for the Approximate Median Selection Problem. - Sebastiano Battiato; Domenico Cantone; Dario Catalano; Gianluca Cincotti; Micha Hofri (CIAC, 2000)

Efficient Reorganization of Binary Search Trees. - Micha Hofri; Hadas Shachnai (Algorithmica, 2001)

Service transparency considered harmful: letter to the editor. - Micha Hofri (ACM SIGOPS Oper. Syst. Rev., 2007)

Optimal selection and sorting via dynamic programming. - Micha Hofri (ACM J. Exp. Algorithmics, 2013)

Further analysis of the remedian algorithm. - Domenico Cantone; Micha Hofri (Theor. Comput. Sci., 2013)