| 2008 |
|---|
| 24 | EE | Shachar Lovett,
Roy Meshulam,
Alex Samorodnitsky:
Inverse conjecture for the gowers norm is false.
STOC 2008: 547-556 |
| 23 | EE | Roy Meshulam:
On the Homological Dimension of Lattices.
Order 25(2): 153-155 (2008) |
| 2007 |
|---|
| 22 | EE | Shachar Lovett,
Roy Meshulam,
Alex Samorodnitsky:
Inverse Conjecture for the Gowers norm is false.
Electronic Colloquium on Computational Complexity (ECCC) 14(123): (2007) |
| 2006 |
|---|
| 21 | EE | Nathan Linial,
Roy Meshulam:
Homological Connectivity Of Random 2-Complexes.
Combinatorica 26(4): 475-487 (2006) |
| 20 | EE | Roy Meshulam:
An uncertainty inequality for finite abelian groups.
Eur. J. Comb. 27(1): 63-67 (2006) |
| 19 | EE | Gil Kalai,
Roy Meshulam:
Intersections of Leray complexes and regularity of monomial ideals.
J. Comb. Theory, Ser. A 113(7): 1586-1592 (2006) |
| 2004 |
|---|
| 18 | EE | Roy Meshulam,
Avi Wigderson:
Expanders In Group Algebras.
Combinatorica 24(4): 659-680 (2004) |
| 17 | EE | Endre Boros,
Vladimir Gurvich,
Roy Meshulam:
Difference graphs.
Discrete Mathematics 276(1-3): 59-64 (2004) |
| 2003 |
|---|
| 16 | EE | Roy Meshulam:
Domination numbers and homology.
J. Comb. Theory, Ser. A 102(2): 321-330 (2003) |
| 2002 |
|---|
| 15 | EE | Roy Meshulam,
Avi Wigderson:
Expanders from Symmetric Codes.
IEEE Conference on Computational Complexity 2002: 16 |
| 14 | EE | Roy Meshulam,
Avi Wigderson:
Expanders from symmetric codes.
STOC 2002: 669-677 |
| 13 | EE | Ron Aharoni,
Ron Holzman,
Michael Krivelevich,
Roy Meshulam:
Fractional Planks.
Discrete & Computational Geometry 27(4): 585-602 (2002) |
| 12 | EE | Boaz Gelbord,
Roy Meshulam:
Spaces of Singular Matrices and Matroid Parity.
Eur. J. Comb. 23(4): 389-397 (2002) |
| 2001 |
|---|
| 11 | EE | Roy Meshulam:
The Clique Complex and Hypergraph Matching.
Combinatorica 21(1): 89-94 (2001) |
| 1996 |
|---|
| 10 | EE | Roy Meshulam:
On products of projections.
Discrete Mathematics 154(1-3): 307-310 (1996) |
| 1995 |
|---|
| 9 | | Roy Meshulam:
On Subsets of Finite Abelian Groups with No 3-Term Arithmetic Progressions.
J. Comb. Theory, Ser. A 71(1): 168-172 (1995) |
| 1994 |
|---|
| 8 | EE | Meir Katchalski,
Roy Meshulam:
An Extremal Problem for Families of Pairs of Subspaces.
Eur. J. Comb. 15(3): 253-257 (1994) |
| 1993 |
|---|
| 7 | | Yitzhak Birk,
Nathan Linial,
Roy Meshulam:
On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels.
IEEE Transactions on Information Theory 39(1): 186- (1993) |
| 1991 |
|---|
| 6 | | Jeff Kahn,
Roy Meshulam:
On mod p transversals.
Combinatorica 11(1): 17-22 (1991) |
| 5 | EE | Noga Alon,
Nathan Linial,
Roy Meshulam:
Additive bases of vector spaces over prime fields.
J. Comb. Theory, Ser. A 57(2): 203-210 (1991) |
| 1990 |
|---|
| 4 | EE | Roy Meshulam:
An uncertainty inequality and zero subsums.
Discrete Mathematics 84(2): 197-200 (1990) |
| 1988 |
|---|
| 3 | EE | Nathan Linial,
Roy Meshulam,
Michael Tarsi:
Matroidal bijections between graphs.
J. Comb. Theory, Ser. B 45(1): 31-44 (1988) |
| 1985 |
|---|
| 2 | | Roy Meshulam:
On Multi-coloured Lines in a Linear Space.
J. Comb. Theory, Ser. A 40(1): 150-155 (1985) |
| 1984 |
|---|
| 1 | | Roy Meshulam:
A Geometric Construction of a Superconcentrator of Depth 2.
Theor. Comput. Sci. 32: 215-219 (1984) |
