default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Luby
Michael George Luby
Person information
- affiliation: University of California, Berkeley, USA
- award (2015): ACM Paris Kanellakis Theory and Practice Award
- award (2012): IEEE Richard W. Hamming Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c70]E. K. A. Permatasari
, Evan Gossling, Md Nadim, Sarath Babu, Daji Qiao, Hongwei Zhang, Michael Luby, John W. Byers, Lorenz Minder, Pooja Aggarwal:
Real-Time Liquid Wireless Transport for Video Streaming in Rural and Agricultural Applications. MHV 2024: 54-60- 2023
- [c69]Michael Luby:
Enabling immersive experiences in challenging network conditions. MHV 2023: 120 - [i29]Pooja Aggarwal, Michael Luby, Lorenz Minder:
Enabling immersive experiences in challenging network conditions. CoRR abs/2304.03732 (2023) - 2022
- [i28]Waqar Zia, Thomas Stockhammer, Lenaig Chaponniere, Giridhar D. Mandyam, Michael Luby:
Real-Time Transport Object Delivery over Unidirectional Transport (ROUTE). RFC 9223: 1-35 (2022) - 2021
- [j52]Michael Luby:
Repair Rate Lower Bounds for Distributed Storage. IEEE Trans. Inf. Theory 67(9): 5711-5730 (2021) - [i27]Michael Luby, Thomas Richardson:
Distributed storage algorithms with optimal tradeoffs. CoRR abs/2101.05223 (2021) - 2020
- [c68]John W. Byers, Michael Luby:
Liquid Data Networking. ICN 2020: 129-135 - [i26]Michael Luby:
Repair rate lower bounds for distributed storage. CoRR abs/2002.07904 (2020) - [i25]Michael Luby:
SOPI design and analysis for LDN. CoRR abs/2008.13300 (2020)
2010 – 2019
- 2019
- [j51]John W. Byers, Michael Luby, Michael Mitzenmacher:
A digital fountain retrospective. Comput. Commun. Rev. 49(5): 82-85 (2019) - [j50]Michael Luby, Roberto Padovani, Thomas J. Richardson, Lorenz Minder, Pooja Aggarwal:
Liquid Cloud Storage. ACM Trans. Storage 15(1): 2:1-2:49 (2019) - 2017
- [i24]Michael George Luby, Roberto Padovani, Thomas J. Richardson, Lorenz Minder, Pooja Aggarwal:
Liquid Cloud Storage. CoRR abs/1705.07983 (2017) - [i23]Sanjoy Dasgupta, Michael Luby:
Learning from partial correction. CoRR abs/1705.08076 (2017) - 2016
- [i22]Michael Luby:
Capacity bounds for distributed storage. CoRR abs/1610.03541 (2016) - 2015
- [j49]Yao Liu, Sujit Dey, Fatih Ulupinar, Michael Luby, Yinian Mao:
Deriving and Validating User Experience Model for DASH Video Streaming. IEEE Trans. Broadcast. 61(4): 651-665 (2015) - [c67]Michael Luby:
Keynote 1: Converged Internet and Broadcast media delivery. WOWMOM 2015: 1 - 2014
- [c66]Michael George Luby:
Coding theory for scalable media delivery. PODC 2014: 153-155 - 2013
- [c65]Yao Liu, Sujit Dey, Don Gillies, Fatih Ulupinar, Michael Luby:
User Experience Modeling for DASH Video. PV 2013: 1-8 - 2012
- [c64]Michael Luby:
Best practices for mobile broadcast delivery and playback of multimedia content. BMSB 2012: 1-7 - [c63]Thomas Stockhammer, Michael Luby:
Dash in mobile networks and services. VCIP 2012: 1-6 - [i21]Mark Watson, Thomas Stockhammer, Michael Luby:
Raptor Forward Error Correction (FEC) Schemes for FECFRAME. RFC 6681: 1-22 (2012) - [i20]Mark Watson, Thomas Stockhammer, Michael Luby:
RTP Payload Format for Raptor Forward Error Correction (FEC). RFC 6682: 1-18 (2012) - [i19]Toni Paila, Rod Walsh, Michael Luby, Vincent Roca, Rami Lehtonen:
FLUTE - File Delivery over Unidirectional Transport. RFC 6726: 1-46 (2012) - 2011
- [c62]Michael Luby, Mohammad Amin Shokrollahi:
Slepian-Wolf type problems on the erasure channel. ISIT 2011: 2771-2775 - [i18]Michael Luby, Amin Shokrollahi, Mark Watson, Thomas Stockhammer, Lorenz Minder:
RaptorQ Forward Error Correction Scheme for Object Delivery. RFC 6330: 1-69 (2011) - 2010
- [i17]Michael Luby, Mark Watson, Lorenzo Vicisano:
Asynchronous Layered Coding (ALC) Protocol Instantiation. RFC 5775: 1-24 (2010)
2000 – 2009
- 2009
- [j48]Mohammad Amin Shokrollahi, Michael Luby:
Raptor Codes. Found. Trends Commun. Inf. Theory 6(3-4): 213-322 (2009) - [j47]David Gozalvez, David Gomez-Barquero, Thomas Stockhammer, Michael Luby:
AL-FEC for Improved Mobile Reception of MPEG-2 DVB-T Transport Streams. Int. J. Digit. Multim. Broadcast. 2009: 614178:1-614178:10 (2009) - [i16]Michael Luby, Mark Watson, Lorenzo Vicisano:
Layered Coding Transport (LCT) Building Block. RFC 5651: 1-34 (2009) - 2008
- [j46]Michael Luby, Thomas Stockhammer, Mark Watson:
IPTV Systems, Standards and Architectures: Part II - Application Layer FEC In IPTV Services. IEEE Commun. Mag. 46(5): 94-101 (2008) - [j45]Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-abelian homomorphism testing, and distributions close to their self-convolutions. Random Struct. Algorithms 32(1): 49-70 (2008) - 2007
- [j44]Michael Luby, Tiago Gasiba, Thomas Stockhammer, Mark Watson:
Reliable Multimedia Download Delivery in Cellular Broadcast Networks. IEEE Trans. Broadcast. 53(1): 235-246 (2007) - [i15]Mark Watson, Michael Luby, Lorenzo Vicisano:
Forward Error Correction (FEC) Building Block. RFC 5052: 1-25 (2007) - [i14]Michael Luby, Amin Shokrollahi, Mark Watson, Thomas Stockhammer:
Raptor Forward Error Correction Scheme for Object Delivery. RFC 5053: 1-46 (2007) - 2006
- [j43]John W. Byers, Gu-In Kwon, Michael Luby, Michael Mitzenmacher:
Fine-grained layered multicast with STAIR. IEEE/ACM Trans. Netw. 14(1): 81-93 (2006) - [c61]Michael Luby, Mark Watson, Tiago Gasiba, Thomas Stockhammer, Wen Xu:
Raptor codes for reliable download delivery in wireless broadcast systems. CCNC 2006: 192-197 - [c60]Michael Luby, Mark Watson, Tiago Gasiba, Thomas Stockhammer:
Mobile data broadcasting over MBMS tradeoffs in forward error correction. MUM 2006: 10 - 2005
- [j42]Michael Luby, Avi Wigderson:
Pairwise Independence and Derandomization. Found. Trends Theor. Comput. Sci. 1(4) (2005) - [j41]Michael Luby, Michael Mitzenmacher:
Verification-based decoding for packet-based low-density parity-check codes. IEEE Trans. Inf. Theory 51(1): 120-127 (2005) - [c59]Andrew Brown, Michael Luby, Amin Shokrollahi:
Repeat-accumulate codes that approach the Gilbert-Varshamov bound. ISIT 2005: 169-173 - [c58]Richard M. Karp, Michael Luby, Amin Shokrollahi:
Verification decoding of raptor codes. ISIT 2005: 1310-1314 - 2004
- [c57]Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. APPROX-RANDOM 2004: 273-285 - [c56]Richard M. Karp, Michael Luby, Amin Shokrollahi:
Finite length analysis of LT codes. ISIT 2004: 39 - [i13]Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions. Electron. Colloquium Comput. Complex. TR04 (2004) - [i12]Michael Luby, Lorenzo Vicisano:
Compact Forward Error Correction (FEC) Schemes. RFC 3695: 1-13 (2004) - [i11]Michael Luby, Vivek K. Goyal:
Wave and Equation Based Rate Control (WEBRC) Building Block. RFC 3738: 1-32 (2004) - [i10]Toni Paila, Michael Luby, Rami Lehtonen, Vincent Roca, Rod Walsh:
FLUTE - File Delivery over Unidirectional Transport. RFC 3926: 1-35 (2004) - 2003
- [c55]Michael Luby:
Fast, Reliable Data Transport. USENIX Symposium on Internet Technologies and Systems 2003 - 2002
- [j40]John W. Byers, Michael Luby, Michael Mitzenmacher:
A digital fountain approach to asynchronous reliable multicast. IEEE J. Sel. Areas Commun. 20(8): 1528-1540 (2002) - [j39]John W. Byers, Gavin B. Horn, Michael Luby, Michael Mitzenmacher, William Shaver:
FLID-DL: congestion control for layered multicast. IEEE J. Sel. Areas Commun. 20(8): 1558-1570 (2002) - [c54]Michael Luby:
LT Codes. FOCS 2002: 271- - [c53]Michael Luby, Vivek K. Goyal, Simon Skaria, Gavin B. Horn:
Wave and equation based rate control using multicast round trip time. SIGCOMM 2002: 191-204 - [i9]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. CoRR cs.DS/0205038 (2002) - [i8]Michael Luby, Jim Gemmell, Lorenzo Vicisano, Luigi Rizzo, Jon Crowcroft:
Asynchronous Layered Coding (ALC) Protocol Instantiation. RFC 3450: 1-34 (2002) - [i7]Michael Luby, Jim Gemmell, Lorenzo Vicisano, Luigi Rizzo, Mark Handley, Jon Crowcroft:
Layered Coding Transport (LCT) Building Block. RFC 3451: 1-29 (2002) - [i6]Michael Luby, Lorenzo Vicisano, Jim Gemmell, Luigi Rizzo, Mark Handley, Jon Crowcroft:
Forward Error Correction (FEC) Building Block. RFC 3452: 1-16 (2002) - [i5]Michael Luby, Lorenzo Vicisano, Jim Gemmell, Luigi Rizzo, Mark Handley, Jon Crowcroft:
The Use of Forward Error Correction (FEC) in Reliable Multicast. RFC 3453: 1-18 (2002) - 2001
- [j38]Gavin B. Horn, Per Knudsgaard, Søren B. Lassen, Michael Luby, Jens Eilstrup Rasmussen:
A Scalable and Reliable Paradigm for Media on Demand. Computer 34(9): 40-45 (2001) - [j37]Michael Luby, Dana Randall, Alistair Sinclair:
Markov Chain Algorithms for Planar Lattice Structures. SIAM J. Comput. 31(1): 167-192 (2001) - [j36]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman:
Efficient erasure correcting codes. IEEE Trans. Inf. Theory 47(2): 569-584 (2001) - [j35]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman:
Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inf. Theory 47(2): 585-598 (2001) - [c52]John W. Byers, Michael Luby, Michael Mitzenmacher:
Fine-Grained Layered Multicast. INFOCOM 2001: 1143-1151 - [i4]Brian Whetten, Lorenzo Vicisano, Roger G. Kermode, Mark Handley, Sally Floyd, Michael Luby:
Reliable Multicast Transport Building Blocks for One-to-Many Bulk-Data Transfer. RFC 3048: 1-20 (2001) - [i3]Tony Speakman, Jon Crowcroft, Jim Gemmell, Dino Farinacci, Steven Lin, Dan Leshchiner, Michael Luby, Todd L. Montgomery, Luigi Rizzo, Alex Tweedly, Nidhi Bhaskar, Richard Edmonstone, Rajitha Sumanasekera, Lorenzo Vicisano:
PGM Reliable Transport Protocol Specification. RFC 3208: 1-111 (2001) - 2000
- [j34]Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross:
An Optimal Algorithm for Monte Carlo Estimation. SIAM J. Comput. 29(5): 1484-1496 (2000) - [c51]John W. Byers, Michael Frumin, Gavin B. Horn, Michael Luby, Michael Mitzenmacher, Alex Roetter, William Shaver:
FLID-DL: congestion control for layered multicast. Networked Group Communication 2000: 71-81 - [i2]Mark Handley, Sally Floyd, Brian Whetten, Roger G. Kermode, Lorenzo Vicisano, Michael Luby:
The Reliable Multicast Design Space for Bulk Data Transfer. RFC 2887: 1-22 (2000)
1990 – 1999
- 1999
- [j33]Michael Luby, Eric Vigoda:
Fast convergence of the Glauber dynamics for sampling independent sets. Random Struct. Algorithms 15(3-4): 229-241 (1999) - [j32]Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby:
A Pseudorandom Generator from any One-way Function. SIAM J. Comput. 28(4): 1364-1396 (1999) - [c50]John W. Byers, Michael Luby, Michael Mitzenmacher:
Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. INFOCOM 1999: 275-283 - 1998
- [j31]Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic:
Efficient approximation of product distributions. Random Struct. Algorithms 13(1): 1-16 (1998) - [c49]Michael Luby, Jessica Staddon:
Combinatorial Bounds for Broadcast Encryption. EUROCRYPT 1998: 512-526 - [c48]Yair Bartal, John W. Byers, Michael Luby, Danny Raz:
Feedback-free multicast prefix protocols. ISCC 1998: 135-141 - [c47]Michael Luby:
Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs. RANDOM 1998: 171 - [c46]John W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege:
A Digital Fountain Approach to Reliable Distribution of Bulk Data. SIGCOMM 1998: 56-67 - [c45]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi:
Analysis of Random Processes via And-Or Tree Evaluation. SODA 1998: 364-373 - [c44]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman:
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. STOC 1998: 249-258 - [e1]Michael Luby, José D. P. Rolim, Maria J. Serna:
Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings. Lecture Notes in Computer Science 1518, Springer 1998, ISBN 3-540-65142-X [contents] - 1997
- [j30]Paul Dagum, Michael Luby:
An Optimal Approximation Algorithm for Bayesian Inference. Artif. Intell. 93: 1-27 (1997) - [j29]Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman:
Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. Comb. 17(2): 215-234 (1997) - [j28]Michael Luby:
Foreword. Random Struct. Algorithms 11(4): 297 (1997) - [c43]Ari Juels, Michael Luby, Rafail Ostrovsky:
Security of Blind Digital Signatures (Extended Abstract). CRYPTO 1997: 150-164 - [c42]Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz:
A Modular Analysis of Network Transmission Protocols. ISTCS 1997: 54-62 - [c41]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann:
Practical Loss-Resilient Codes. STOC 1997: 150-159 - [c40]Michael Luby, Eric Vigoda:
Approximately Counting Up To Four (Extended Abstract). STOC 1997: 682-687 - 1996
- [b1]Michael Luby:
Pseudorandomness and cryptographic applications. Princeton computer science notes, Princeton University Press 1996, ISBN 978-0-691-02546-9, pp. I-XVI, 1-234 - [j27]Michael Luby:
Introduction to Special Issue on Randomized and Derandomized Algorithms. Algorithmica 16(4/5): 359-366 (1996) - [j26]Michael Luby, Boban Velickovic:
On Deterministic Approximation of DNF. Algorithmica 16(4/5): 415-433 (1996) - [j25]Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide:
Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica 16(4/5): 517-542 (1996) - [j24]Michael Luby, Joseph Naor, Ariel Orda:
Tight Bounds for Dynamic Storage Allocation. SIAM J. Discret. Math. 9(1): 155-166 (1996) - [j23]Michael Luby:
SICACT Treasurer's Report. SIGACT News 27(2): 5-6 (1996) - [j22]Noga Alon, Michael Luby:
A linear time erasure-resilient code with nearly optimal recovery. IEEE Trans. Inf. Theory 42(6): 1732-1736 (1996) - [j21]Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan:
Priority encoding transmission. IEEE Trans. Inf. Theory 42(6): 1737-1744 (1996) - 1995
- [c39]Andres Albanese, Michael Luby:
PET - priority encoding transmission. High-Speed Networking for Multimedia Applications 1995: 247-265 - [c38]Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross:
An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). FOCS 1995: 142-149 - [c37]Michael Luby, Dana Randall, Alistair Sinclair:
Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). FOCS 1995: 150-159 - [c36]Noga Alon, Jeff Edmonds, Michael Luby:
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). FOCS 1995: 512-519 - [c35]Bernd Lamparter, Andres Albanese, Malik Kalfane, Michael Luby:
PET - Priority Encoding Transmission: A New, Robust and Efficient Video Broadcast Technology (Video). ACM Multimedia 1995: 547-548 - 1994
- [c34]Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan:
Priority Encoding Transmission. FOCS 1994: 604-612 - [c33]Michael Luby, Joseph Naor, Ariel Orda:
Tight Bounds for Dynamic Storage Allocation. SODA 1994: 724-732 - [c32]Michael Luby, Wolfgang Ertel:
Optimal Parallelization of Las Vegas Algorithms. STACS 1994: 463-474 - 1993
- [j20]Paul Dagum, Michael Luby:
Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard. Artif. Intell. 60(1): 141-153 (1993) - [j19]Michael Luby, Alistair Sinclair, David Zuckerman:
Optimal Speedup of Las Vegas Algorithms. Inf. Process. Lett. 47(4): 173-180 (1993) - [j18]Marek Karpinski, Michael Luby:
Approximating the Number of Zeroes of a GF[2] Polynomial. J. Algorithms 14(2): 280-287 (1993) - [j17]Michael Luby:
Removing Randomness in Parallel Computation without a Processor Penalty. J. Comput. Syst. Sci. 47(2): 250-286 (1993) - [j16]Manuel Blum, Michael Luby, Ronitt Rubinfeld:
Self-Testing/Correcting with Applications to Numerical Problems. J. Comput. Syst. Sci. 47(3): 549-595 (1993) - [j15]Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby:
A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput. 22(2): 284-293 (1993) - [j14]Oded Goldreich, Hugo Krawczyk, Michael Luby:
On the Existence of Pseudorandom Generators. SIAM J. Comput. 22(6): 1163-1175 (1993) - [c31]Michael Luby, Boban Velickovic, Avi Wigderson:
Deterministic Approximate Counting of Depth-2 Circuits. ISTCS 1993: 18-24 - [c30]Michael Luby, Alistair Sinclair, David Zuckerman:
Optimal Speedup of Las Vegas Algorithms. ISTCS 1993: 128-133 - [c29]Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman:
Efficient construction of a small hitting set for combinatorial rectangles in high dimension. STOC 1993: 258-267 - [c28]Michael Luby, Noam Nisan:
A parallel approximation algorithm for positive linear programming. STOC 1993: 448-457 - [i1]Michael Luby, Wolfgang Ertel:
Optimal parallelization of Las Vegas algorithms. Forschungsberichte, TU Munich TUM I 9329: 1-17 (1993) - 1992
- [j13]Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby:
On the Theory of Average Case Complexity. J. Comput. Syst. Sci. 44(2): 193-219 (1992) - [j12]Paul Dagum, Michael Luby:
Approximating the Permanent of Graphs with Large Factors. Theor. Comput. Sci. 102(2): 283-305 (1992) - [c27]Amir Herzberg, Michael Luby:
Pubic Randomness in Cryptography. CRYPTO 1992: 421-432 - [c26]Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic:
Approximations of General Independent Distributions. STOC 1992: 10-16 - [c25]Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide:
Efficient PRAM Simulation on a Distributed Memory Machine. STOC 1992: 318-326 - 1991
- [j11]Susanne E. Hambrusch, Michael Luby:
Parallel Asynchronous Connected Components in a Mesh. Inf. Process. Lett. 38(5): 257-263 (1991) - [j10]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. J. Algorithms 12(4): 685-699 (1991) - [c24]Michael Luby:
Pseudo-random Generators from One-way Functions (Abstract). CRYPTO 1991: 300 - [c23]Marek Karpinski, Michael Luby:
Approximating the Number of Zeroes of a GF[2] Polynomial. SODA 1991: 300-303 - [c22]Michael Luby, Boban Velickovic:
On Deterministic Approximation of DNF. STOC 1991: 430-438 - 1990
- [c21]Paul Beame, Michael Luby:
Parallel Search for Maximal Independence Given Minimal Dependence. SODA 1990: 212-218 - [c20]Manuel Blum, Michael Luby, Ronitt Rubinfeld:
Self-Testing/Correcting with Applications to Numerical Problems. STOC 1990: 73-83
1980 – 1989
- 1989
- [j9]Michael Luby, Prabhakar Ragde:
A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. Algorithmica 4(4): 551-567 (1989) - [j8]Richard M. Karp, Michael Luby, Neal Madras:
Monte-Carlo Approximation Algorithms for Enumeration Problems. J. Algorithms 10(3): 429-448 (1989) - [j7]Michael Luby, Charles Rackoff:
A Study of Password Security. J. Cryptol. 1(3): 151-158 (1989) - [c19]Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby:
On the Theory of Average Case Complexity (abstract). SCT 1989: 36 - [c18]Manuel Blum, Michael Luby, Ronitt Rubinfeld:
Program Result Checking against Adaptive Programs and in Cryptographic Settings. Distributed Computing And Cryptography 1989: 107-118 - [c17]Russell Impagliazzo, Michael Luby:
One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract). FOCS 1989: 230-235 - [c16]Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin:
Network Decomposition and Locality in Distributed Computation. FOCS 1989: 364-369 - [c15]Russell Impagliazzo, Leonid A. Levin, Michael Luby:
Pseudo-random Generation from one-way functions (Extended Abstracts). STOC 1989: 12-24 - [c14]Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby:
On the Theory of Average Case Complexity. STOC 1989: 204-216 - 1988
- [j6]Armin Haken, Michael Luby:
Steepest Descent Can Take Exponential Time for Symmetric Connection Networks. Complex Syst. 2(2) (1988) - [j5]Stephen A. Cook, Michael Luby:
A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. Inf. Process. Lett. 27(3): 141-145 (1988) - [j4]Michael Luby, Charles Rackoff:
How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM J. Comput. 17(2): 373-386 (1988) - [c13]Oded Goldreich, Hugo Krawczyk, Michael Luby:
On the Existence of Pseudorandom Generators. CRYPTO 1988: 146-162 - [c12]Oded Goldreich, Hugo Krawczyk, Michael Luby:
On the Existence of Pseudorandom Generators (Extended Abstract). FOCS 1988: 12-24 - [c11]Michael Luby:
Removing Randomness in Parallel Computation Without a Processor Penalty. FOCS 1988: 162-173 - [c10]Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani:
Polytopes, Permanents and Graphs with Large Factors. FOCS 1988: 412-421 - 1987
- [c9]Michael Luby, Charles Rackoff:
A Study of Password Security. CRYPTO 1987: 392-397 - 1986
- [j3]Michael Luby:
A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15(4): 1036-1053 (1986) - [c8]Michael Luby, Charles Rackoff:
Pseudo-random Permutation Generators and Cryptographic Composition. STOC 1986: 356-363 - 1985
- [j2]Richard M. Karp, Michael Luby:
Monte-Carlo algorithms for the planar multiterminal network reliability problem. J. Complex. 1(1): 45-64 (1985) - [c7]Michael Luby, Charles Rackoff:
How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). CRYPTO 1985: 447 - [c6]Michael Luby, Prabhakar Ragde:
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). ICALP 1985: 394-403 - [c5]Michael Luby:
A Simple Parallel Algorithm for the Maximal Independent Set Problem. STOC 1985: 1-10 - 1984
- [c4]Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela:
A Probabilistic Analysis of Multidimensional Bin Packing Problems. STOC 1984: 289-298 - 1983
- [c3]Michael Luby, Silvio Micali, Charles Rackoff:
How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin. FOCS 1983: 11-21 - [c2]Richard M. Karp, Michael Luby:
Monte-Carlo Algorithms for Enumeration and Reliability Problems. FOCS 1983: 56-64 - [c1]Eugene L. Lawler, Michael George Luby, B. Parker:
Finding Shortest Paths in Very Large Networks. WG 1983: 184-199 - 1982
- [j1]Eugene L. Lawler, Michael George Luby, Vijay V. Vazirani:
Scheduling open shops with parallel machines. Oper. Res. Lett. 1(4): 161-164 (1982)
Coauthor Index
Amin Shokrollahi
aka: Mohammad Amin Shokrollahi
aka: Mohammad Amin Shokrollahi
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
