Aarhus University Seal / Aarhus Universitets segl

Kasper Green Larsen

  1. 2020
  2. Published

    Clustering with a faulty oracle. / Green Larsen, Kasper; Mitzenmacher, Michael; Tsourakakis, Charalampos.

    WWW '20: Proceedings of The Web Conference 2020. ed. / Yennun Huang; Irwin King; Tie-Yan Liu; Maarten van Steen. New York : Association for Computing Machinery, 2020. p. 2831-2834.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  3. Published

    Lower Bounds for Oblivious Near-Neighbor Search. / Larsen, Kasper Green; Malkin, Tal; Weinstein, Omri; Yeo, Kevin.

    SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Shuchi Chawla. Philadelphia : Society for Industrial and Applied Mathematics, 2020. p. 1116-1134.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  4. Published

    On Using Toeplitz and Circulant Matrices for Johnson–Lindenstrauss Transforms. / Freksen, Casper Benjamin; Larsen, Kasper Green.

    In: Algorithmica, Vol. 82, No. 2, 2020, p. 338-354.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  5. Published

    Optimal Learning of Joint Alignments with a Faulty Oracle. / Larsen, Kasper Green; Mitzenmacher, Michael; Tsourakakis, Charalampos E.

    2020 IEEE International Symposium on Information Theory, ISIT 2020. IEEE, 2020. p. 2492-2497 (IEEE International Symposium on Information Theory - Proceedings, Vol. 2020-June).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  6. Published

    Secret sharing lower bound : Either reconstruction is hard or shares are long. / Larsen, Kasper Green; Simkin, Mark.

    Security and Cryptography for Networks. ed. / Clemente Galdi; Vladimir Kolesnikov. Cham : Springer, 2020. p. 566-578 (Lecture Notes in Computer Science, Vol. 12238).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  7. 2019
  8. Published

    Heavy Hitters via Cluster-Preserving Clustering. / Larsen, Kasper Green; Nelson, Jelani; Huy L Nguyen; Thorup, Mikkel.

    In: Communications of the ACM, Vol. 62, No. 8, 08.2019, p. 95-100.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  9. Published

    The query complexity of a permutation-based variant of Mastermind. / Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt.

    In: Discrete Applied Mathematics, Vol. 260, 05.2019, p. 28-50.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  10. Published

    A Faster External Memory Priority Queue with DecreaseKeys. / Jiang, Shunhua; Larsen, Kasper Green.

    Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Timothy M. Chan. Vol. PRDA19 Society for Industrial and Applied Mathematics, 2019. p. 1331-1343.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  11. Published

    Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. / Damgård, Ivan; Larsen, Kasper Green; Nielsen, Jesper Buus.

    Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings. ed. / Alexandra Boldyreva; Daniele Micciancio. Vol. II Springer, 2019. p. 61-84 (Lecture Notes in Computer Science, Vol. 11693).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  12. Published

    Constructive Discrepancy Minimization with Hereditary L2 Guarantees. / Larsen, Kasper Green.

    36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). ed. / Rolf Niedermeier; Christophe Paul. Dagstuhl : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2019. 48 (Leibniz International Proceedings in Informatics, Vol. 126).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  13. Published

    Lower Bounds for Oblivious Data Structures. / Jacob, Riko; Larsen, Kasper Green; Nielsen, Jesper Buus.

    Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Timothy M. Chan. Society for Industrial and Applied Mathematics, 2019. p. 2439-2447 (Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. PRDA19).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  14. Published

    Lower bounds for external memory integer sorting via network coding. / Farhadi, Alireza; Hajiaghayi, Mohammad Taghi; Larsen, Kasper Green; Shi, Elaine.

    STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. ed. / Moses Charikar; Edith Cohen. Association for Computing Machinery, 2019. p. 997-1008 (A C M Symposium on the Theory of Computing. Annual Proceedings).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  15. Published

    Lower bounds for multiplication via network coding. / Afshani, Peyman; Freksen, Casper Benjamin; Kamma, Lior; Larsen, Kasper Green.

    In: Leibniz International Proceedings in Informatics, LIPIcs, Vol. 132, 10, 2019.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearch

  16. Published

    Margin-Based Generalization Lower Bounds for Boosted Classifiers. / Grønlund, Allan; Kamma, Lior; Larsen, Kasper Green; Mathiasen, Alexander; Nelson, Jelani.

    Advances in Neural Information Processing Systems 32 (NIPS 2019). ed. / Hanna Wallach; Hugo Larochelle; Alina Beygelzimer; Florence d'Alché-Buc; Emily Fox; Roman Garnett. Neural Information Processing Systems Foundation, 2019.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  17. Published

    Optimal Minimal Margin Maximization with Boosting. / Grønlund, Allan; Larsen, Kasper Green; Mathiasen, Alexander.

    Proceedings of th 36th International Conference on Machine Learning. ed. / Kamalika Chaudhuri; Ruslan Salakhutdinov. Vol. 97 International Machine Learning Society (IMLS), 2019. p. 4392-4401 (Proceedings of Machine Learning Research, Vol. 97).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  18. 2018
  19. Published

    Fully Understanding the Hashing Trick. / Freksen, Casper Benjamin; Kamma, Lior; Larsen, Kasper Green.

    2018. 1 Poster session presented at Neural Information Processing Systems Conference, Montreal, Canada.

    Research output: Contribution to conferencePosterResearchpeer-review

  20. Published

    Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. / Larsen, Kasper Green; Weinstein, Omri; Yu, Huacheng.

    STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. ed. / Monika Henzinger; David Kempe; Ilias Diakonikolas. New York, NY, USA : Association for Computing Machinery, 2018. p. 978-989 (A C M. S I G A C T - S I G M O D - S I G A R T Symposium on Principles of Database Systems. Proceedings; No. 2018).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  21. Published

    Tight cell probe bounds for succinct boolean matrix-Vector multiplication. / Chakraborty, Diptarka; Kamma, Lior; Larsen, Kasper Green.

    STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, 2018. p. 1297-1306 (A C M Symposium on the Theory of Computing. Annual Proceedings; No. 2018).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  22. Published

    Opholdskrav i skatteaftale hæmmer dansk forskning. / Dalsgaard, Peter; Pedersen, Bjørn Panyella; Dimke, Henrik; Møller, Niels Martin; Normand, Signe; Bjørk, Rasmus; Bille, Mikkel; Larsen, Kasper Green.

    In: Politiken, No. Sektion 2 (Kultur), 02.03.2018, p. 7.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperContribution to newspaper - Comment/debateCommunication

  23. Published

    Fully Understanding the Hashing Trick. / Freksen, Casper Benjamin; Kamma, Lior; Larsen, Kasper Green.

    23 p. arXiv.org. 2018.

    Research output: Other contributionNet publication - Internet publicationResearch

  24. Published

    Predicting Positive and Negative Links with Noisy Queries: Theory Practice. / Tsourakakis, Charalampos E.; Mitzenmacher, Michael; Larsen, Kasper Green; Blasiok, Jaroslaw; Lawson, Ben; Nakkiran, Preetum; Nakos, Vasileios.

    17 p. arXiv.org. 2018Internetarkiv.

    Research output: Other contributionNet publication - Internet publicationResearchpeer-review

  25. Published

    Upper and lower bounds for dynamic data structures on strings. / Clifford, Raphael; Grønlund, Allan; Larsen, Kasper Green; Starikovskaya, Tatiana.

    35th Symposium on Theoretical Aspects of Computer Science, STACS 2018. ed. / Rolf Niedermeier; Brigitte Vallée. Vol. 96 Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2018. p. 22:1-22:14 22 (Leibniz International Proceedings in Informatics; No. 96).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  26. Published

    Yes, There is an Oblivious RAM Lower Bound! / Larsen, Kasper Green; Nielsen, Jesper Buus.

    Advances in Cryptology -- CRYPTO 2018. ed. / Hovav Shacham; Alexandra Boldyreva. Cham : Springer VS, 2018. p. 523-542 (Lecture Notes in Computer Science (LNCS); No. 10992).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  27. 2017
  28. Published

    On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. / Freksen, Casper Benjamin; Larsen, Kasper Green.

    28th International Symposium on Algorithms and Computation (ISAAC 2017). ed. / Okamoto Yoshio; Takeshi Tokuyama. Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2017. p. 32:1-32:12 32 (Leibniz International Proceedings in Informatics, Vol. 92).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  29. Published

    A Dichotomy for Regular Expression Membership Testing. / Bringmann, K.; Grønlund, A.; Larsen, K. G.

    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, 2017. p. 307-318.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  30. Published

    Optimality of the Johnson-Lindenstrauss Lemma. / Larsen, K. G.; Nelson, J.

    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). 2017. p. 633-638 8104096.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  31. Published

    DecreaseKeys are expensive for external memory priority queues. / Eenberg, Kasper; Larsen, Kasper Green; Yu, Huacheng.

    STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Vol. Part F128415 New York, NY : Association for Computing Machinery, 2017. p. 1081-1093.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  32. Published

    Faster Online Matrix-Vector Multiplication. / Larsen, Kasper Green; Williams, Ryan.

    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Philip N. Klein . Vol. PRDA17 Society for Industrial and Applied Mathematics, 2017. p. 2182-2189.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  33. 2016
  34. Published

    Heavy hitters via cluster-preserving clustering. / Larsen, Kasper Green; Nelson, Jelani; Nguyen, Huy L.; Thorup, Mikkel.

    2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2016. p. 61-70.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  35. Published

    How to prove knowledge of small secrets. / Baum, Carsten; Damgård, Ivan Bjerre; Larsen, Kasper Green; Nielsen, Michael.

    Annual Cryptology Conference : CRYPTO 2016: Advances in Cryptology – CRYPTO 2016. ed. / Jonathan Katz; Matthew Robshaw. Vol. 9816 Berlin, Heidelberg : Springer VS, 2016. p. 478-498 (Lecture Notes in Computer Science, Vol. 9816).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  36. Published

    The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. / Larsen, Kasper Green; Nelson, Jelani.

    In: Leibniz International Proceedings in Informatics, Vol. 55, 2016, p. 82:1 - 82:11.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearch

  37. Published

    Towards Tight Lower Bounds for Range Reporting on the RAM. / Grønlund, Allan; Larsen, Kasper Green.

    In: Leibniz International Proceedings in Informatics, Vol. 55, 2016, p. 92:1 - 92:12.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearch

  38. 2015
  39. Published

    Adapt or Die : Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures. / Brody, Joshua Eric; Larsen, Kasper Green.

    In: Theory of Computing, Vol. 11, No. 19, 2015, p. 471-489.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  40. Published

    Approximate Range Emptiness in Constant Time and Optimal Space. / Goswami, Mayank; Jørgensen, Allan Grønlund; Larsen, Kasper Green; Pagh, Rasmus.

    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15. Society for Industrial and Applied Mathematics, 2015. p. 769-775.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  41. Published

    New Unconditional Hardness Results for Dynamic and Online Problems. / Clifford, Raphaël; Jørgensen, Allan Grønlund; Larsen, Kasper Green.

    56th IEEE Symposium on Foundations of Computer Science (FOCS) Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society Press, 2015.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  42. Published

    On hardness of several string indexing problems. / Larsen, Kasper Green; Munro, J. Ian; Nielsen, Jesper Sindahl; Thankachan, Sharma V.

    In: Theoretical Computer Science, Vol. 582, 2015, p. 74-82.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  43. Published

    Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. / Larsen, Kasper Green; Nelson, Jelani; Nguyen, Huy L.

    Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15. ed. / Rocco Servedio ; Ronitt Rubinfeld . Association for Computing Machinery, 2015. p. 803-812.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  44. 2014
  45. Published

    Near-optimal labeling schemes for nearest common ancestors. / Alstrup, Stephen; Bistrup Halvorsen, Esben; Larsen, Kasper Green.

    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, 2014. p. 972-982.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  46. Published

    Linear-Space Data Structures for Range Mode Query in Arrays. / Chan, Timothy M.; Durocher, Stephane; Larsen, Kasper Green; Morrison, Jason; Wilkinson, Bryan T.

    In: Theory of Computing Systems, Vol. 55, No. 4, 2014, p. 719-741.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  47. Published

    ON range searching in the group model and combinatorial discrepancy. / Larsen, Kasper Green.

    In: S I A M Journal on Computing, Vol. 43, No. 2, 2014, p. 673-686.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  48. Published

    On Hardness of Several String Indexing Problems. / Larsen, Kasper Green; Munro, J. Ian; Nielsen, Jesper Asbjørn Sindahl; Thankachan, Sharma V.

    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. ed. / Alexander Kulikov; Sergei O. Kuznetsov ; Pavel Pevzner. Springer VS, 2014. p. 242-251 (Lecture Notes in Computer Science, Vol. 8486).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  49. Published

    Optimal Planar Orthogonal Skyline Counting Queries. / Brodal, Gerth Stølting; Larsen, Kasper Green.

    Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Denmark. Proceedings. ed. / R. Ravi; Inge Li Gørtz. Springer VS, 2014. p. 110-121 (Lecture Notes in Computer Science, Vol. 8503).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  50. 2013
  51. Published

    (Approximate) Uncertain Skylines. / Afshani, Peyman; Agarwal, Pankaj K.; Arge, Lars; Larsen, Kasper Green; Phillips, Jeff.

    In: Theory of Computing Systems, Vol. 52, No. 3, 2013, p. 342-366.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  52. Published

    Models and Techniques for Proving Data Structure Lower Bounds. / Larsen, Kasper Green.

    Department of Computer Science, Aarhus University, 2013. 102 p.

    Research output: Book/anthology/dissertation/reportPh.D. thesis

  53. Published

    Near-Optimal Range Reporting Structures for Categorical. / Larsen, Kasper Green; Walderveen, Freek van.

    Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, 2013. p. 265-276 (The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  54. Published

    Succinct Sampling from Discrete Distributions. / Bringmann, Karl ; Larsen, Kasper Green.

    Proceedings of the 45th annual ACM Symposium on Theory of Computing, STOC '13. Association for Computing Machinery, 2013. p. 775-782 (A C M Symposium on the Theory of Computing. Annual Proceedings).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  55. Published

    The Query Complexity of Finding a Hidden Permutation. / Afshani, Peyman; Agrawal, Manindra; Benjamin, Doerr; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt.

    Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. ed. / Andrej Brodnik; Alejandro López-Ortiz; Venkatesh Raman; Alfredo Viola. Springer VS, 2013. p. 1-11 (Lecture Notes in Computer Science, Vol. 8066).

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearchpeer-review

  56. 2012
  57. Published

    Higher Cell Probe Lower Bounds for Evaluating Polynomials. / Larsen, Kasper Green.

    FOCS'12: IEEE 53rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, 2012. p. 293 - 301 .

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  58. Published

    Higher-dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model. / Arge, Lars; Afshani, Peyman; Larsen, Kasper Green.

    Proceedings of the 2012 Symposuim on Computational Geometry. Association for Computing Machinery, 2012. p. 323-338.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  59. Published

    I/O-Efficient Data Structures for Colored Range and Prefix Reporting. / Larsen, Kasper Green; Pagh, Rasmus.

    In: The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, Vol. 23, 2012, p. 583-592.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  60. Published

    I/O-Efficient Spatial Data Structures for Range Queries. / Arge, Lars; Larsen, Kasper Green.

    In: SIGSPATIAL Special, Vol. 4, No. 2, 2012, p. 2-7.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperLetterResearch

  61. Published

    Improved Range Searching Lower Bounds. / Larsen, Kasper Green; Nguyen, Huy L.

    Proceedings of the 2012 symposuim on Computational Geometry: Chapel Hill, NC, USA — June 17 - 20, 2012 . Association for Computing Machinery, 2012. p. 171-178.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  62. Published

    Linear-Space Data Structures for Range Mode Query in Arrays. / Chan, Timothy M.; Durocher, Stephane; Larsen, Kasper Green; Morrison, Jason; Wilkinson, Bryan T.

    In: Leibniz International Proceedings in Informatics, Vol. 14, 2012, p. 290-301.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  63. Published

    The Cell Probe Complexity of Dynamic Range Counting. / Larsen, Kasper Green.

    STOC’12 : Proceedings of the 44th symposium on Theory of Computing. Association for Computing Machinery, 2012. p. 85-94.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  64. Published

    The Query Complexity of Finding a Hidden Permutation. / Afshani, Peyman; Afrawal, Manindra; Benjamin, Doerr ; Larsen, Kasper Green; Mehlhorn, Kurt; Winzen, Carola.

    In: Electronic Colloquium on Computational Complexity, No. TR12-087, 2012.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  65. 2011
  66. Published

    (Approximate) Uncertain Skylines. / Afshani, Peyman; Agarwal, Pankaj K.; Arge, Lars Allan; Larsen, Kasper Green; Phillips, Jeff M.

    Proceedings of the 14th International Conference on Database Theory . Association for Computing Machinery, 2011. p. 186-196.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  67. Published

    On Range Searching in the Group Model and Combinatorial Discrepancy. / Larsen, Kasper Green.

    2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) . IEEE Computer Society Press, 2011. p. 542-549.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  68. Published

    Orthogonal Range Searching on the RAM, Revisited. / Chan, Timothy M.; Larsen, Kasper Green; Patrascu, Mihai.

    Proceedings of the 27th annual ACM symposium on Computational geometry . Association for Computing Machinery, 2011. p. 1-10.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  69. Published

    Range Selection and Median : Tight Cell Probe Lower Bounds and Adaptive Data Structures . / Jørgensen, Allan Grønlund; Larsen, Kasper Green.

    Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2011. Society for Industrial and Applied Mathematics, 2011. p. 805-813.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  70. 2010
  71. Published

    Cell Probe Lower Bounds and Approximations for Range Mode. / Jørgensen, Allan Grønlund; Greve, Mark; Larsen, Kasper Dalgaard; Truelsen, Jakob.

    In: Lecture Notes in Computer Science, Vol. 6198, 2010, p. 605-616.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  72. Published

    Cleaning Massive Sonar Point Clouds. / Arge, Lars Allan; Larsen, Kasper Green; Mølhave, Thomas; Walderveen, Freek van.

    Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems. GIS '10. Association for Computing Machinery, 2010. p. 152-161.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  73. Published

    I/O-efficient Orthogonal Range Reporting in Three and Higher Dimensions. / Afshani, Peyman; Arge, Lars Allan; Larsen, Kasper Dalgaard.

    2010. Abstract from Workshop on Massive Data Algorithms, Snowbird, United States.

    Research output: Contribution to conferenceConference abstract for conferenceResearch

  74. Published

    Orthogonal Range Reporting: Query Lower Bounds, Optimal Structures in 3-d, and Higher Dimensional Improvements. / Afshani, Peyman; Arge, Lars Allan; Larsen, Kasper Dalgaard.

    In: Annual A C M Symposium on Computational Geometry. Proceedings, 2010, p. 240-246.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  75. 2009
  76. Published

    Orthogonal Range Reporting in Three and Higher Dimensions. / Afshani, Peyman; Arge, Lars Allan; Larsen, Kasper Dalgaard.

    In: Symposium on Foundations of Computer Science. Annual Proceedings, 2009, p. 149-158.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  77. 2007
  78. Published

    Mental Models and Programming Aptitude. / Caspersen, Michael Edelgaard; Bennedsen, Jens; Larsen, Kasper Dalgaard.

    In: S I G C S E Bulletin Inroads, Vol. 39, No. 3, 2007, p. 206-210.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review