AAAAAA

   
Results: 1-13 |
Results: 13
NON-EXPANSIVE HASHING
Authors: LINIAL N SASSON O
Citation: N. Linial et O. Sasson, NON-EXPANSIVE HASHING, Combinatorica, 18(1), 1998, pp. 121-132
FAULT-TOLERANT COMPUTATION IN THE FULL INFORMATION MODEL
Authors: GOLDREICH O GOLDWASSER S LINIAL N
Citation: O. Goldreich et al., FAULT-TOLERANT COMPUTATION IN THE FULL INFORMATION MODEL, SIAM journal on computing, 27(2), 1998, pp. 506-544
LOW DISTORTION EUCLIDEAN EMBEDDINGS OF TREES
Authors: LINIAL N MAGEN A SAKS ME
Citation: N. Linial et al., LOW DISTORTION EUCLIDEAN EMBEDDINGS OF TREES, Israel Journal of Mathematics, 106, 1998, pp. 339-348
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
GLOBAL SELF-ORGANIZATION OF ALL KNOWN PROTEIN SEQUENCES REVEALS INHERENT BIOLOGICAL SIGNATURES
Authors: LINIAL M LINIAL N TISHBY N YONA G
Citation: M. Linial et al., GLOBAL SELF-ORGANIZATION OF ALL KNOWN PROTEIN SEQUENCES REVEALS INHERENT BIOLOGICAL SIGNATURES, Journal of Molecular Biology, 268(2), 1997, pp. 539-556
CENTRAL POINTS FOR SETS IN R(N) (OR - THE CHOCOLATE ICE-CREAM PROBLEM)
Authors: HOORY S LINIAL N
Citation: S. Hoory et N. Linial, CENTRAL POINTS FOR SETS IN R(N) (OR - THE CHOCOLATE ICE-CREAM PROBLEM), Discrete & computational geometry, 15(4), 1996, pp. 467-479
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
ON THE POTENTIAL OF MOLECULAR COMPUTING
Authors: LINIAL M LINIAL N
Citation: M. Linial et N. Linial, ON THE POTENTIAL OF MOLECULAR COMPUTING, Science, 268(5210), 1995, pp. 481-481
ON THE DISTANCE DISTRIBUTION OF CODES
Authors: KALAI G LINIAL N
Citation: G. Kalai et N. Linial, ON THE DISTANCE DISTRIBUTION OF CODES, IEEE transactions on information theory, 41(5), 1995, pp. 1467-1472
LOCAL AND GLOBAL CLIQUE NUMBERS
Authors: LINIAL N RABINOVICH Y
Citation: N. Linial et Y. Rabinovich, LOCAL AND GLOBAL CLIQUE NUMBERS, J COMB TH B, 61(1), 1994, pp. 5-15
ON CONVEX BODY CHASING
Authors: FRIEDMAN J LINIAL N
Citation: J. Friedman et N. Linial, ON CONVEX BODY CHASING, Discrete & computational geometry, 9(3), 1993, pp. 293-321
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
CONSTANT DEPTH CIRCUITS, FOURIER-TRANSFORM, AND LEARNABILITY
Authors: LINIAL N MANSOUR Y NISAN N
Citation: N. Linial et al., CONSTANT DEPTH CIRCUITS, FOURIER-TRANSFORM, AND LEARNABILITY, Journal of the Association for Computing Machinery, 40(3), 1993, pp. 607-620
Risultati: 1-13 |