The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Micha Hofri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.305secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002