AAAAAA

   
Results: 1-13 |
Results: 13
DESIGN AND PERFORMANCE OF PARALLEL AND DISTRIBUTED APPROXIMATION ALGORITHMS FOR MAXCUT
Authors: HOMER S PEINADO M
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
LEARNING COUNTING FUNCTIONS WITH QUERIES
Authors: CHEN ZX HOMER S
Citation: Zx. Chen et S. Homer, LEARNING COUNTING FUNCTIONS WITH QUERIES, Theoretical computer science, 180(1-2), 1997, pp. 155-168
GLOBAL MODERNITIES - FEATHERSTONE,M, LASH,S, ROBERTSON,R
Authors: HOMER S
Citation: S. Homer, GLOBAL MODERNITIES - FEATHERSTONE,M, LASH,S, ROBERTSON,R, Habitat international, 21(1), 1997, pp. 129-130
ORACLES THAT COMPUTE VALUES
Authors: FENNER S HOMER S OGIHARA M SELMAN A
Citation: S. Fenner et al., ORACLES THAT COMPUTE VALUES, SIAM journal on computing, 26(4), 1997, pp. 1043-1065
GLOBAL VILLAGE THAT FITS IN A NOTEBOOK
Authors: HOMER S
Citation: S. Homer, GLOBAL VILLAGE THAT FITS IN A NOTEBOOK, New scientist, 151(2049), 1996, pp. 22-22
THE BOUNDED INJURY PRIORITY METHOD AND THE LEARNABILITY OF UNIONS OF RECTANGLES
Authors: CHEN ZX HOMER S
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
8TH ANNUAL CONFERENCE ON STRUCTURE IN COMPLEXITY THEORY 1993 - FOREWORD
Authors: HOMER S
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
SCALABILITY AND THE ISOMORPHISM-PROBLEM
Authors: GOLDSMITH J HOMER S
Citation: J. Goldsmith et S. Homer, SCALABILITY AND THE ISOMORPHISM-PROBLEM, Information processing letters, 57(3), 1996, pp. 137-143
IMMUNITY OF COMPLETE PROBLEMS
Authors: HOMER S WANG J
Citation: S. Homer et J. Wang, IMMUNITY OF COMPLETE PROBLEMS, Information and computation, 110(1), 1994, pp. 119-129
MINIMAL PAIRS AND COMPLETE PROBLEMS
Authors: AMBOSSPIES K HOMER S SOARE RI
Citation: K. Ambosspies et al., MINIMAL PAIRS AND COMPLETE PROBLEMS, Theoretical computer science, 132(1-2), 1994, pp. 229-241
ON REDUCTIONS OF NP SETS TO SPARSE SETS
Authors: HOMER S LONGPRE L
Citation: S. Homer et L. Longpre, ON REDUCTIONS OF NP SETS TO SPARSE SETS, Journal of computer and system sciences, 48(2), 1994, pp. 324-336
ALMOST-EVERYWHERE COMPLEXITY HIERARCHIES FOR NONDETERMINISTIC TIME
Authors: ALLENDER E BEIGEL R HERTRAMPF U HOMER S
Citation: E. Allender et al., ALMOST-EVERYWHERE COMPLEXITY HIERARCHIES FOR NONDETERMINISTIC TIME, Theoretical computer science, 115(2), 1993, pp. 225-241
ON 1-TRUTH-TABLE-HARD LANGUAGES
Authors: HOMER S KURTZ S ROYER J
Citation: S. Homer et al., ON 1-TRUTH-TABLE-HARD LANGUAGES, Theoretical computer science, 115(2), 1993, pp. 383-389
Risultati: 1-13 |