Citation: S. Homer et M. Peinado, DESIGN AND PERFORMANCE OF PARALLEL AND DISTRIBUTED APPROXIMATION ALGORITHMS FOR MAXCUT, Journal of parallel and distributed computing, 46(1), 1997, pp. 48-61
Citation: Zx. Chen et S. Homer, THE BOUNDED INJURY PRIORITY METHOD AND THE LEARNABILITY OF UNIONS OF RECTANGLES, Annals of pure and applied Logic, 77(2), 1996, pp. 143-168
Citation: S. Homer, 8TH ANNUAL CONFERENCE ON STRUCTURE IN COMPLEXITY THEORY 1993 - FOREWORD, Journal of computer and system sciences, 53(2), 1996, pp. 153-153
Citation: E. Allender et al., ALMOST-EVERYWHERE COMPLEXITY HIERARCHIES FOR NONDETERMINISTIC TIME, Theoretical computer science, 115(2), 1993, pp. 225-241