default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLior Kamma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Mikael Møller Høgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn:
Sparse Dimensionality Reduction Revisited. ICML 2024- [c10]Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov:
A Contraction Tree SAT Encoding for Computing Twin-Width. PAKDD (2) 2024: 444-456 - [i13]Sarel Cohen, Lior Kamma, Aikaterini Niklanovits:
A New Approach for Approximating Directed Rooted Networks. CoRR abs/2407.07543 (2024) - 2023
- [i12]Mikael Møller Høgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn:
Sparse Dimensionality Reduction Revisited. CoRR abs/2302.06165 (2023) - 2020
- [c9]Allan Grønlund, Lior Kamma, Kasper Green Larsen:
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. ICML 2020: 3779-3788 - [c8]Allan Grønlund, Lior Kamma, Kasper Green Larsen:
Margins are Insufficient for Explaining Gradient Boosting. NeurIPS 2020 - [i11]Allan Grønlund, Lior Kamma, Kasper Green Larsen:
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. CoRR abs/2006.02175 (2020) - [i10]Allan Grønlund, Lior Kamma, Kasper Green Larsen:
Margins are Insufficient for Explaining Gradient Boosting. CoRR abs/2011.04998 (2020)
2010 – 2019
- 2019
- [c7]Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen:
Lower Bounds for Multiplication via Network Coding. ICALP 2019: 10:1-10:12 - [c6]Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson:
Margin-Based Generalization Lower Bounds for Boosted Classifiers. NeurIPS 2019: 11940-11949 - [i9]Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen:
Lower Bounds for Multiplication via Network Coding. CoRR abs/1902.10935 (2019) - [i8]Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson:
Margin-Based Generalization Lower Bounds for Boosted Classifiers. CoRR abs/1909.12518 (2019) - 2018
- [c5]Lior Kamma, Casper Benjamin Freksen, Kasper Green Larsen:
Fully Understanding The Hashing Trick. NeurIPS 2018: 5394-5404 - [c4]Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen:
Tight cell probe bounds for succinct Boolean matrix-vector multiplication. STOC 2018: 1297-1306 - [i7]Lior Kamma, Ohad Trabelsi:
Nearly Optimal Time Bounds for kPath in Hypergraphs. CoRR abs/1803.04940 (2018) - [i6]Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen:
Fully Understanding the Hashing Trick. CoRR abs/1805.08539 (2018) - [i5]Alexandr Andoni, Lior Kamma, Robert Krauthgamer, Eric Price:
Batch Sparse Recovery, or How to Leverage the Average Sparsity. CoRR abs/1807.08478 (2018) - 2017
- [j3]Lior Kamma
, Robert Krauthgamer:
Metric Decompositions of Path-Separable Graphs. Algorithmica 79(3): 645-653 (2017) - [i4]Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen:
Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication. CoRR abs/1711.04467 (2017) - 2016
- [c3]Rajesh Chitnis, Lior Kamma, Robert Krauthgamer:
Tight Bounds for Gomory-Hu-like Cut Counting. WG 2016: 133-144 - 2015
- [j2]Lior Kamma, Robert Krauthgamer, Huy L. Nguyen:
Cutting Corners Cheaply, or How to Remove Steiner Points. SIAM J. Comput. 44(4): 975-995 (2015) - [i3]Lior Kamma, Robert Krauthgamer:
Metric Decompositions of Path-Separable Graphs. CoRR abs/1504.07019 (2015) - [i2]Rajesh Chitnis, Lior Kamma, Robert Krauthgamer:
Tight Bounds for Gomory-Hu-like Cut Counting. CoRR abs/1511.08647 (2015) - 2014
- [c2]Lior Kamma, Robert Krauthgamer, Huy L. Nguyen:
Cutting corners cheaply, or how to remove Steiner points. SODA 2014: 1029-1040 - 2013
- [i1]Lior Kamma, Robert Krauthgamer, Huy L. Nguyen:
Cutting corners cheaply, or how to remove Steiner points. CoRR abs/1304.1449 (2013) - 2012
- [j1]Lior Kamma, Zeev Nutov:
Approximating survivable networks with minimum number of steiner points. Networks 60(4): 245-252 (2012) - 2010
- [c1]Lior Kamma, Zeev Nutov:
Approximating Survivable Networks with Minimum Number of Steiner Points. WAOA 2010: 154-165
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-04 00:31 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:
