Publications

Found 55 results
Author Title Type [ Year(Desc)]
Filters: Author is Michael Luby  [Clear All Filters]
1983
Karp, R. M., & Luby M. (1983).  Monte-Carlo Algorithms for Enumeration and Reliability Problems. Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 56-64.
1985
Karp, R. M., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Proceedings of the Symposium on the Complexity of Approximately Solved Problems. 45-64.
Karp, R. M., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Journal of Complexity. 1,
1989
Dagum, P., & Luby M. (1989).  Approximating the Permanent of Graphs with Large Factors.
Karp, R. M., Luby M., & Madras N.. (1989).  Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms. 10(3), 429-448.
Impagliazzo, R., & Luby M. (1989).  One-Way Functions Are Essential for Complexity Based Cryptography (Extended.
Hambrusch, S. E., & Luby M. (1989).  Parallel Asynchronous Connected Components in a Mesh.
Beame, P., & Luby M. (1989).  Parallel Search for Maximal Independence Given Minimal Dependence.
Impagliazzo, R., & Luby M. (1989).  Pseudo-Random Number Generator From ANY One-Way Function.
Luby, M. (1989).  Removing Randomness in Parallel Computation Without a Processor Penalty.
Luby, M., & Rackoff C. (1989).  A Study of Password Security.
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  On the Theory of Average Case Complexity (Revised Edition).
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  Towards a Theory of Average Case Complexity.
1990
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1990).  A Monte-Carlo Algorithm for Estimating the Permanent.
Cleve, R., & Luby M. (1990).  A Note on Self-Testing/Correcting Methods for Trigonometric Functions.
Blum, M. E., Luby M., & Rubinfeld R. (1990).  Self-Testing/Correcting with Applications to Numerical Problems.
1991
Fiat, A., Karp R. M., Luby M., McGeoch L.. A., Sleator D.. D., & Young N.. E. (1991).  Competitive paging algorithms. Journal of Algorithms. 12(4), 685-699.
Hastad, J.., Impagliazzo R., Levin L. A., & Luby M. (1991).  Construction of a Pseudo-Random Generator from Any One-Way Function.
Blum, M. E., Luby M., & Rubinfeld R. (1991).  Self-Testing/Correcting with Applications to Numerical Problems (Revised Version).
1992
Karp, R. M., Luby M., & der Heide F. Meyer auf (1992).  Efficient PRAM simulation on a distributed memory machine. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. 318-326.
Herzberg, A., & Luby M. (1992).  Public Randomness in Cryptography.
1993
Luby, M., & Velickovic B. (1993).  On Deterministic Approximation of DNF.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1993).  Efficient PRAM Simulation on a Distributed Memory Machine.
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1993).  A Monte-Carlo algorithm for estimating the permanent. SIAM Journal on Computing. 22(2), 284-293.

Pages