Micha Hofri

1.7k total citations
58 papers, 1.1k citations indexed

About

Micha Hofri is a scholar working on Computer Networks and Communications, Management Information Systems and Artificial Intelligence. According to data from OpenAlex, Micha Hofri has authored 58 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computer Networks and Communications, 16 papers in Management Information Systems and 10 papers in Artificial Intelligence. Recurrent topics in Micha Hofri's work include Advanced Queuing Theory Analysis (16 papers), Distributed systems and fault tolerance (12 papers) and Optimization and Search Problems (11 papers). Micha Hofri is often cited by papers focused on Advanced Queuing Theory Analysis (16 papers), Distributed systems and fault tolerance (12 papers) and Optimization and Search Problems (11 papers). Micha Hofri collaborates with scholars based in Israel, United States and France. Micha Hofri's co-authors include E. G. Coffman, Philippe Flajolet, Guy Fayolle, Keith W. Ross, A. Boneh, Zvi Rosberg, Philippe Jacquet, Kimming So, Andrew Chi-Chih Yao and John Bruno and has published in prestigious journals such as IEEE Transactions on Information Theory, Communications of the ACM and European Journal of Operational Research.

In The Last Decade

Micha Hofri

56 papers receiving 994 citations

Peers

Micha Hofri

CNC

MIS

EEE

IME

AI

Randolph Nelson United States

Jean-Pierre Quadrat France

И. Н. Коваленко Ukraine

Guy Fayolle France

П. Д. Финч Australia

T. Leighton United States

Richard W. Butterworth United States

A. Segall Israel

J. Scott Provan United States

Oliver C. Ibe United States

Randolph Nelson United States

Micha Hofri

1.4k ×2.2

CNC

485 ×1.6

MIS

596 ×2.8

EEE

117 ×0.6

IME

85 ×0.5

AI

Citations per year, relative to Micha Hofri Micha Hofri (= 1×) peers Randolph Nelson

Countries citing papers authored by Micha Hofri

Since Specialization

Citations

This map shows the geographic impact of Micha Hofri's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Micha Hofri with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Micha Hofri more than expected).

Fields of papers citing papers by Micha Hofri

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Micha Hofri. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Micha Hofri. The network helps show where Micha Hofri may publish in the future.

Co-authorship network of co-authors of Micha Hofri

This figure shows the co-authorship network connecting the top 25 collaborators of Micha Hofri. A scholar is included among the top collaborators of Micha Hofri based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Micha Hofri. Micha Hofri is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Cantone, Domenico & Micha Hofri. (2013). Further analysis of the remedian algorithm. Theoretical Computer Science. 495. 1–16. 1 indexed citations

2.

Hofri, Micha. (2011). Probabilistic Analysis of Algorithms: On Computing Methodologies for Computer Algorithms Performance Evaluation. Medical Entomology and Zoology. 1 indexed citations

3.

Cantone, Domenico, et al.. (2006). An Efficient Approximate Algorithm for the k-th Selection Problem. Digital WPI. 2 indexed citations

4.

Hofri, Micha, et al.. (1999). 1999 Computer Science Department MQP Review. Digital WPI.

5.

Coffman, E. G., Philippe Flajolet, Leopold Flatto, & Micha Hofri. (1998). The Maximum of a Random Walk and Its Application to Rectangle Packing. Probability in the Engineering and Informational Sciences. 12(3). 373–386. 18 indexed citations

6.

Boneh, A. & Micha Hofri. (1997). The coupon-collector problem revisited — a survey of engineering problems and computational methods. Communications in Statistics Stochastic Models. 13(1). 39–66. 49 indexed citations

7.

Hofri, Micha & Yaakov Kogan. (1994). Asymptotic analysis of product-form distributions related to large interconnection networks. Theoretical Computer Science. 125(1). 61–90. 3 indexed citations

8.

Aldous, David, Micha Hofri, & Wojciech Szpankowski. (1992). Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited. SIAM Journal on Computing. 21(4). 713–732. 9 indexed citations

9.

Hofri, Micha. (1986). Queueing systems with a procrastinating server. 245–253. 17 indexed citations

10.

Fayolle, Guy, Philippe Flajolet, & Micha Hofri. (1986). On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel. Advances in Applied Probability. 18(2). 441–472. 43 indexed citations

11.

Fayolle, Guy, Philippe Flajolet, & Micha Hofri. (1986). On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel. Advances in Applied Probability. 18(2). 441–472. 40 indexed citations

12.

Hofri, Micha. (1986). Two queues and one server with threshold switching. 409–428. 4 indexed citations

13.

Fayolle, Guy, Philippe Flajolet, & Micha Hofri. (1986). ON A FUNCTIONAL EQUATION ARISING IN THE BROADCAST CHANNEL ANALYSIS OF A PROTOCOL FOR A MULTI-ACCESS. 1 indexed citations

14.

Shmueli, Oded, et al.. (1985). The private workspace model feasibility and applications to 2PL performance improvements. Very Large Data Bases. 192–208. 2 indexed citations

15.

Coffman, E. G. & Micha Hofri. (1982). On the Expected Performance of Scanning Disks. SIAM Journal on Computing. 11(1). 60–70. 33 indexed citations

16.

Hofri, Micha. (1980). Two-dimensional packing: expected performance of simple level algorithms. Information and Control. 45(1). 1–17. 28 indexed citations

17.

Hofri, Micha, et al.. (1979). On the Working Set Size for the Markov Chain Model of Program Behaviour. International Symposium on Computer Modeling, Measurement and Evaluation. 393–405. 2 indexed citations

18.

Hofri, Micha. (1978). A generating-function analysis of multiprogramming queues. International Journal of Parallel Programming. 7(2). 121–155. 10 indexed citations

19.

Coffman, Edward G. & Micha Hofri. (1977). On Scanning-Disks and the Analysis of their Steady State Behavior. International Symposium on Computer Modeling, Measurement and Evaluation. 251–263. 5 indexed citations

20.

Hofri, Micha. (1977). On Certain Output-Buffer Management Techniques—A Stochastic Model. Journal of the ACM. 24(2). 241–249. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact