Searching for authors named "Noga Alon" – sorted by Relevance.
-
unknown title
- Large sets in finite fields are sumsets Noga Alon ∗ Abstract For a prime p, a subset S of Zp is a
- Add To MetaCart
-
Degrees and
- Degrees and choice numbers Noga Alon ∗ Abstract The choice number ch(G) of a graph G = (V, E
- Add To MetaCart
-
Voting
- Voting paradoxes and digraphs realizations Noga Alon ∗ Abstract A family of permutations F forms a
- Add To MetaCart
-
Spectral Techniques in Graph Algorithms
- Spectral Techniques in Graph Algorithms Noga Alon ∗ Abstract The existence of efficient algorithms
- Cited by 14 (2 self) – Add To MetaCart
-
Voting Paradoxes and Digraphs Realizations
- Voting paradoxes and digraphs realizations Noga Alon Abstract A family of permutations F forms a
- Cited by 3 (2 self) – Add To MetaCart
-
Packing of partial designs
- Packing of partial designs Noga Alon Bellcore, Morristown, NJ 07960, USA and Department
- Cited by 1 (0 self) – Add To MetaCart
-
Probabilistic Methods in Extremal Finite Set Theory
- Probabilistic Methods in Extremal Finite Set Theory Noga Alon ∗ Department of Mathematics Raymond
- Cited by 10 (3 self) – Add To MetaCart
-
On the Capacity of Digraphs
- On the Capacity of Digraphs Noga Alon ∗ Abstract For a digraph G = (V, E) let w(G n ) denote
- Cited by 6 (2 self) – Add To MetaCart
-
Piercing d-intervals
- Piercing d-intervals Noga Alon ∗ Abstract A (homogeneous) d-interval is a union of d closed
- Cited by 3 (0 self) – Add To MetaCart
-
Neighborly families of boxes and bipartite coverings, in: The Mathematics of Paul Erdős
- Neighborly families of boxes and bipartite coverings Noga Alon ∗ Dedicated to Professor Paul Erdős
- Cited by 1 (0 self) – Add To MetaCart

