| LT codes M Luby The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002 | 4184 | 2002 |
| A pseudorandom generator from any one-way function J Håstad, R Impagliazzo, LA Levin, M Luby SIAM Journal on Computing 28 (4), 1364-1396, 1999 | 2050 | 1999 |
| A digital fountain approach to reliable distribution of bulk data JW Byers, M Luby, M Mitzenmacher, A Rege ACM SIGCOMM Computer Communication Review 28 (4), 56-67, 1998 | 1928 | 1998 |
| A simple parallel algorithm for the maximal independent set problem M Luby Proceedings of the seventeenth annual ACM symposium on Theory of computing, 1-10, 1985 | 1917 | 1985 |
| How to construct pseudorandom permutations from pseudorandom functions M Luby, C Rackoff SIAM Journal on Computing 17 (2), 373-386, 1988 | 1533 | 1988 |
| Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2002 | 1461 | 2002 |
| Self-testing/correcting with applications to numerical problems M Blum, M Luby, R Rubinfeld Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990 | 1317 | 1990 |
| Improved low-density parity-check codes using irregular graphs MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on information Theory 47 (2), 585-598, 2002 | 1309 | 2002 |
| Practical loss-resilient codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman, V Stemann Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 1211 | 1997 |
| Pseudo-random generation from one-way functions R Impagliazzo, LA Levin, M Luby Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 1164 | 1989 |
| Approximating probabilistic inference in Bayesian belief networks is NP-hard P Dagum, M Luby Artificial intelligence 60 (1), 141-153, 1993 | 1131 | 1993 |
| Priority encoding transmission A Albanese, J Blomer, J Edmonds, M Luby, M Sudan IEEE transactions on information theory 42 (6), 1737-1744, 2002 | 1011 | 2002 |
| Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993 | 818 | 1993 |
| A digital fountain approach to asynchronous reliable multicast JW Byers, M Luby, M Mitzenmacher IEEE Journal on Selected areas in Communications 20 (8), 1528-1540, 2002 | 734 | 2002 |
| Pseudorandomness and cryptographic applications M Luby Princeton University Press, 1996 | 674 | 1996 |
| Competitive paging algorithms A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young Journal of Algorithms 12 (4), 685-699, 1991 | 648 | 1991 |
| One-way functions are essential for complexity based cryptography R Impagliazzo, M Luby 30th Annual Symposium on Foundations of Computer Science, 230-235, 1989 | 543 | 1989 |
| Analysis of low density codes and improved designs using irregular graphs M Luby, M Mitzenmacher, A Shokrollah, D Spielman Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 507 | 1998 |
| Analysis of Random Processes via And-Or Tree Evaluation. M Luby, M Mitzenmacher, MA Shokrollahi SODA 98, 364-373, 1998 | 484 | 1998 |
| Monte-Carlo approximation algorithms for enumeration problems RM Karp, M Luby, N Madras Journal of algorithms 10 (3), 429-448, 1989 | 474 | 1989 |
Amin ShokrollahiEPFLVerified email at epfl.ch
