default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMicha Hofri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1987
[b1]Micha Hofri:
Probabilistic Analysis of Algorithms - On Computing Methodologies for Computer Algorithms Performance Evaluation. Texts and Monographs in Computer Science, Springer 1987, ISBN 978-3-540-96578-7, pp. I-XV, 1-240
Journal Articles
- 2013
- [j36]Micha Hofri:
Optimal selection and sorting via dynamic programming. ACM J. Exp. Algorithmics 18 (2013) - [j35]Domenico Cantone
, Micha Hofri:
Further analysis of the remedian algorithm. Theor. Comput. Sci. 495: 1-16 (2013) - 2007
- [j34]Micha Hofri:
Service transparency considered harmful: letter to the editor. ACM SIGOPS Oper. Syst. Rev. 41(4): 77 (2007) - 2001
- [j33]Micha Hofri, Hadas Shachnai:
Efficient Reorganization of Binary Search Trees. Algorithmica 31(3): 378-402 (2001) - 1998
- [j32]Micha Hofri, Philippe Jacquet:
Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms. Algorithmica 22(4): 516-528 (1998) - [j31]Hadas Shachnai, Micha Hofri:
The List Update Problem: Improved Bounds for the Counter Scheme. Algorithmica 22(4): 650-659 (1998) - [j30]Micha Hofri, David L. Thomson:
Matrix Transposition on a Mesh with Blocking Transmissions. Parallel Process. Lett. 8(4): 561-566 (1998) - 1994
- [j29]Micha Hofri:
On Timeout for Global Deadlock Detection in Decentralized Database Systems. Inf. Process. Lett. 51(6): 295-302 (1994) - [j28]Micha Hofri, Yaakov Kogan:
Asymptotic Analysis of Product-Form Distributions Related to Large Interconnection Networks. Theor. Comput. Sci. 125(1): 61-90 (1994) - 1992
- [j27]David J. 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
- [j26]Micha Hofri, Hadas Shachnai:
On the Optimality of the Counter Scheme for Dynamic Linear Lists. Inf. Process. Lett. 37(3): 175-179 (1991) - [j25]Micha Hofri, Hadas Shachnai:
Self-Organizing Lists and Independent References: A Statistical Synergy. J. Algorithms 12(4): 533-555 (1991) - 1990
- [j24]Micha Hofri:
Proof of a Mutual Exclusion Algorithm - A 'Class'ic Example. ACM SIGOPS Oper. Syst. Rev. 24(1): 18-22 (1990) - 1987
- [j23]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) - [j22]Micha Hofri, Alan G. Konheim:
Padded Lists Revisited. SIAM J. Comput. 16(6): 1073-1114 (1987) - [j21]Micha Hofri, Zvi Rosberg:
Packet delay under the golden ratio weighted TDM policy in a multiple-access channel. IEEE Trans. Inf. Theory 33(3): 341-349 (1987) - 1986
- [j20]Micha Hofri, Sami Kamhi:
A Stochastic Analysis of the NFD Bin-Packing Algorithm. J. Algorithms 7(4): 489-509 (1986) - [j19]Edward G. Coffman Jr., Micha Hofri:
Queueing Models of Secondary Storage Devices. Queueing Syst. Theory Appl. 1(2): 129-168 (1986) - 1985
- [j18]Guy Fayolle, Philippe Flajolet, Micha Hofri, Philippe Jacquet:
Analysis of a stack algorithm for random multiple-access communication. IEEE Trans. Inf. Theory 31(2): 244-254 (1985) - 1984
- [j17]Micha Hofri:
Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input. J. ACM 31(3): 628-648 (1984) - [j16]Micha Hofri:
A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm. J. Algorithms 5(4): 547-556 (1984) - 1983
- [j15]Micha Hofri:
Should the Two-Headed Disk be Greedy? - Yes, it Should. Inf. Process. Lett. 16(2): 83-85 (1983) - 1982
- [j14]Edward G. Coffman Jr., Micha Hofri:
On the Expected Performance of Scanning Disks. SIAM J. Comput. 11(1): 60-70 (1982) - [j13]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
- [j12]Micha Hofri:
On the probability of intercepting a pulsed signal with periodic equipment. Comput. Oper. Res. 8(1): 49-55 (1981) - 1980
- [j11]Micha Hofri:
Disk Scheduling: FCFS vs. SSTF Revisited. Commun. ACM 23(11): 645-653 (1980) - [j10]Edward G. Coffman Jr., Kimming So, Micha Hofri, Andrew Chi-Chih Yao:
A Stochastic Model of Bin-Packing. Inf. Control. 44(2): 105-115 (1980) - [j9]Micha Hofri:
Two-Dimensional Packing: Expected Performance of Simple Level Algorithms. Inf. Control. 45(1): 1-17 (1980) - [j8]Neta Amit, Micha Hofri:
A Simple Semaphore-Queue Management for Multiprocessing Systems. ACM SIGOPS Oper. Syst. Rev. 14(3): 13-15 (1980) - 1978
- [j7]Micha Hofri:
A generating-function analysis of multiprogramming queues. Int. J. Parallel Program. 7(2): 121-155 (1978) - [j6]Edward G. Coffman Jr., Micha Hofri:
A Class of FIFO Queues Arising in Computer Systems. Oper. Res. 26(5): 864-880 (1978) - 1977
- [j5]Micha Hofri:
On Certain Output-Buffer Management Techniques--A Stochastic Model. J. ACM 24(2): 241-249 (1977) - 1976
- [j4]Micha Hofri, Micha Yadin:
Multiprogramming with virtual memory - a queueing model. Inf. Sci. 11(3): 187-221 (1976) - 1975
- [j3]Micha Hofri, Micha Yadin:
A Processor in Series with Demand-Interrupting Devices - A Stochastic Model. J. ACM 22(2): 270-290 (1975) - [j2]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
- [j1]Igal Adiri, Micha Hofri, Micha Yadin:
A Multiprogramming Queue. J. ACM 20(4): 589-603 (1973)
Conference and Workshop Papers
- 2000
- [c8]Sebastiano Battiato, Domenico Cantone, Dario Catalano, Gianluca Cincotti, Micha Hofri:
An Efficient Algorithm for the Approximate Median Selection Problem. CIAC 2000: 226-238 - 1994
- [c7]Micha Hofri, Hadas Shachnai:
Efficient Reorganization of Binary Search Trees. CIAC 1994: 152-166 - 1990
- [c6]Micha Hofri, Yaakov Kogan:
Exact and Asymptotic Analysis of Large Multiple Bus Multiprocessor Systems. Performance 1990: 373-389 - 1987
- [c5]Micha Hofri:
A Feedback-less Distributed Broadcast Algorithm for Multihop Radio Networks with Time-Varying Structure. Computer Performance and Reliability 1987: 353-368 - 1986
- [c4]Micha Hofri:
Queueing Systems with a Procrastinating Server. SIGMETRICS 1986: 245-253 - 1985
- [c3]Israel Gold, Oded Shmueli, Micha Hofri:
The Private Workspace Model Feasibility and Applications to 2PL Performance Improvements. VLDB 1985: 192-208 - 1979
- [c2]Micha Hofri, Percy Tzelnic:
On the Working Set Size for the Markov Chain Model of Program Behaviour. Performance 1979: 393-405 - 1977
- [c1]Edward G. Coffman Jr., Micha Hofri:
On Scanning-Disks and the Analysis of their Steady State Behavior. Performance 1977: 251-263
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
