default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoy Meshulam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j32]Wojtek Chacholski, Ran Levi
, Roy Meshulam:
On the topology of complexes of injective words. J. Appl. Comput. Topol. 4(1): 29-44 (2020)
2010 – 2019
- 2019
- [i2]Irit Dinur, Roy Meshulam:
Near Coverings and Cosystolic Expansion - an example of topological property testing. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j31]Imre Bárány, Roy Meshulam, Eran Nevo, Martin Tancer:
Pach's Selection Theorem Does Not Admit a Topological Extension. Discret. Comput. Geom. 60(2): 420-429 (2018) - 2017
- [j30]Amir Abu-Fraiha, Roy Meshulam:
Betti numbers of complexes with highly connected links. J. Comb. Theory A 147: 27-40 (2017) - 2013
- [j29]Lior Aronshtam, Nathan Linial, Tomasz Luczak, Roy Meshulam:
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. Discret. Comput. Geom. 49(2): 317-334 (2013) - 2011
- [j28]Shachar Lovett, Roy Meshulam, Alex Samorodnitsky:
Inverse Conjecture for the Gowers Norm is False. Theory Comput. 7(1): 131-145 (2011) - 2010
- [j27]Nathan Linial, Roy Meshulam, M. Rosenthal:
Sum Complexes - a New Family of Hypertrees. Discret. Comput. Geom. 44(3): 622-636 (2010)
2000 – 2009
- 2009
- [j26]Roy Meshulam, N. Wallach:
Homological connectivity of random k-dimensional complexes. Random Struct. Algorithms 34(3): 408-417 (2009) - 2008
- [j25]Roy Meshulam:
On the Homological Dimension of Lattices. Order 25(2): 153-155 (2008) - [c3]Shachar Lovett, Roy Meshulam, Alex Samorodnitsky:
Inverse conjecture for the gowers norm is false. STOC 2008: 547-556 - 2007
- [i1]Shachar Lovett, Roy Meshulam, Alex Samorodnitsky:
Inverse Conjecture for the Gowers norm is false. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j24]Nathan Linial, Roy Meshulam:
Homological Connectivity Of Random 2-Complexes. Comb. 26(4): 475-487 (2006) - [j23]Roy Meshulam:
An uncertainty inequality for finite abelian groups. Eur. J. Comb. 27(1): 63-67 (2006) - [j22]Gil Kalai, Roy Meshulam:
Intersections of Leray complexes and regularity of monomial ideals. J. Comb. Theory A 113(7): 1586-1592 (2006) - 2004
- [j21]Roy Meshulam, Avi Wigderson:
Expanders In Group Algebras. Comb. 24(4): 659-680 (2004) - [j20]Endre Boros, Vladimir Gurvich, Roy Meshulam:
Difference graphs. Discret. Math. 276(1-3): 59-64 (2004) - 2003
- [j19]Roy Meshulam:
Domination numbers and homology. J. Comb. Theory A 102(2): 321-330 (2003) - 2002
- [j18]Noga Alon, Gil Kalai, Jirí Matousek, Roy Meshulam:
Transversal numbers for hypergraphs arising in geometry. Adv. Appl. Math. 29(1): 79-101 (2002) - [j17]Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam:
Fractional Planks. Discret. Comput. Geom. 27(4): 585-602 (2002) - [j16]Boaz Gelbord, Roy Meshulam:
Spaces of Singular Matrices and Matroid Parity. Eur. J. Comb. 23(4): 389-397 (2002) - [c2]Roy Meshulam, Avi Wigderson:
Expanders from Symmetric Codes. CCC 2002: 16 - [c1]Roy Meshulam, Avi Wigderson:
Expanders from symmetric codes. STOC 2002: 669-677 - 2001
- [j15]Roy Meshulam:
The Clique Complex and Hypergraph Matching. Comb. 21(1): 89-94 (2001)
1990 – 1999
- 1996
- [j14]Endre Boros, Roy Meshulam:
On the number of flats spanned by a set of points in PG(d, q). Discret. Math. 150(1-3): 407-409 (1996) - [j13]Roy Meshulam:
On products of projections. Discret. Math. 154(1-3): 307-310 (1996) - 1995
- [j12]Roy Meshulam:
On Subsets of Finite Abelian Groups with No 3-Term Arithmetic Progressions. J. Comb. Theory A 71(1): 168-172 (1995) - 1994
- [j11]Meir Katchalski, Roy Meshulam:
An Extremal Problem for Families of Pairs of Subspaces. Eur. J. Comb. 15(3): 253-257 (1994) - 1993
- [j10]Yitzhak Birk, Nathan Linial, Roy Meshulam:
On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels. IEEE Trans. Inf. Theory 39(1): 186-191 (1993) - 1992
- [j9]Roy Meshulam:
An uncertainty inequality for groups of order pq. Eur. J. Comb. 13(5): 401-407 (1992) - [j8]Roy Meshulam:
On families of faces in discrete cubes. Graphs Comb. 8(3): 287-289 (1992) - 1991
- [j7]Jeff Kahn, Roy Meshulam:
On mod p transversals. Comb. 11(1): 17-22 (1991) - [j6]Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer:
Set systems with no union of cardinality 0 modulom. Graphs Comb. 7(2): 97-99 (1991) - [j5]Noga Alon, Nathan Linial, Roy Meshulam:
Additive bases of vector spaces over prime fields. J. Comb. Theory A 57(2): 203-210 (1991) - 1990
- [j4]Roy Meshulam:
An uncertainty inequality and zero subsums. Discret. Math. 84(2): 197-200 (1990)
1980 – 1989
- 1988
- [j3]Nathan Linial, Roy Meshulam, Michael Tarsi:
Matroidal bijections between graphs. J. Comb. Theory B 45(1): 31-44 (1988) - 1987
- [b1]Roy Meshulam:
בעיות בקומבינטוריקה אלגברית (Problems in algebraic combinatorics.). Hebrew University of Jerusalem, Israel, 1987 - 1985
- [j2]Roy Meshulam:
On Multi-coloured Lines in a Linear Space. J. Comb. Theory A 40(1): 150-155 (1985) - 1984
- [j1]Roy Meshulam:
A Geometric Construction of a Superconcentrator of Depth 2. Theor. Comput. Sci. 32: 215-219 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
