default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAllan Grønlund Jørgensen
Publications
- 2024
[c22]Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen:
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. ITCS 2024: 22:1-22:25- [c21]Noga Alon, Allan Grønlund, Søren Fuglede Jørgensen, Kasper Green Larsen:
Sublinear Time Shortest Path in Expander Graphs. MFCS 2024: 8:1-8:13 - 2023
- [i16]Noga Alon, Allan Grønlund, Søren Fuglede Jørgensen, Kasper Green Larsen:
Sublinear Time Shortest Path in Expander Graphs. CoRR abs/2307.06113 (2023) - [i15]Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen:
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. CoRR abs/2311.10204 (2023) - 2020
- [c20]Allan Grønlund, Lior Kamma, Kasper Green Larsen:
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. ICML 2020: 3779-3788 - [c19]Allan Grønlund, Lior Kamma, Kasper Green Larsen:
Margins are Insufficient for Explaining Gradient Boosting. NeurIPS 2020 - [i13]Allan Grønlund, Lior Kamma, Kasper Green Larsen:
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. CoRR abs/2006.02175 (2020) - [i12]Allan Grønlund, Lior Kamma, Kasper Green Larsen:
Margins are Insufficient for Explaining Gradient Boosting. CoRR abs/2011.04998 (2020) - 2019
- [c17]Alexander Mathiasen, Kasper Green Larsen, Allan Grønlund:
Optimal Minimal Margin Maximization with Boosting. ICML 2019: 4392-4401 - [c16]Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson:
Margin-Based Generalization Lower Bounds for Boosted Classifiers. NeurIPS 2019: 11940-11949 - [i11]Allan Grønlund, Kasper Green Larsen, Alexander Mathiasen:
Optimal Minimal Margin Maximization with Boosting. CoRR abs/1901.10789 (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
- [c15]Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya:
Upper and Lower Bounds for Dynamic Data Structures on Strings. STACS 2018: 22:1-22:14 - [i7]Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya:
Upper and lower bounds for dynamic data structures on strings. CoRR abs/1802.06545 (2018) - 2017
- [c14]Karl Bringmann, Allan Grønlund, Kasper Green Larsen:
A Dichotomy for Regular Expression Membership Testing. FOCS 2017: 307-318 - [i6]Allan Grønlund, Kasper Green Larsen, Alexander Mathiasen, Jesper Sindahl Nielsen:
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D. CoRR abs/1701.07204 (2017) - 2016
- [c13]Allan Grønlund, Kasper Green Larsen:
Towards Tight Lower Bounds for Range Reporting on the RAM. ICALP 2016: 92:1-92:12 - [i5]Karl Bringmann, Allan Grønlund, Kasper Green Larsen:
A Dichotomy for Regular Expression Membership Testing. CoRR abs/1611.00918 (2016) - 2015
- [c12]Raphaël Clifford, Allan Grønlund, Kasper Green Larsen:
New Unconditional Hardness Results for Dynamic and Online Problems. FOCS 2015: 1089-1107 - [c11]Mayank Goswami, Allan Grønlund Jørgensen, Kasper Green Larsen, Rasmus Pagh
:
Approximate Range Emptiness in Constant Time and Optimal Space. SODA 2015: 769-775 - [i4]Raphaël Clifford, Allan Grønlund Jørgensen, Kasper Green Larsen:
New Unconditional Hardness Results for Dynamic and Online Problems. CoRR abs/1504.01836 (2015) - 2014
- [i2]Mayank Goswami, Allan Grønlund Jørgensen, Kasper Green Larsen, Rasmus Pagh:
Approximate Range Emptiness in Constant Time and Optimal Space. CoRR abs/1407.2907 (2014) - [i1]Allan Grønlund Jørgensen, Kasper Green Larsen:
Towards Tight Lower Bounds for Range Reporting on the RAM. CoRR abs/1411.0644 (2014) - 2011
- [c9]Allan Grønlund Jørgensen, Kasper Green Larsen:
Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures. SODA 2011: 805-813 - 2010
- [c8]Mark Greve, Allan Grønlund Jørgensen, Kasper Dalgaard Larsen, Jakob Truelsen:
Cell Probe Lower Bounds and Approximations for Range Mode. ICALP (1) 2010: 605-616
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-08-27 23:00 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:
