Lior Kamma

28 papers A* 8B 3Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2024 — conf
A Contraction Tree SAT Encoding for Computing Twin-Width.
PAKDD (2)
Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov
2024 B conf
A New Approach for Approximating Directed Rooted Networks.
WG
Sarel Cohen, Lior Kamma, Aikaterini Niklanovits
2024 J jnl
A New Approach for Approximating Directed Rooted Networks.
CoRR
Sarel Cohen, Lior Kamma, Aikaterini Niklanovits
2024 A* conf
Sparse Dimensionality Reduction Revisited.
ICML
Mikael Møller Høgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn
2023 J jnl
Sparse Dimensionality Reduction Revisited.
CoRR
Mikael Møller Høgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn
2020 A* conf
Margins are Insufficient for Explaining Gradient Boosting.
NeurIPS
Allan Grønlund, Lior Kamma, Kasper Green Larsen
2020 J jnl
Margins are Insufficient for Explaining Gradient Boosting.
CoRR
Allan Grønlund, Lior Kamma, Kasper Green Larsen
2020 A* conf
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines.
ICML
Allan Grønlund, Lior Kamma, Kasper Green Larsen
2020 J jnl
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines.
CoRR
Allan Grønlund, Lior Kamma, Kasper Green Larsen
2019 A* conf
Lower Bounds for Multiplication via Network Coding.
ICALP
Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen
2019 J jnl
Lower Bounds for Multiplication via Network Coding.
CoRR
Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen
2019 A* conf
Margin-Based Generalization Lower Bounds for Boosted Classifiers.
NeurIPS
Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson
2019 J jnl
Margin-Based Generalization Lower Bounds for Boosted Classifiers.
CoRR
Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson
2018 J jnl
Batch Sparse Recovery, or How to Leverage the Average Sparsity.
CoRR
Alexandr Andoni, Lior Kamma, Robert Krauthgamer, Eric Price
2018 A* conf
Fully Understanding The Hashing Trick.
NeurIPS
Lior Kamma, Casper Benjamin Freksen, Kasper Green Larsen
2018 J jnl
Fully Understanding the Hashing Trick.
CoRR
Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen
2018 J jnl
Nearly Optimal Time Bounds for kPath in Hypergraphs.
CoRR
Lior Kamma, Ohad Trabelsi
2018 A* conf
Tight cell probe bounds for succinct Boolean matrix-vector multiplication.
STOC
Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen
2017 J jnl
Metric Decompositions of Path-Separable Graphs.
Algorithmica
Lior Kamma, Robert Krauthgamer
2017 J jnl
Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication.
CoRR
Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen
2016 B conf
Tight Bounds for Gomory-Hu-like Cut Counting.
WG
Rajesh Chitnis, Lior Kamma, Robert Krauthgamer
2015 J jnl
Cutting Corners Cheaply, or How to Remove Steiner Points.
SIAM J. Comput.
Lior Kamma, Robert Krauthgamer, Huy L. Nguyen
2015 J jnl
Metric Decompositions of Path-Separable Graphs.
CoRR
Lior Kamma, Robert Krauthgamer
2015 J jnl
Tight Bounds for Gomory-Hu-like Cut Counting.
CoRR
Rajesh Chitnis, Lior Kamma, Robert Krauthgamer
2014 A* conf
Cutting corners cheaply, or how to remove Steiner points.
SODA
Lior Kamma, Robert Krauthgamer, Huy L. Nguyen
2013 J jnl
Cutting corners cheaply, or how to remove Steiner points
CoRR
Lior Kamma, Robert Krauthgamer, Huy L. Nguyen
2012 J jnl
Approximating survivable networks with minimum number of steiner points.
Networks
Lior Kamma, Zeev Nutov
2010 B conf
Approximating Survivable Networks with Minimum Number of Steiner Points.
WAOA
Lior Kamma, Zeev Nutov