Roy Meshulam

Orcid: 0000-0003-3804-4300

According to our database1, Roy Meshulam authored at least 35 papers between 1984 and 2020.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
On the topology of complexes of injective words.
J. Appl. Comput. Topol., 2020

2019
Near Coverings and Cosystolic Expansion - an example of topological property testing.
Electron. Colloquium Comput. Complex., 2019

2018
Pach's Selection Theorem Does Not Admit a Topological Extension.
Discret. Comput. Geom., 2018

2017
Betti numbers of complexes with highly connected links.
J. Comb. Theory, Ser. A, 2017

2013
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes.
Discret. Comput. Geom., 2013

2011
Inverse Conjecture for the Gowers Norm is False.
Theory Comput., 2011

2010
Sum Complexes - a New Family of Hypertrees.
Discret. Comput. Geom., 2010

2009
Homological connectivity of random <i>k</i>-dimensional complexes.
Random Struct. Algorithms, 2009

2008
On the Homological Dimension of Lattices.
Order, 2008

2006
Intersections of Leray complexes and regularity of monomial ideals.
J. Comb. Theory, Ser. A, 2006

An uncertainty inequality for finite abelian groups.
Eur. J. Comb., 2006

Homological Connectivity Of Random 2-Complexes.
Comb., 2006

2004
Difference graphs.
Discret. Math., 2004

Expanders In Group Algebras.
Comb., 2004

2003
Domination numbers and homology.
J. Comb. Theory, Ser. A, 2003

2002
Spaces of Singular Matrices and Matroid Parity.
Eur. J. Comb., 2002

Fractional Planks.
Discret. Comput. Geom., 2002

Transversal numbers for hypergraphs arising in geometry.
Adv. Appl. Math., 2002

Expanders from symmetric codes.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001
The Clique Complex and Hypergraph Matching.
Comb., 2001

1996
On products of projections.
Discret. Math., 1996

On the number of flats spanned by a set of points in PG(d, q).
Discret. Math., 1996

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

1994
An Extremal Problem for Families of Pairs of Subspaces.
Eur. J. Comb., 1994

1993
On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels.
IEEE Trans. Inf. Theory, 1993

1992
On families of faces in discrete cubes.
Graphs Comb., 1992

An uncertainty inequality for groups of order pq.
Eur. J. Comb., 1992

1991
Additive bases of vector spaces over prime fields.
J. Comb. Theory, Ser. A, 1991

Set systems with no union of cardinality 0 modulo<i>m</i>.
Graphs Comb., 1991

On mod p transversals.
Comb., 1991

1990
An uncertainty inequality and zero subsums.
Discret. Math., 1990

1988
Matroidal bijections between graphs.
J. Comb. Theory, Ser. B, 1988

1987
בעיות בקומבינטוריקה אלגברית (Problems in algebraic combinatorics.).
PhD thesis, 1987

1985
On Multi-coloured Lines in a Linear Space.
J. Comb. Theory, Ser. A, 1985

1984
A Geometric Construction of a Superconcentrator of Depth 2.
Theor. Comput. Sci., 1984


  Loading...