Search the dblp DataBase
Michael Luby: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
Competitive Paging Algorithms. [Citation Graph (3, 0)][DBLP]
J. Algorithms, 1991, v:12, n:4, pp:685-699 [Journal] - Richard M. Karp, Michael Luby
Monte-Carlo Algorithms for Enumeration and Reliability Problems [Citation Graph (2, 0)][DBLP]
FOCS, 1983, pp:56-64 [Conf] - Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela
A Probabilistic Analysis of Multidimensional Bin Packing Problems [Citation Graph (1, 0)][DBLP]
STOC, 1984, pp:289-298 [Conf] - Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
Efficient construction of a small hitting set for combinatorial rectangles in high dimension. [Citation Graph (1, 0)][DBLP]
STOC, 1993, pp:258-267 [Conf] - Paul Dagum, Michael Luby
Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard. [Citation Graph (1, 0)][DBLP]
Artif. Intell., 1993, v:60, n:1, pp:141-153 [Journal] - Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2004, pp:273-285 [Conf] - Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
On the Theory of Average Case Complexity (abstract). [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1989, pp:36- [Conf] - Oded Goldreich, Hugo Krawczyk, Michael Luby
On the Existence of Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
CRYPTO, 1988, pp:146-162 [Conf] - Amir Herzberg, Michael Luby
Pubic Randomness in Cryptography. [Citation Graph (0, 0)][DBLP]
CRYPTO, 1992, pp:421-432 [Conf] - Ari Juels, Michael Luby, Rafail Ostrovsky
Security of Blind Digital Signatures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
CRYPTO, 1997, pp:150-164 [Conf] - Michael Luby
Pseudo-random Generators from One-way Functions (Abstract). [Citation Graph (0, 0)][DBLP]
CRYPTO, 1991, pp:300- [Conf] - Michael Luby, Charles Rackoff
How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). [Citation Graph (0, 0)][DBLP]
CRYPTO, 1985, pp:447- [Conf] - Michael Luby, Charles Rackoff
A Study of Password Security. [Citation Graph (0, 0)][DBLP]
CRYPTO, 1987, pp:392-397 [Conf] - Andres Albanese, Michael Luby
PET - priority encoding transmission. [Citation Graph (0, 0)][DBLP]
High-Speed Networking for Multimedia Applications, 1995, pp:247-265 [Conf] - Michael Luby, Jessica Staddon
Combinatorial Bounds for Broadcast Encryption. [Citation Graph (0, 0)][DBLP]
EUROCRYPT, 1998, pp:512-526 [Conf] - Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
Priority Encoding Transmission [Citation Graph (0, 0)][DBLP]
FOCS, 1994, pp:604-612 [Conf] - Noga Alon, Jeff Edmonds, Michael Luby
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). [Citation Graph (0, 0)][DBLP]
FOCS, 1995, pp:512-519 [Conf] - Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin
Network Decomposition and Locality in Distributed Computation [Citation Graph (0, 0)][DBLP]
FOCS, 1989, pp:364-369 [Conf] - Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross
An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
FOCS, 1995, pp:142-149 [Conf] - Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani
Polytopes, Permanents and Graphs with Large Factors [Citation Graph (0, 0)][DBLP]
FOCS, 1988, pp:412-421 [Conf] - Oded Goldreich, Hugo Krawczyk, Michael Luby
On the Existence of Pseudorandom Generators (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1988, pp:12-24 [Conf] - Russell Impagliazzo, Michael Luby
One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1989, pp:230-235 [Conf] - Michael Luby
LT Codes. [Citation Graph (0, 0)][DBLP]
FOCS, 2002, pp:271-0 [Conf] - Michael Luby
Removing Randomness in Parallel Computation Without a Processor Penalty [Citation Graph (0, 0)][DBLP]
FOCS, 1988, pp:162-173 [Conf] - Michael Luby, Silvio Micali, Charles Rackoff
How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin [Citation Graph (0, 0)][DBLP]
FOCS, 1983, pp:11-21 [Conf] - Michael Luby, Dana Randall, Alistair Sinclair
Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
FOCS, 1995, pp:150-159 [Conf] - Michael Luby, Prabhakar Ragde
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). [Citation Graph (0, 0)][DBLP]
ICALP, 1985, pp:394-403 [Conf] - John W. Byers, Michael Luby, Michael Mitzenmacher
Fine-Grained Layered Multicast. [Citation Graph (0, 0)][DBLP]
INFOCOM, 2001, pp:1143-1151 [Conf] - John W. Byers, Michael Luby, Michael Mitzenmacher
Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. [Citation Graph (0, 0)][DBLP]
INFOCOM, 1999, pp:275-283 [Conf] - Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz
A Modular Analysis of Network Transmission Protocols. [Citation Graph (0, 0)][DBLP]
ISTCS, 1997, pp:54-62 [Conf] - Michael Luby, Alistair Sinclair, David Zuckerman
Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP]
ISTCS, 1993, pp:128-133 [Conf] - Michael Luby, Boban Velickovic, Avi Wigderson
Deterministic Approximate Counting of Depth-2 Circuits. [Citation Graph (0, 0)][DBLP]
ISTCS, 1993, pp:18-24 [Conf] - Bernd Lamparter, Andres Albanese, Malik Kalfane, Michael Luby
PET - Priority Encoding Transmission: A New, Robust and Efficient Video Broadcast Technology (Video). [Citation Graph (0, 0)][DBLP]
ACM Multimedia, 1995, pp:547-548 [Conf] - John W. Byers, Michael Frumin, Gavin B. Horn, Michael Luby, Michael Mitzenmacher, Alex Roetter, William Shaver
FLID-DL. [Citation Graph (0, 0)][DBLP]
Networked Group Communication, 2000, pp:71-81 [Conf] - Michael Luby
Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs. [Citation Graph (0, 0)][DBLP]
RANDOM, 1998, pp:171- [Conf] - John W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege
A Digital Fountain Approach to Reliable Distribution of Bulk Data. [Citation Graph (0, 0)][DBLP]
SIGCOMM, 1998, pp:56-67 [Conf] - Michael Luby, Vivek K. Goyal, Simon Skaria, Gavin B. Horn
Wave and equation based rate control using multicast round trip time. [Citation Graph (0, 0)][DBLP]
SIGCOMM, 2002, pp:191-204 [Conf] - Paul Beame, Michael Luby
Parallel Search for Maximal Independence Given Minimal Dependence. [Citation Graph (0, 0)][DBLP]
SODA, 1990, pp:212-218 [Conf] - Marek Karpinski, Michael Luby
Approximating the Number of Zeroes of a GF[2] Polynomial. [Citation Graph (0, 0)][DBLP]
SODA, 1991, pp:300-303 [Conf] - Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi
Analysis of Random Processes via And-Or Tree Evaluation. [Citation Graph (0, 0)][DBLP]
SODA, 1998, pp:364-373 [Conf] - Michael Luby, Joseph Naor, Ariel Orda
Tight Bounds for Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
SODA, 1994, pp:724-732 [Conf] - Michael Luby, Wolfgang Ertel
Optimal Parallelization of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP]
STACS, 1994, pp:463-474 [Conf] - Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
On the Theory of Average Case Complexity [Citation Graph (0, 0)][DBLP]
STOC, 1989, pp:204-216 [Conf] - Manuel Blum, Michael Luby, Ronitt Rubinfeld
Self-Testing/Correcting with Applications to Numerical Problems [Citation Graph (0, 0)][DBLP]
STOC, 1990, pp:73-83 [Conf] - Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic
Approximations of General Independent Distributions [Citation Graph (0, 0)][DBLP]
STOC, 1992, pp:10-16 [Conf] - Russell Impagliazzo, Leonid A. Levin, Michael Luby
Pseudo-random Generation from one-way functions (Extended Abstracts) [Citation Graph (0, 0)][DBLP]
STOC, 1989, pp:12-24 [Conf] - Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide
Efficient PRAM Simulation on a Distributed Memory Machine [Citation Graph (0, 0)][DBLP]
STOC, 1992, pp:318-326 [Conf] - Michael Luby
A Simple Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP]
STOC, 1985, pp:1-10 [Conf] - Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. [Citation Graph (0, 0)][DBLP]
STOC, 1998, pp:249-258 [Conf] - Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann
Practical Loss-Resilient Codes. [Citation Graph (0, 0)][DBLP]
STOC, 1997, pp:150-159 [Conf] - Michael Luby, Noam Nisan
A parallel approximation algorithm for positive linear programming. [Citation Graph (0, 0)][DBLP]
STOC, 1993, pp:448-457 [Conf] - Michael Luby, Charles Rackoff
Pseudo-random Permutation Generators and Cryptographic Composition [Citation Graph (0, 0)][DBLP]
STOC, 1986, pp:356-363 [Conf] - Michael Luby, Boban Velickovic
On Deterministic Approximation of DNF [Citation Graph (0, 0)][DBLP]
STOC, 1991, pp:430-438 [Conf] - Michael Luby, Eric Vigoda
Approximately Counting Up To Four (Extended Abstract). [Citation Graph (0, 0)][DBLP]
STOC, 1997, pp:682-687 [Conf] - Michael Luby
Fast, Reliable Data Transport. [Citation Graph (0, 0)][DBLP]
USENIX Symposium on Internet Technologies and Systems, 2003, pp:- [Conf] - Paul Dagum, Michael Luby
An Optimal Approximation Algorithm for Bayesian Inference. [Citation Graph (0, 0)][DBLP]
Artif. Intell., 1997, v:93, n:, pp:1-27 [Journal] - Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide
Efficient PRAM Simulation on a Distributed Memory Machine. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1996, v:16, n:4/5, pp:517-542 [Journal] - Michael Luby
Introduction to Special Issue on Randomized and Derandomized Algorithms. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1996, v:16, n:4/5, pp:359-366 [Journal] - Michael Luby, Prabhakar Ragde
A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1989, v:4, n:4, pp:551-567 [Journal] - Michael Luby, Boban Velickovic
On Deterministic Approximation of DNF. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1996, v:16, n:4/5, pp:415-433 [Journal] - Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1997, v:17, n:2, pp:215-234 [Journal] - Gavin B. Horn, Per Knudsgaard, Søren B. Lassen, Michael Luby, Jens Eilstrup Rasmussen
A Scalable and Reliable Paradigm for Media on Demand. [Citation Graph (0, 0)][DBLP]
IEEE Computer, 2001, v:34, n:9, pp:40-45 [Journal] - Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
Competitive Paging Algorithms [Citation Graph (0, 0)][DBLP]
CoRR, 2002, v:0, n:, pp:- [Journal] - Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:052, pp:- [Journal] - Stephen A. Cook, Michael Luby
A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1988, v:27, n:3, pp:141-145 [Journal] - Susanne E. Hambrusch, Michael Luby
Parallel Asynchronous Connected Components in a Mesh. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1991, v:38, n:5, pp:257-263 [Journal] - Michael Luby, Alistair Sinclair, David Zuckerman
Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1993, v:47, n:4, pp:173-180 [Journal] - Richard M. Karp, Michael Luby, Neal Madras
Monte-Carlo Approximation Algorithms for Enumeration Problems. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1989, v:10, n:3, pp:429-448 [Journal] - Marek Karpinski, Michael Luby
Approximating the Number of Zeroes of a GF[2] Polynomial. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1993, v:14, n:2, pp:280-287 [Journal] - Richard M. Karp, Michael Luby
Monte-Carlo algorithms for the planar multiterminal network reliability problem. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1985, v:1, n:1, pp:45-64 [Journal] - Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
On the Theory of Average Case Complexity. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1992, v:44, n:2, pp:193-219 [Journal] - Manuel Blum, Michael Luby, Ronitt Rubinfeld
Self-Testing/Correcting with Applications to Numerical Problems. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1993, v:47, n:3, pp:549-595 [Journal] - Michael Luby
Removing Randomness in Parallel Computation without a Processor Penalty. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1993, v:47, n:2, pp:250-286 [Journal] - Michael Luby, Charles Rackoff
A Study of Password Security. [Citation Graph (0, 0)][DBLP]
J. Cryptology, 1989, v:1, n:3, pp:151-158 [Journal] - Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic
Efficient approximation of product distributions. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1998, v:13, n:1, pp:1-16 [Journal] - Michael Luby
Foreword. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1997, v:11, n:4, pp:297- [Journal] - Michael Luby, Eric Vigoda
Fast convergence of the Glauber dynamics for sampling independent sets. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1999, v:15, n:3-4, pp:229-241 [Journal] - Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross
An Optimal Algorithm for Monte Carlo Estimation. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2000, v:29, n:5, pp:1484-1496 [Journal] - Oded Goldreich, Hugo Krawczyk, Michael Luby
On the Existence of Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1993, v:22, n:6, pp:1163-1175 [Journal] - Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
A Pseudorandom Generator from any One-way Function. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1999, v:28, n:4, pp:1364-1396 [Journal] - Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby
A Monte-Carlo Algorithm for Estimating the Permanent. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1993, v:22, n:2, pp:284-293 [Journal] - Michael Luby
A Simple Parallel Algorithm for the Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1986, v:15, n:4, pp:1036-1053 [Journal] - Michael Luby, Charles Rackoff
How to Construct Pseudorandom Permutations from Pseudorandom Functions. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1988, v:17, n:2, pp:373-386 [Journal] - Michael Luby, Dana Randall, Alistair Sinclair
Markov Chain Algorithms for Planar Lattice Structures. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2001, v:31, n:1, pp:167-192 [Journal] - Michael Luby, Joseph Naor, Ariel Orda
Tight Bounds for Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1996, v:9, n:1, pp:155-166 [Journal] - Paul Dagum, Michael Luby
Approximating the Permanent of Graphs with Large Factors. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1992, v:102, n:2, pp:283-305 [Journal] - Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
Priority encoding transmission. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1737-1744 [Journal] - Noga Alon, Michael Luby
A linear time erasure-resilient code with nearly optimal recovery. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1732-1736 [Journal] - Michael Luby, Michael Mitzenmacher
Verification-based decoding for packet-based low-density parity-check codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:120-127 [Journal] - Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
Efficient erasure correcting codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:569-584 [Journal] - Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
Improved low-density parity-check codes using irregular graphs. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:585-598 [Journal] - John W. Byers, Gu-In Kwon, Michael Luby, Michael Mitzenmacher
Fine-grained layered multicast with STAIR. [Citation Graph (0, 0)][DBLP]
IEEE/ACM Trans. Netw., 2006, v:14, n:1, pp:81-93 [Journal]
Search in 0.011secs, Finished in 0.014secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002