ACNP - Italian Periodicals Catalogue

AAAAAA

ITA
ENG

Results: 1-13 |

Results: 13

EXPLICIT OR-DISPERSERS WITH POLYLOGARITHMIC DEGREE

Authors: SAKS M SRINIVASAN A ZHOU SY

Citation: M. Saks et al., EXPLICIT OR-DISPERSERS WITH POLYLOGARITHMIC DEGREE, JOURNAL OF THE ACM, 45(1), 1998, pp. 123-154

EFFICIENT CONSTRUCTION OF A SMALL HITTING SET FOR COMBINATORIAL RECTANGLES IN HIGH DIMENSION

Authors: LINIAL N LUBY M SAKS M ZUCKERMAN D

Citation: N. Linial et al., EFFICIENT CONSTRUCTION OF A SMALL HITTING SET FOR COMBINATORIAL RECTANGLES IN HIGH DIMENSION, Combinatorica, 17(2), 1997, pp. 215-234

LOCAL-MANAGEMENT OF A GLOBAL RESOURCE IN A COMMUNICATION-NETWORK

Authors: AFEK Y AWERBUCH B PLOTKIN S SAKS M

Citation: Y. Afek et al., LOCAL-MANAGEMENT OF A GLOBAL RESOURCE IN A COMMUNICATION-NETWORK, Journal of the ACM, 43(1), 1996, pp. 1-19

GLUCOSAMINE DOWN-REGULATES HEXOSE-TRANSPORT RATE BUT NOT GLUT1 CONTENT IN CULTURED MURINE FIBROBLASTS

Authors: ORTIZ P BURROWES S CALABRESE J SAKS M

Citation: P. Ortiz et al., GLUCOSAMINE DOWN-REGULATES HEXOSE-TRANSPORT RATE BUT NOT GLUT1 CONTENT IN CULTURED MURINE FIBROBLASTS, The FASEB journal, 10(3), 1996, pp. 4190-4190

WITNESS SETS FOR FAMILIES OF BINARY VECTORS

Authors: KUSHILEVITZ E LINIAL N RABINOVICH Y SAKS M

Citation: E. Kushilevitz et al., WITNESS SETS FOR FAMILIES OF BINARY VECTORS, J COMB TH A, 73(2), 1996, pp. 376-380

23RD SYMPOSIUM ON THE THEORY OF COMPUTING MAY 6-8, 1991 - FOREWORD

Authors: HALPERN J AWERBUCH B BENOR M CHANDRA A FEIGENBAUM J VONZURGATHEN J GUIBAS L PITT L SAKS M SHMOYS D SLEATOR D UPFAL E VAZIRANI U YAO A

Citation: J. Halpern et al., 23RD SYMPOSIUM ON THE THEORY OF COMPUTING MAY 6-8, 1991 - FOREWORD, Journal of computer and system sciences, 50(2), 1995, pp. 189-189

COMPARISON OF MINIMALLY INVASIVE SURGERY AND LAPAROTOMY IN THE TREATMENT OF ADNEXAL MASSES

Authors: DECKARDT R SAKS M GRAEFF H

Citation: R. Deckardt et al., COMPARISON OF MINIMALLY INVASIVE SURGERY AND LAPAROTOMY IN THE TREATMENT OF ADNEXAL MASSES, The Journal of the American Association of Gynecologic Laparoscopists, 1(4), 1994, pp. 333-338

A COMPLEXITY INDEX FOR SATISFIABILITY PROBLEMS

Authors: BOROS E CRAMA Y HAMMER PL SAKS M

Citation: E. Boros et al., A COMPLEXITY INDEX FOR SATISFIABILITY PROBLEMS, SIAM journal on computing, 23(1), 1994, pp. 45-49

NONDETERMINISTIC COMMUNICATION COMPLEXITY WITH FEW WITNESSES

Authors: KARCHMER M NEWMAN I SAKS M WIGDERSON A NEWMAN I SAKS M WIGDERSON A

Citation: M. Karchmer et al., NONDETERMINISTIC COMMUNICATION COMPLEXITY WITH FEW WITNESSES, Journal of computer and system sciences, 49(2), 1994, pp. 247-257

THE NUMBER OF DISTINCT SUBSET SUMS OF A FINITE-SET OF VECTORS

Authors: BRICKELL E SAKS M

Citation: E. Brickell et M. Saks, THE NUMBER OF DISTINCT SUBSET SUMS OF A FINITE-SET OF VECTORS, J COMB TH A, 63(2), 1993, pp. 234-256

LAPAROSCOPIC THERAPY FOR TUBAL PREGNANCY USING PROSTAGLANDINS

Authors: DECKARDT R SAKS M GRAFF H

Citation: R. Deckardt et al., LAPAROSCOPIC THERAPY FOR TUBAL PREGNANCY USING PROSTAGLANDINS, Journal of reproductive medicine, 38(8), 1993, pp. 587-591

COMMUNICATION COMPLEXITY AND COMBINATORIAL LATTICE THEORY

Authors: LOVASZ L SAKS M

Citation: L. Lovasz et M. Saks, COMMUNICATION COMPLEXITY AND COMBINATORIAL LATTICE THEORY, Journal of computer and system sciences, 47(2), 1993, pp. 322-349

COMBINATORIAL CHARACTERIZATION OF READ-ONCE FORMULAS

Authors: KARCHMER M LINIAL N NEWMAN I SAKS M WIGDERSON A

Citation: M. Karchmer et al., COMBINATORIAL CHARACTERIZATION OF READ-ONCE FORMULAS, Discrete mathematics, 114(1-3), 1993, pp. 275-282

Risultati: 1-13 |