A Geometric Construction of a Superconcentrator of Depth 2. - Roy Meshulam (Theor. Comput. Sci., 1984)

On Multi-coloured Lines in a Linear Space. - Roy Meshulam (J. Comb. Theory A, 1985)

בעיות בקומבינטוריקה אלגברית (Problems in algebraic combinatorics.). - Roy Meshulam (1987)

Matroidal bijections between graphs. - Nathan Linial; Roy Meshulam; Michael Tarsi (J. Comb. Theory B, 1988)

An uncertainty inequality and zero subsums. - Roy Meshulam (Discret. Math., 1990)

On mod p transversals. - Jeff Kahn 001; Roy Meshulam (Comb., 1991)

Set systems with no union of cardinality 0 modulom. - Noga Alon; Daniel J. Kleitman; Richard J. Lipton; Roy Meshulam; Michael O. Rabin; Joel H. Spencer (Graphs Comb., 1991)

Additive bases of vector spaces over prime fields. - Noga Alon; Nathan Linial; Roy Meshulam (J. Comb. Theory A, 1991)

An uncertainty inequality for groups of order pq. - Roy Meshulam (Eur. J. Comb., 1992)

On families of faces in discrete cubes. - Roy Meshulam (Graphs Comb., 1992)

On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels. - Yitzhak Birk; Nathan Linial; Roy Meshulam (IEEE Trans. Inf. Theory, 1993)

An Extremal Problem for Families of Pairs of Subspaces. - Meir Katchalski; Roy Meshulam (Eur. J. Comb., 1994)

On Subsets of Finite Abelian Groups with No 3-Term Arithmetic Progressions. - Roy Meshulam (J. Comb. Theory A, 1995)

On the number of flats spanned by a set of points in PG(d, q). - Endre Boros; Roy Meshulam (Discret. Math., 1996)

On products of projections. - Roy Meshulam (Discret. Math., 1996)

The Clique Complex and Hypergraph Matching. - Roy Meshulam (Comb., 2001)

Expanders from symmetric codes. - Roy Meshulam; Avi Wigderson (STOC, 2002)

Transversal numbers for hypergraphs arising in geometry. - Noga Alon; Gil Kalai; Jirí Matousek 001; Roy Meshulam (Adv. Appl. Math., 2002)

Fractional Planks. - Ron Aharoni; Ron Holzman; Michael Krivelevich; Roy Meshulam (Discret. Comput. Geom., 2002)

Spaces of Singular Matrices and Matroid Parity. - Boaz Gelbord; Roy Meshulam (Eur. J. Comb., 2002)

Domination numbers and homology. - Roy Meshulam (J. Comb. Theory A, 2003)

Expanders In Group Algebras. - Roy Meshulam; Avi Wigderson (Comb., 2004)

Difference graphs. - Endre Boros; Vladimir Gurvich; Roy Meshulam (Discret. Math., 2004)

Homological Connectivity Of Random 2-Complexes. - Nathan Linial; Roy Meshulam (Comb., 2006)

An uncertainty inequality for finite abelian groups. - Roy Meshulam (Eur. J. Comb., 2006)

Intersections of Leray complexes and regularity of monomial ideals. - Gil Kalai; Roy Meshulam (J. Comb. Theory A, 2006)

Inverse Conjecture for the Gowers norm is false. - Shachar Lovett; Roy Meshulam; Alex Samorodnitsky (Electron. Colloquium Comput. Complex., 2007)

On the Homological Dimension of Lattices. - Roy Meshulam (Order, 2008)

Homological connectivity of random k-dimensional complexes. - Roy Meshulam; N. Wallach (Random Struct. Algorithms, 2009)

Sum Complexes - a New Family of Hypertrees. - Nathan Linial; Roy Meshulam; M. Rosenthal (Discret. Comput. Geom., 2010)

Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. - Lior Aronshtam; Nathan Linial; Tomasz Luczak 001; Roy Meshulam (Discret. Comput. Geom., 2013)

Betti numbers of complexes with highly connected links. - Amir Abu-Fraiha; Roy Meshulam (J. Comb. Theory A, 2017)

Pach's Selection Theorem Does Not Admit a Topological Extension. - Imre Bárány; Roy Meshulam; Eran Nevo; Martin Tancer (Discret. Comput. Geom., 2018)

Near Coverings and Cosystolic Expansion - an example of topological property testing. - Irit Dinur; Roy Meshulam (Electron. Colloquium Comput. Complex., 2019)

On the topology of complexes of injective words. - Wojtek Chacholski; Ran Levi; Roy Meshulam (J. Appl. Comput. Topol., 2020)

Random balanced Cayley complexes. - Roy Meshulam (J. Appl. Comput. Topol., 2024)