Michael Luby
About
In The Last Decade
Michael Luby
122 papers receiving 12.7k citations
Hit Papers
Peers
Comparison fields: 5 of 123
- Computer Networks and Communications 9.0k
- Electrical and Electronic Engineering 4.9k
- Artificial Intelligence 4.3k
- Computational Theory and Mathematics 3.1k
- Computer Vision and Pattern Recognition 1.4k
Countries citing papers authored by Michael Luby
This map shows the geographic impact of Michael Luby'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 Michael Luby with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Luby more than expected).
Fields of papers citing papers by Michael Luby
This network shows the impact of papers produced by Michael Luby. 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 Michael Luby. The network helps show where Michael Luby may publish in the future.
Co-authorship network of co-authors of Michael Luby
This figure shows the co-authorship network connecting the top 25 collaborators of Michael Luby. A scholar is included among the top collaborators of Michael Luby 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 Michael Luby. Michael Luby is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Pairwise Independence and Derandomization (Foundations and Trends(R) in Theoretical Computer Science) | 2 |
| 2 | Fast, Reliable Data Transport. | 14 |
| 3 | 1 | |
| 4 | Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science | 3 |
| 5 | 375 | |
| 6 | PET - Priority Encoding Transmission: A New, Robust and Efficient Video Broadcast Technology (Video). | 7 |
| 7 | Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). | 2 |
| 8 | An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). | 5 |
| 9 | Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract) | 15 |
| 10 | 1 | |
| 11 | 370 | |
| 12 | 101 | |
| 13 | 1 | |
| 14 | 13 | |
| 15 | 121 | |
| 16 | On the Theory of Average Case Complexity (abstract). | 2 |
| 17 | One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract) | 19 |
| 18 | Steepest Descent Can Take Ex ponentia l T im e for Symmetric Connection Networks | 10 |
| 19 | 47 | |
| 20 | Finding Shortest Paths in Very Large Networks. | 5 |
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.