E-LIB Suche - Ergebnisse für: Alon, N.

1

Number on the Forehead Protocols yielding dense Ruzsa–Szeme..:

Alon, N. ; Shraibman, A.
Acta Mathematica Hungarica. 161 (2020) 2 - p. 488-506 , 2020

Link: https://doi.org/10.1007/..

2

Sign rank versus Vapnik-Chervonenkis dimension:

Alon, N ; Moran, Sh ; Yehudayoff, A
Sbornik: Mathematics. 208 (2017) 12 - p. 1724-1757 , 2017

Link: https://doi.org/10.1070/..

3

WS01.2 TOBI ® for eradication of early P. aeruginosa infect..:

Ratien, F. ; Alon, N. ; Maykut, R...
Journal of Cystic Fibrosis. 15 (2016) - p. S1 , 2016

Link: https://doi.org/10.1016/..

4

Magnetic micro-device for manipulating PC12 cell migration ..:

Alon, N. ; Havdala, T. ; Skaat, H....
Lab on a Chip. 15 (2015) 9 - p. 2030-2036 , 2015

Link: https://doi.org/10.1039/..

5

NGF-conjugated iron oxide nanoparticles promote differentia..:

Marcus, M. ; Skaat, H. ; Alon, N...
Nanoscale. 7 (2015) 3 - p. 1058-1066 , 2015

Link: https://doi.org/10.1039/..

6

Measures of pseudorandomness for finite sequences: typical ..:

Alon, N. ; Kohayakawa, Y. ; Mauduit, C...
Proceedings of the London Mathematical Society. 95 (2007) 3 - p. 778-812 , 2007

Link: https://doi.org/10.1112/..

7

Measures of Pseudorandomness for Finite Sequences: Minimal ..:

ALON, N. ; KOHAYAKAWA, Y. ; MAUDUIT, C...
Combinatorics, Probability and Computing. 15 (2006) 1-2 - p. 1 , 2006

Link: https://doi.org/10.1017/..

8

Explicit construction of linear sized tolerant networks:

Alon, N. ; Chung, F.R.K.
Discrete Mathematics. 306 (2006) 10-11 - p. 1068-1071 , 2006

Link: https://doi.org/10.1016/..

9

Graph Products, Fourier Analysis and Spectral Techniques:

Alon, N. ; Dinur, I. ; Friedgut, E..
Geometric And Functional Analysis. 14 (2004) 5 - p. 913-940 , 2004

Link: https://doi.org/10.1007/..

10

Dense graphs are antimagic:

Alon, N. ; Kaplan, G. ; Lev, A...
Journal of Graph Theory. 47 (2004) 4 - p. 297-309 , 2004

Link: https://doi.org/10.1002/..

11

Smaller explicit superconcentrators:

, In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms,

Alon, N. ; Capalbo, M. - p. 340-346 , 2003

Link: https://dl.acm.org/doi/1..

12

A Ramsey‐type problem and the Turán numbers*:

Alon, N. ; Erdős, P. ; Gunderson, D. S..
Journal of Graph Theory. 40 (2002) 2 - p. 120-129 , 2002

Link: https://doi.org/10.1002/..

13

On the Complexity of Arrangements of Circles in the Plane:

Alon, N. ; Last, H. ; Pinchasi, R..
Discrete & Computational Geometry. 26 (2001) 4 - p. 465-492 , 2001

Link: https://doi.org/10.1007/..

14

Semi-direct product in groups and zig-zag product in graphs..:

, In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science,

Alon, N. ; Lubotzky, A. ; Wigderson, A. - p. 630,631,632,633,634,635,636,637 , 2001

Link: https://doi.org/10.1109/..

15

Testing subgraphs in large graphs:

, In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science,

Alon, N. - p. 434,435,436,437,438,439,440,441 , 2001

Link: https://doi.org/10.1109/..