Sledovat
Nati Linial
Nati Linial
Professor of Computer Science, The Hebrew University of Jerusalem
E-mailová adresa ověřena na: cs.huji.ac.il - Domovská stránka
Název
Citace
Citace
Rok
Expander graphs and their applications
S Hoory, N Linial, A Wigderson
Bulletin of the American Mathematical Society 43 (4), 439-561, 2006
22102006
The geometry of graphs and some of its algorithmic applications
N Linial, E London, Y Rabinovich
Combinatorica 15, 215-245, 1995
13211995
Locality in distributed graph algorithms
N Linial
SIAM Journal on computing 21 (1), 193-201, 1992
9781992
Constant depth circuits, Fourier transform, and learnability
N Linial, Y Mansour, N Nisan
Journal of the ACM (JACM) 40 (3), 607-620, 1993
9031993
The influence of variables on Boolean functions
J Kahn, G Kalai, N Linial
Institute for Mathematical Studies in the Social Sciences, 1989
8781989
An optimal on-line algorithm for metrical task system
A Borodin, N Linial, ME Saks
Journal of the ACM (JACM) 39 (4), 745-763, 1992
6241992
Collective coin flipping, robust voting schemes and minima of Banzhaf values
M Ben-Or, N Linial
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 408-416, 1985
4161985
A lower bound for radio broadcast
N Alon, A Bar-Noy, N Linial, D Peleg
Journal of Computer and System Sciences 43 (2), 290-298, 1991
4071991
Homological connectivity of random 2-complexes
N Linial*, R Meshulam*
Combinatorica 26 (4), 475-487, 2006
3152006
Lifts, discrepancy and nearly optimal spectral gap
Y Bilu, N Linial
Combinatorica 26 (5), 495-519, 2006
2702006
On the hardness of approximating the chromatic number
S Khanna, N Linial, S Safra
Combinatorica 20 (3), 393-415, 2000
2692000
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
N Linial, A Samorodnitsky, A Wigderson
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
2461998
Group connectivity of graphs—a nonhomogeneous analogue of nowhere-zero flow properties
F Jaeger, N Linial, C Payan, M Tarsi
Journal of Combinatorial Theory, Series B 56 (2), 165-182, 1992
2321992
The Moore bound for irregular graphs
N Alon, S Hoory, N Linial
Graphs and Combinatorics 18, 53-57, 2002
2262002
Distributive graph algorithms global solutions from local data
N Linial
28th Annual Symposium on Foundations of Computer Science (sfcs 1987), 331-335, 1987
2251987
Low diameter graph decompositions
N Linial, M Saks
Combinatorica 13 (4), 441-454, 1993
2181993
ProtoMap: automatic classification of protein sequences and hierarchy of protein families
G Yona, N Linial, M Linial
Nucleic acids research 28 (1), 49-55, 2000
2112000
On metric Ramsey-type phenomena
MMAN Y. Bartal, N. Linial
Annals of Mathematics 162, 643-709, 2005
198*2005
Approximate inclusion-exclusion
N Linial, N Nisan
Proceedings of the twenty-second annual ACM symposium on Theory of Computing …, 1990
1941990
Are stable instances easy?
Y Bilu, N Linial
Combinatorics, Probability and Computing 21 (5), 643-660, 2012
1902012
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20