Volgen
Lior Kamma
Lior Kamma
Geverifieerd e-mailadres voor cs.au.dk
Titel
Geciteerd door
Geciteerd door
Jaar
Cutting corners cheaply, or how to remove steiner points
L Kamma, R Krauthgamer, HL Nguyễn
SIAM Journal on Computing 44 (4), 975-995, 2015
352015
Tight cell probe bounds for succinct boolean matrix-vector multiplication
D Chakraborty, L Kamma, KG Larsen
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
342018
Fully understanding the hashing trick
CB Freksen, L Kamma, K Green Larsen
Advances in Neural Information Processing Systems 31, 2018
322018
Lower bounds for multiplication via network coding
P Afshani, CB Freksen, L Kamma, KG Larsen
arXiv preprint arXiv:1902.10935, 2019
312019
Near-tight margin-based generalization bounds for support vector machines
A Grønlund, L Kamma, KG Larsen
International Conference on Machine Learning, 3779-3788, 2020
252020
Margin-based generalization lower bounds for boosted classifiers
A Grønlund, L Kamma, K Green Larsen, A Mathiasen, J Nelson
Advances in Neural Information Processing Systems 32, 2019
182019
Margins are insufficient for explaining gradient boosting
A Grønlund, L Kamma, K Green Larsen
Advances in Neural Information Processing Systems 33, 1902-1912, 2020
132020
Metric decompositions of path-separable graphs
L Kamma, R Krauthgamer
Algorithmica 79, 645-653, 2017
72017
Tight bounds for Gomory-Hu-like cut counting
R Chitnis, L Kamma, R Krauthgamer
International Workshop on Graph-Theoretic Concepts in Computer Science, 133-144, 2016
72016
Approximating survivable networks with minimum number of Steiner points
L Kamma, Z Nutov
Networks 60 (4), 245-252, 2012
72012
Nearly optimal time bounds for kpath in hypergraphs
L Kamma, O Trabelsi
arXiv preprint arXiv:1803.04940, 2018
12018
A New Approach for Approximating Directed Rooted Networks
S Cohen, L Kamma, A Niklanovits
arXiv preprint arXiv:2407.07543, 2024
2024
A Contraction Tree SAT Encoding for Computing Twin-Width
Y Horev, S Shay, S Cohen, T Friedrich, D Issac, L Kamma, A Niklanovits, ...
Pacific-Asia Conference on Knowledge Discovery and Data Mining, 444-456, 2024
2024
Compression Implies Generalization
A Grønlund, M Høgsgaard, L Kamma, KG Larsen
arXiv preprint arXiv:2106.07989, 2021
2021
Batch Sparse Recovery, or How to Leverage the Average Sparsity
A Andoni, L Kamma, R Krauthgamer, E Price
arXiv preprint arXiv:1807.08478, 2018
2018
Algorithms for graphical vertex sparsifiers
L Kamma
PQDT-Global, 2017
2017
Approximating survivable networks with minimum number of Steiner points
L Kamma, Z Nutov
Approximation and Online Algorithms: 8th International Workshop, WAOA 2010 …, 2011
2011
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–17