Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-6
|
Results: 6
The query complexity of finding local minima in the lattice
Authors:
Beimel, A Geller, F Kushilevitz, E
Citation:
A. Beimel et al., The query complexity of finding local minima in the lattice, INF COMPUT, 171(1), 2001, pp. 69-83
Learning functions represented as multiplicity automata
Authors:
Beimel, A Bergadano, F Bshouty, NH Kushilevitz, E Varricchio, S
Citation:
A. Beimel et al., Learning functions represented as multiplicity automata, J ACM, 47(3), 2000, pp. 506-530
Computing functions of a shared secret
Authors:
Beimel, A Burmester, M Desmedt, Y Kushilevitz, E
Citation:
A. Beimel et al., Computing functions of a shared secret, SIAM J DISC, 13(3), 2000, pp. 324-345
Learning unions of high-dimensional boxes over the reals
Authors:
Beimel, A Kushilevitz, E
Citation:
A. Beimel et E. Kushilevitz, Learning unions of high-dimensional boxes over the reals, INF PROCESS, 73(5-6), 2000, pp. 213-220
Reliable communication over partially authenticated networks
Authors:
Beimel, A Franklin, M
Citation:
A. Beimel et M. Franklin, Reliable communication over partially authenticated networks, THEOR COMP, 220(1), 1999, pp. 185-210
On arithmetic branching programs
Authors:
Beimel, A Gal, A
Citation:
A. Beimel et A. Gal, On arithmetic branching programs, J COMPUT SY, 59(2), 1999, pp. 195-220
Risultati:
1-6
|