AAAAAA
Results:
1-10
|
Results: 10
Authors:
EVEN G
GOLDREICH O
LUBY M
NISAN N
VELICKOVIC B
Citation: G. Even et al., EFFICIENT APPROXIMATION OF PRODUCT DISTRIBUTIONS, Random structures & algorithms, 13(1), 1998, pp. 1-16
Authors:
MILTERSEN PB
NISAN N
SAFRA S
WIGDERSON A
Citation: Pb. Miltersen et al., ON DATA-STRUCTURES AND ASYMMETRIC COMMUNICATION COMPLEXITY, Journal of computer and system sciences (Print), 57(1), 1998, pp. 37-49
Authors:
NISAN N
WIGDERSON A
Citation: N. Nisan et A. Wigderson, LOWER BOUNDS ON ARITHMETIC CIRCUITS VIA PARTIAL DERIVATIVES, Computational complexity, 6(3), 1997, pp. 217-234
Authors:
NISAN N
ZUCKERMAN D
Citation: N. Nisan et D. Zuckerman, RANDOMNESS IS LINEAR IN-SPACE, Journal of computer and system sciences, 52(1), 1996, pp. 43-52
Authors:
NISAN N
TASHMA A
Citation: N. Nisan et A. Tashma, SYMMETRICAL LOGSPACE IS CLOSED UNDER COMPLEMENT, Chicago journal of theoretical computer science, 1(1), 1995, pp. 1-11
Authors:
KARCHMER M
KUSHILEVITZ E
NISAN N
Citation: M. Karchmer et al., FRACTIONAL COVERS AND COMMUNICATION COMPLEXITY, SIAM journal on discrete mathematics, 8(1), 1995, pp. 76-92
Authors:
FEDER T
KUSHILEVITZ E
NAOR M
NISAN N
Citation: T. Feder et al., AMORTIZED COMMUNICATION COMPLEXITY, SIAM journal on computing, 24(4), 1995, pp. 736-750
Authors:
NISAN N
WIGDERSON A
Citation: N. Nisan et A. Wigderson, HARDNESS VS RANDOMNESS, Journal of computer and system sciences, 49(2), 1994, pp. 149-167
Authors:
FELDMAN D
IMPAGLIAZZO R
NAOR M
NISAN N
RUDICH S
SHAMIR A
Citation: D. Feldman et al., ON DICE AND COINS - MODELS OF COMPUTATION FOR RANDOM GENERATION, Information and computation, 104(2), 1993, pp. 159-174
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-10
|