Amit Levi

Orcid: 0000-0002-8530-5182

According to our database1, Amit Levi authored at least 27 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Silent Tokens, Loud Effects: Padding in LLMs.
CoRR, October, 2025

Optimal mass estimation in the conditional sampling model.
CoRR, March, 2025

Enhancing Jailbreak Attacks via Compliance-Refusal-Based Initialization.
CoRR, February, 2025

Testing vs Estimation for Index-Invariant Properties in the Huge Object Model.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Testing C_k-Freeness in Bounded Admissibility Graphs.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries.
Proceedings of the Approximation, 2024

Support Testing in the Huge Object Model.
Proceedings of the Approximation, 2024

2023
Graph Attention Retrospective.
J. Mach. Learn. Res., 2023

Streaming Euclidean MST to a Constant Factor.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Learnable Graph Convolutional Attention Networks.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
New streaming algorithms for high dimensional EMD and MST.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Erasure-Resilient Sublinear-Time Graph Algorithms.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Ordered Graph Limits and Their Applications.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Learning and testing junta distributions with sub cube conditioning.
Proceedings of the Conference on Learning Theory, 2021

2020
On Tolerant Testing and Tolerant Junta Testing.
PhD thesis, 2020

Sentinel: Universal Analysis and Insight for Data Systems.
Proc. VLDB Endow., 2020

Learning and Testing Junta Distributions with Subcube Conditioning.
CoRR, 2020

Nearly optimal edge estimation with independent set queries.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Hard Properties with (Very) Short PCPPs and Their Applications.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
Limits of Ordered Graphs and Images.
CoRR, 2018

Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices.
Proceedings of the Approximation, 2018

2015
Approximately Counting Triangles in Sublinear Time.
Electron. Colloquium Comput. Complex., 2015

On the Converse of Talagrand's Influence Inequality.
CoRR, 2015

Approximately Counting Triangles in Sublinear Time.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015


  Loading...