Allan Grønlund Jørgensen

Affiliations:
  • Aarhus University, Denmark


According to our database1, Allan Grønlund Jørgensen authored at least 26 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Sublinear Time Shortest Path in Expander Graphs.
CoRR, 2023

2021
Learning to Detect Fortified Areas.
CoRR, 2021

2020
Margins are Insufficient for Explaining Gradient Boosting.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Near-Tight Margin-Based Generalization Bounds for Support Vector Machines.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Algorithms Clearly Beat Gamers at Quantum Moves. A Verification.
CoRR, 2019

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

Optimal Minimal Margin Maximization with Boosting.
Proceedings of the 36th International Conference on Machine Learning, 2019

Learning to Find Hydrological Corrections.
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

2018
Threesomes, Degenerates, and Love Triangles.
J. ACM, 2018

Upper and Lower Bounds for Dynamic Data Structures on Strings.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D.
CoRR, 2017

A Dichotomy for Regular Expression Membership Testing.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Towards Tight Lower Bounds for Range Reporting on the RAM.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Approximate Range Emptiness in Constant Time and Optimal Space.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

New Unconditional Hardness Results for Dynamic and Online Problems.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2011
Towards optimal range medians.
Theor. Comput. Sci., 2011

Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Cell Probe Lower Bounds and Approximations for Range Mode.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Fault Tolerant External Memory Algorithms.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Counting in the Presence of Memory Faults.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Data Structures for Range Median Queries.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Selecting Sums in Arrays.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Priority Queues Resilient to Memory Faults.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

A Linear Time Algorithm for the <i>k</i> Maximal Sums Problem.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007



  Loading...