default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmit Levi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Tomer Adar, Eldar Fischer, Amit Levi:
Support Testing in the Huge Object Model. APPROX/RANDOM 2024: 46:1-46:16- [c14]Tomer Adar, Eldar Fischer, Amit Levi:
Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries. APPROX/RANDOM 2024: 48:1-48:21 - [i22]Tomer Adar, Eldar Fischer, Amit Levi:
Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries. CoRR abs/2408.02347 (2024) - 2023
- [j5]Kimon Fountoulakis, Amit Levi, Shenghao Yang, Aseem Baranwal
, Aukosh Jagannath:
Graph Attention Retrospective. J. Mach. Learn. Res. 24: 246:1-246:52 (2023) - [c13]Adrián Javaloy, Pablo Sánchez-Martín, Amit Levi, Isabel Valera:
Learnable Graph Convolutional Attention Networks. ICLR 2023 - [c12]Xi Chen, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Streaming Euclidean MST to a Constant Factor. STOC 2023: 156-169 - [i21]Tomer Adar, Eldar Fischer, Amit Levi:
Support Testing in the Huge Object Model. CoRR abs/2308.15988 (2023) - 2022
- [j4]Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. ACM Trans. Comput. Theory 14(1): 1:1-1:22 (2022) - [c11]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
New streaming algorithms for high dimensional EMD and MST. STOC 2022: 222-233 - [i20]Kimon Fountoulakis, Amit Levi, Shenghao Yang, Aseem Baranwal, Aukosh Jagannath:
Graph Attention Retrospective. CoRR abs/2202.13060 (2022) - [i19]Adrián Javaloy, Pablo Sánchez-Martín, Amit Levi, Isabel Valera:
Learnable Graph Convolutional Attention Networks. CoRR abs/2211.11853 (2022) - [i18]Vincent Cohen-Addad, Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Streaming Euclidean MST to a Constant Factor. CoRR abs/2212.06546 (2022) - 2021
- [c10]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Learning and testing junta distributions with sub cube conditioning. COLT 2021: 1060-1113 - [c9]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida:
Ordered Graph Limits and Their Applications. ITCS 2021: 42:1-42:20 - [c8]Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. ITCS 2021: 80:1-80:20 - [c7]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning. SODA 2021: 321-336 - [i17]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
New Streaming Algorithms for High Dimensional EMD and MST. CoRR abs/2111.03528 (2021) - 2020
- [b1]Amit Levi:
On Tolerant Testing and Tolerant Junta Testing. University of Waterloo, Ontario, Canada, 2020 - [j3]Brad Glasbergen, Michael Abebe, Khuzaima Daudjee, Amit Levi:
Sentinel: Universal Analysis and Insight for Data Systems. Proc. VLDB Endow. 13(11): 2720-2733 (2020) - [c6]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum:
Hard Properties with (Very) Short PCPPs and Their Applications. ITCS 2020: 9:1-9:27 - [c5]Xi Chen, Amit Levi, Erik Waingarten:
Nearly optimal edge estimation with independent set queries. SODA 2020: 2916-2935 - [i16]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Learning and Testing Junta Distributions with Subcube Conditioning. CoRR abs/2004.12496 (2020) - [i15]Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. CoRR abs/2011.14291 (2020) - [i14]Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j2]Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. ACM Trans. Comput. Theory 11(4): 24:1-24:33 (2019) - [c4]Amit Levi, Erik Waingarten:
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. ITCS 2019: 52:1-52:20 - [i13]Xi Chen, Amit Levi, Erik Waingarten:
Nearly optimal edge estimation with independent set queries. CoRR abs/1907.04381 (2019) - [i12]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum:
Hard properties with (very) short PCPPs and their applications. CoRR abs/1909.03255 (2019) - [i11]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning. CoRR abs/1911.07357 (2019) - [i10]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c3]Amit Levi, Yuichi Yoshida:
Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices. APPROX-RANDOM 2018: 17:1-17:19 - [c2]Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. SODA 2018: 2113-2132 - [i9]Amit Levi, Erik Waingarten:
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. CoRR abs/1805.01074 (2018) - [i8]Amit Levi, Yuichi Yoshida:
Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices. CoRR abs/1806.10626 (2018) - [i7]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida:
Limits of Ordered Graphs and Images. CoRR abs/1811.02023 (2018) - [i6]Amit Levi, Erik Waingarten:
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j1]Talya Eden, Amit Levi, Dana Ron, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. SIAM J. Comput. 46(5): 1603-1646 (2017) - 2016
- [i5]Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. CoRR abs/1607.03938 (2016) - [i4]Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c1]Talya Eden, Amit Levi, Dana Ron, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. FOCS 2015: 614-633 - [i3]Talya Eden, Amit Levi, Dana Ron:
Approximately Counting Triangles in Sublinear Time. CoRR abs/1504.00954 (2015) - [i2]Saleet Klein, Amit Levi, Muli Safra, Clara Shikhelman, Yinon Spinka:
On the Converse of Talagrand's Influence Inequality. CoRR abs/1506.06325 (2015) - [i1]Talya Eden, Amit Levi, Dana Ron:
Approximately Counting Triangles in Sublinear Time. Electron. Colloquium Comput. Complex. TR15 (2015)
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-09-18 00:10 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:
