Find

For students
For PhDs
For employees

Department of Computer Science

Publications

2020

Contribution to book anthology

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Anagnostopoulos, A., Becchetti, L., Fazzone, A., Menghini, C. & Schwiegelshohn, C. (2020). Spectral Relaxations and Fair Densest Subgraphs. In CIKM 2020 - Proceedings of the 29th ACM International Conference on Information and Knowledge Management (pp. 35–44) https://doi.org/10.1145/3340531.3412036

Jamalabadi, S., Schwiegelshohn, C. & Schwiegelshohn, U. (2020). Commitment and Slack for Online Load Maximization. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (pp. 339–348). Association for Computing Machinery. https://doi.org/10.1145/3350755.3400271

Schmidt, M., Schwiegelshohn, C. & Sohler, C. (2020). Fair Coresets and Streaming Algorithms for Fair k-means. In E. Bampis & N. Megow (Eds.), Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Revised Selected Papers (pp. 232-251). Springer. https://doi.org/10.1007/978-3-030-39479-0_16

Afshani, P. & Cheng, P. (2020). 2D generalization of fractional cascading on axis-aligned planar subdivisions. In Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (pp. 716-727). Article 9317953 IEEE Computer Society Press. https://doi.org/10.1109/FOCS46700.2020.00072

Grønlund, A., Kamma, L. & Larsen, K. G. (2020). Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. In H. Daumé III & A. Singh (Eds.), International Conference on Machine Learning (pp. 3779-3788). MLResearch Press. http://proceedings.mlr.press/v119/gronlund20a.html

Afshani, P. & Phillips, J. M. (2019). Independent range sampling, revisited again. In G. Barequet & Y. Wang (Eds.), 35th International Symposium on Computational Geometry, SoCG 2019 Article 4 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.4

Farhadi, A., Hajiaghayi, M. T., Larsen, K. G. & Shi, E. (2019). Lower bounds for external memory integer sorting via network coding. In M. Charikar & E. Cohen (Eds.), STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 997-1008). Association for Computing Machinery. https://doi.org/10.1145/3313276.3316337

Afshani, P. (2019). A new lower bound for semigroup orthogonal range searching. In G. Barequet & Y. Wang (Eds.), 35th International Symposium on Computational Geometry, SoCG 2019 Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.3

Jacob, R., Larsen, K. G. & Nielsen, J. B. (2019). Lower Bounds for Oblivious Data Structures. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2439-2447). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.149

Jiang, S. & Larsen, K. G. (2019). A Faster External Memory Priority Queue with DecreaseKeys. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. PRDA19, pp. 1331-1343). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.81

Grønlund, A., Kamma, L., Larsen, K. G., Mathiasen, A. & Nelson, J. (2019). Margin-Based Generalization Lower Bounds for Boosted Classifiers. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox & R. Garnett (Eds.), Advances in Neural Information Processing Systems 32 (NIPS 2019) (Vol. 32). Neural Information Processing Systems Foundation. https://arxiv.org/abs/1909.12518

Grønlund, A., Larsen, K. G. & Mathiasen, A. (2019). Optimal Minimal Margin Maximization with Boosting. In K. Chaudhuri & R. Salakhutdinov (Eds.), 36th International Conference on Machine Learning, ICML 2019 (Vol. 97, pp. 4392-4401). International Machine Learning Society (IMLS). http://proceedings.mlr.press/v97/mathiasen19a/mathiasen19a.pdf

Larsen, K. G. (2019). Constructive Discrepancy Minimization with Hereditary L2 Guarantees. In R. Niedermeier & C. Paul (Eds.), 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) Article 48 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2019.48

Afshani, P., Fagerberg, R., Hammer, D., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M. & Sitchinava, N. (2019). Fragile complexity of comparison-based algorithms. In M. A. Bender, O. Svensson & G. Herman (Eds.), 27th Annual European Symposium on Algorithms, ESA 2019 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2019.2

Damgård, I., Larsen, K. G. & Nielsen, J. B. (2019). Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. In A. Boldyreva & D. Micciancio (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (Vol. II, pp. 61-84). Springer. https://doi.org/10.1007/978-3-030-26951-7_3

Clifford, R., Grønlund, A., Larsen, K. G. & Starikovskaya, T. (2018). Upper and lower bounds for dynamic data structures on strings. In R. Niedermeier & B. Vallée (Eds.), 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 (Vol. 96, pp. 22:1-22:14). Article 22 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2018.22

Afshani, P. & Driemel, A. (2018). On the complexity of range searching among curves. In A. Czumaj (Ed.), 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 (pp. 898-917). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.58

Chakraborty, D., Kamma, L. & Larsen, K. G. (2018). Tight cell probe bounds for succinct boolean matrix-Vector multiplication. In STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (pp. 1297-1306). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188830

Larsen, K. G., Weinstein, O. & Yu, H. (2018). Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. In M. Henzinger, D. Kempe & I. Diakonikolas (Eds.), STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (pp. 978-989). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188790

Larsen, K. G. & Nielsen, J. B. (2018). Yes, There is an Oblivious RAM Lower Bound! In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology -- CRYPTO 2018 (pp. 523-542). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_18

Larsen, K. G. & Williams, R. (2017). Faster Online Matrix-Vector Multiplication. In P. N. Klein (Ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (Vol. PRDA17, pp. 2182-2189). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782

Afshani, P. & Van Duijn, I. (2017). Permuting and batched geometric lower bounds in the I/O model. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 2:1-2:13). Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.2

Afshani, P. & Wei, Z. (2017). Independent range sampling, revisited. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 3:1--3:14). Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.3

Brodal, G. S. & Mampentzidis, K. (2017). Cache oblivious algorithms for computing the triplet distance between trees. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 21:1--21:14). Article 21 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.21

Eenberg, K., Larsen, K. G. & Yu, H. (2017). DecreaseKeys are expensive for external memory priority queues. In STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Vol. Part F128415, pp. 1081-1093). Association for Computing Machinery. https://doi.org/10.1145/3055399.3055437

Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C., Sitchinava, N. & Tsirogiannis, C. (2017). An efficient algorithm for the 1D total visibility-index problem. In S. Fekete & V. Ramachandran (Eds.), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Vol. PRAL17, pp. 218-231). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974768.18

Freksen, C. B. & Larsen, K. G. (2017). On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. In O. Yoshio & T. Tokuyama (Eds.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (pp. 32:1-32:12). Article 32 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2017.32

Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017). Cross-Referenced dictionaries and the limits of write optimization. In P. N. Klein (Ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 1523-1532). Association for Computing Machinery. https://doi.org/10.1137/1.9781611974782.99

Bringmann, K., Grønlund, A. & Larsen, K. G. (2017). A Dichotomy for Regular Expression Membership Testing. In Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017 (pp. 307-318). Article 8104068 IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2017.36

Larsen, K. G. & Nelson, J. (2017). Optimality of the Johnson-Lindenstrauss Lemma. In Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017 (pp. 633-638). Article 8104096 https://doi.org/10.1109/FOCS.2017.64

Berglin, E. & Brodal, G. S. (2017). A simple greedy algorithm for dynamic graph orientation. In Y. Okamoto & T. Tokuyama (Eds.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (pp. 12:1-12:12). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2017.12

Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016). How to prove knowledge of small secrets. In J. Katz & M. Robshaw (Eds.), Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Vol. 9816, pp. 478-498). Springer VS. https://doi.org/10.1007/978-3-662-53015-3_17

Larsen, K. G., Nelson, J., Nguyen, H. L. & Thorup, M. (2016). Heavy hitters via cluster-preserving clustering. In Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 (pp. 61-70). Article 7782918 IEEE. https://doi.org/10.1109/FOCS.2016.16

Afshani, P., Berglin, E., Van Duijn, I. & Nielsen, J. S. (2016). Applications of incidence bounds in point covering problems. In S. Fekete & A. Lubiw (Eds.), 32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 60.1-60.15). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.60

Brodal, G. S. (2016). External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. In N. Ollinger & H. Vollmer (Eds.), 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) (Vol. 47, pp. 23:1-23:14). Article 23 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2016.23

Yon, J., Won, S. B., Cheng, S. W., Cheong, O. & Wilkinson, B. T. (2016). Approximating convex shapes with respect to symmetric difference under homotheties. In S. Fekete & A. Lubiw (Eds.), 32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 63.1-63.15). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.63

Afshani, P. & Nielsen, J. A. S. (2016). Data Structure Lower Bounds for Document Indexing Problems. In I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani & D. Sangiorgi (Eds.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Vol. 55, pp. 93:1-93:15). Article 93 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2016.93

Larsen, K. G., Nelson, J. & Nguyen, H. L. (2015). Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. In R. Servedio & R. Rubinfeld (Eds.), Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15 (pp. 803-812). Association for Computing Machinery. https://doi.org/10.1145/2746539.2746542

Clifford, R., Jørgensen, A. G. & Larsen, K. G. (2015). New Unconditional Hardness Results for Dynamic and Online Problems. In 56th IEEE Symposium on Foundations of Computer Science (FOCS) Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS IEEE Computer Society Press. http://arxiv.org/pdf/1504.01836v1.pdf

Goswami, M., Jørgensen, A. G., Larsen, K. G. & Pagh, R. (2015). Approximate Range Emptiness in Constant Time and Optimal Space. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15 (pp. 769-775). Society for Industrial and Applied Mathematics. http://dl.acm.org/citation.cfm?id=2133036&picked=prox

Son, W. & Afshani, P. (2015). Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. In R. Jain, S. Jain & F. Stephan (Eds.), Theory and Applications of Models of Computation: 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (pp. 189-199 ). Springer VS. https://doi.org/10.1007/978-3-319-17142-5

Brodal, G. S., Nielsen, J. A. S. & Truelsen, J. (2015). Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. In F. Dehne, J.-R. Sack & U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Proceedings (pp. 91-102). Springer VS. https://doi.org/10.1007/978-3-319-21840-3_8

Afshani, P. & Sitchinava , N. (2015). Sorting and Permuting without Bank Conflicts on GPUs. In N. Bansal & I. Finocchi (Eds.), Algorithms – ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14–16, 2015, Proceedings (pp. 13-24). Springer VS. https://doi.org/10.1007/978-3-662-48350-3_2

de Berg, M., Tsirogiannis, C. & Wilkinson, B. T. (2015). Fast computation of categorical richness on raster data sets and related problems. In GIS '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Article 18 https://doi.org/10.1145/2820783.2820825

de Berg, M., Tsirogiannis, C. & Wilkinson, B. (2015). Fast Computation of Categorical Richness on Raster Data Sets and Related Problems. In Proceedings. Workshop on Massive Data Algorithmics (MASSIVE) (pp. 86-107)

Larsen, K. G., Munro, J. I., Nielsen, J. A. S. & Thankachan, S. V. (2014). On Hardness of Several String Indexing Problems. In A. Kulikov, S. O. Kuznetsov & P. Pevzner (Eds.), Combinatorial Pattern Matching: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings (pp. 242-251 ). Springer VS. https://doi.org/10.1007/978-3-319-07566-2_25

Afshani, P., Chan, T. M. & Tsakalidis, K. (2014). Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. In J. Esparza , P. Fraigniaud, T. Husfeldt & E. Koutsoupias (Eds.), Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I (pp. 77-88 ). Springer VS. https://doi.org/10.1007/978-3-662-43948-7_7

Alstrup, S., Bistrup Halvorsen, E. & Larsen, K. G. (2014). Near-optimal labeling schemes for nearest common ancestors. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 972-982). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902108771&partnerID=8YFLogxK

Brodal, G. S. & Larsen, K. G. (2014). Optimal Planar Orthogonal Skyline Counting Queries. In R. Ravi & I. L. Gørtz (Eds.), Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Denmark. Proceedings (pp. 110-121). Springer VS. https://doi.org/10.1007/978-3-319-08404-6_10

Displaying results 151 to 200 out of 451

4

Revised 01.09.2025