BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
9 × USA
Collaborated with:
N.Nisan B.Velickovic R.M.Karp E.Vigoda C.Rackoff P.Ragde M.Mitzenmacher M.A.Shokrollahi D.A.Spielman O.Goldreich F.M.a.d.Heide M.Blum R.Rubinfeld R.Impagliazzo L.A.Levin A.Marchetti-Spaccamela N.Linial M.E.Saks D.Zuckerman S.Ben-David B.Chor V.Stemann G.Even
Talks about:
approxim (4) algorithm (3) problem (3) distribut (2) parallel (2) independ (2) generat (2) analysi (2) random (2) pseudo (2)

Person: Michael Luby

DBLP DBLP: Luby:Michael

Contributed to:

STOC 19981998
STOC 19971997
STOC 19931993
STOC 19921992
STOC 19911991
STOC 19901990
STOC 19891989
STOC 19861986
ICALP 19851985
STOC 19851985
STOC 19841984

Wrote 15 papers:

STOC-1998-LubyMSS #analysis #design #graph #using
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs (ML, MM, MAS, DAS), pp. 249–258.
STOC-1997-LubyMSSS
Practical Loss-Resilient Codes (ML, MM, MAS, DAS, VS), pp. 150–159.
STOC-1997-LubyV #approximate
Approximately Counting Up To Four (ML, EV), pp. 682–687.
STOC-1993-LinialLSZ #combinator #performance #set
Efficient construction of a small hitting set for combinatorial rectangles in high dimension (NL, ML, MES, DZ), pp. 258–267.
STOC-1993-LubyN #algorithm #approximate #linear #parallel #programming
A parallel approximation algorithm for positive linear programming (ML, NN), pp. 448–457.
STOC-1992-EvenGLNV #approximate #independence
Approximations of General Independent Distributions (GE, OG, ML, NN, BV), pp. 10–16.
STOC-1992-KarpLH #distributed #memory management #performance #simulation
Efficient PRAM Simulation on a Distributed Memory Machine (RMK, ML, FMadH), pp. 318–326.
STOC-1991-LubyV #approximate #on the
On Deterministic Approximation of DNF (ML, BV), pp. 430–438.
STOC-1990-BlumLR #problem #self
Self-Testing/Correcting with Applications to Numerical Problems (MB, ML, RR), pp. 73–83.
STOC-1989-Ben-DavidCGL #complexity #formal method #on the
On the Theory of Average Case Complexity (SBD, BC, OG, ML), pp. 204–216.
STOC-1989-ImpagliazzoLL #generative #pseudo
Pseudo-random Generation from one-way functions (RI, LAL, ML), pp. 12–24.
STOC-1986-LubyR #composition #encryption #generative #permutation #pseudo
Pseudo-random Permutation Generators and Cryptographic Composition (ML, CR), pp. 356–363.
ICALP-1985-LubyR #algorithm #behaviour #bidirectional
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (ML, PR), pp. 394–403.
STOC-1985-Luby #algorithm #independence #parallel #problem #set
A Simple Parallel Algorithm for the Maximal Independent Set Problem (ML), pp. 1–10.
STOC-1984-KarpLM #analysis #multi #probability #problem
A Probabilistic Analysis of Multidimensional Bin Packing Problems (RMK, ML, AMS), pp. 289–298.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.