According to our database1, Lior Kamma authored at least 10 papers between 2012 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Margin-Based Generalization Lower Bounds for Boosted Classifiers.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Lower Bounds for Multiplication via Network Coding.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Batch Sparse Recovery, or How to Leverage the Average Sparsity.
Nearly Optimal Time Bounds for kPath in Hypergraphs.
Tight cell probe bounds for succinct Boolean matrix-vector multiplication.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Fully Understanding The Hashing Trick.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Metric Decompositions of Path-Separable Graphs.
Tight Bounds for Gomory-Hu-like Cut Counting.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
Cutting Corners Cheaply, or How to Remove Steiner Points.
SIAM J. Comput., 2015
Approximating survivable networks with minimum number of steiner points.