default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuy Moshkovitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j7]Guy Moshkovitz, Jeffery Yu:
Sharp Effective Finite-Field Nullstellensatz. Am. Math. Mon. 130(8): 720-727 (2023)- 2021
- [j6]Noga Alon, Guy Moshkovitz:
Limitations on regularity lemmas for clustering graphs. Adv. Appl. Math. 124: 102135 (2021) - 2019
- [j5]Noga Alon, Guy Moshkovitz, Noam Solomon:
Traces of hypergraphs. J. Lond. Math. Soc. 100(2): 498-517 (2019) - 2018
- [j4]Guy Moshkovitz, Asaf Shapira:
Decomposing a graph into expanding subgraphs. Random Struct. Algorithms 52(1): 158-178 (2018) - 2017
- [j3]Reut Levi, Guy Moshkovitz, Dana Ron
, Ronitt Rubinfeld, Asaf Shapira:
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50(2): 183-200 (2017) - 2016
- [j2]Guy Moshkovitz, Asaf Shapira:
A short proof of Gowers' lower bound for the regularity lemma. Comb. 36(2): 187-194 (2016) - 2015
- [j1]Guy Moshkovitz, Asaf Shapira:
Exact bounds for some hypergraph saturation problems. J. Comb. Theory B 111: 242-248 (2015)
Conference and Workshop Papers
- 2021
- [c4]Alex Cohen, Guy Moshkovitz:
Structure vs. randomness for bilinear maps. STOC 2021: 800-808 - 2020
- [c3]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric Rank of Tensors and Subrank of Matrix Multiplication. CCC 2020: 35:1-35:21 - 2015
- [c2]Guy Moshkovitz, Asaf Shapira:
Decomposing a Graph Into Expanding Subgraphs. SODA 2015: 1283-1295 - 2012
- [c1]Guy Moshkovitz:
Complexity Lower Bounds through Balanced Graph Properties. CCC 2012: 159-169
Informal and Other Publications
- 2021
- [i9]Alex Cohen, Guy Moshkovitz:
Structure vs. Randomness for Bilinear Maps. CoRR abs/2102.04657 (2021) - [i8]Alex Cohen, Guy Moshkovitz:
An Optimal Inverse Theorem. CoRR abs/2102.10509 (2021) - [i7]Guy Moshkovitz, Jeffery Yu:
Sharp Effective Finite-Field Nullstellensatz. CoRR abs/2111.09305 (2021) - 2020
- [i6]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric rank of tensors and subrank of matrix multiplication. CoRR abs/2002.09472 (2020) - [i5]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric Rank of Tensors and Subrank of Matrix Multiplication. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i4]Noga Alon, Guy Moshkovitz:
On Generalized Regularity. CoRR abs/1911.02000 (2019) - 2015
- [i3]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. CoRR abs/1502.00413 (2015) - [i2]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. Electron. Colloquium Comput. Complex. TR15 (2015) - 2011
- [i1]Guy Moshkovitz:
Complexity Lower Bounds through Balanced Graph Properties. Electron. Colloquium Comput. Complex. TR11 (2011)
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-06-10 21:25 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:
