Aarhus University Seal / Aarhus Universitets segl

Kasper Green Larsen

  1. 2021
  2. Udgivet

    Further Unifying the Landscape of Cell Probe Lower Bounds. / Larsen, Kasper Green; Starup, Jonathan Lindegaard; Steensgaard, Jesper.

    2021. Paper præsenteret ved Happening virtually , -.

    Publikation: KonferencebidragPaperForskningpeer review

  3. 2020
  4. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  5. Udgivet

    Lower Bounds for Multi-server Oblivious RAMs. / Larsen, Kasper Green; Simkin, Mark; Yeo, Kevin.

    Theory of Cryptography. red. / Rafael Pass; Krzysztof Pietrzak. Cham : Springer, 2020. s. 486-503 (Lecture Notes in Computer Science, Bind 12550).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  6. Udgivet

    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. red. / Shuchi Chawla. Philadelphia : Society for Industrial and Applied Mathematics, 2020. s. 1116-1134.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  7. Udgivet

    Margins are Insufficient for Explaining Gradient Boosting. / Grønlund, Allan; Kamma, Lior; Larsen, Kasper Green.

    Advances in Neural Information Processing Systems 33 (NeurIPS 2020). red. / Hugo Larochelle; Marc'Aurelio Ranzato; Raia Hadsell; Maria-Florina Balcan; Hsuan-Tien Lin. 2020.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  8. Udgivet

    Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. / Grønlund, Allan; Kamma, Lior; Larsen, Kasper Green.

    International Conference on Machine Learning. red. / Hal Daumé III; Aarti Singh. MLResearch Press, 2020. s. 3779-3788 (Proceedings of Machine Learning Research, Bind 119).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  9. Udgivet

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

    I: Algorithmica, Bind 82, Nr. 2, 2020, s. 338-354.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  10. Udgivet

    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. s. 2492-2497 (IEEE International Symposium on Information Theory - Proceedings, Bind 2020-June).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  11. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  12. 2019
  13. Udgivet

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

    I: Communications of the ACM, Bind 62, Nr. 8, 08.2019, s. 95-100.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  14. Udgivet

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

    I: Discrete Applied Mathematics, Bind 260, 05.2019, s. 28-50.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  15. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  16. Udgivet

    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. red. / Alexandra Boldyreva; Daniele Micciancio. Bind II Springer, 2019. s. 61-84 (Lecture Notes in Computer Science, Bind 11693).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  17. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  18. Udgivet

    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. red. / Timothy M. Chan. Society for Industrial and Applied Mathematics, 2019. s. 2439-2447 (Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, Bind PRDA19).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  19. Udgivet

    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. red. / Moses Charikar; Edith Cohen. Association for Computing Machinery, 2019. s. 997-1008 (A C M Symposium on the Theory of Computing. Annual Proceedings).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  20. Udgivet

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

    I: Leibniz International Proceedings in Informatics, LIPIcs, Bind 132, 10, 2019.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskning

  21. Udgivet

    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). red. / Hanna Wallach; Hugo Larochelle; Alina Beygelzimer; Florence d'Alché-Buc; Emily Fox; Roman Garnett. Neural Information Processing Systems Foundation, 2019.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  22. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  23. 2018
  24. Udgivet

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

    2018. 1 Poster session præsenteret ved Neural Information Processing Systems Conference, Montreal, Canada.

    Publikation: KonferencebidragPosterForskningpeer review

  25. Udgivet

    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. red. / Monika Henzinger; David Kempe; Ilias Diakonikolas. New York, NY, USA : Association for Computing Machinery, 2018. s. 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; Nr. 2018).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  26. Udgivet

    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. s. 1297-1306 (A C M Symposium on the Theory of Computing. Annual Proceedings; Nr. 2018).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  27. Udgivet

    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.

    I: Politiken, Nr. Sektion 2 (Kultur), 02.03.2018, s. 7.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisBidrag til avis - Kommentar/debatFormidling

  28. Udgivet

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

    23 s. arXiv.org. 2018.

    Publikation: AndetUdgivelser på nettet - Net-publikationForskning

  29. Udgivet

    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 s. arXiv.org. 2018, Internetarkiv.

    Publikation: AndetUdgivelser på nettet - Net-publikationForskningpeer review

  30. Udgivet

    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. red. / Rolf Niedermeier; Brigitte Vallée. Bind 96 Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2018. s. 22:1-22:14 22 (Leibniz International Proceedings in Informatics; Nr. 96).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  31. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  32. 2017
  33. Udgivet

    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). red. / Okamoto Yoshio; Takeshi Tokuyama. Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2017. s. 32:1-32:12 32 (Leibniz International Proceedings in Informatics, Bind 92).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  34. Udgivet

    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. s. 307-318.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  35. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  36. Udgivet

    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. Bind Part F128415 New York, NY : Association for Computing Machinery, 2017. s. 1081-1093.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  37. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  38. 2016
  39. Udgivet

    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. s. 61-70.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  40. Udgivet

    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. red. / Jonathan Katz; Matthew Robshaw. Bind 9816 Berlin, Heidelberg : Springer VS, 2016. s. 478-498 (Lecture Notes in Computer Science, Bind 9816).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  41. Udgivet

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

    I: Leibniz International Proceedings in Informatics, Bind 55, 2016, s. 82:1 - 82:11.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskning

  42. Udgivet

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

    I: Leibniz International Proceedings in Informatics, Bind 55, 2016, s. 92:1 - 92:12.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskning

  43. 2015
  44. Udgivet

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

    I: Theory of Computing, Bind 11, Nr. 19, 2015, s. 471-489.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  45. Udgivet

    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. s. 769-775.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  46. Udgivet

    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.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  47. Udgivet

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

    I: Theoretical Computer Science, Bind 582, 2015, s. 74-82.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  48. Udgivet

    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. red. / Rocco Servedio ; Ronitt Rubinfeld . Association for Computing Machinery, 2015. s. 803-812.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  49. 2014
  50. Udgivet

    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. s. 972-982.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  51. Udgivet

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

    I: Theory of Computing Systems, Bind 55, Nr. 4, 2014, s. 719-741.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

  52. Udgivet

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

    I: S I A M Journal on Computing, Bind 43, Nr. 2, 2014, s. 673-686.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  53. Udgivet

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  54. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  55. 2013
  56. Udgivet

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

    I: Theory of Computing Systems, Bind 52, Nr. 3, 2013, s. 342-366.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  57. Udgivet

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

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

    Publikation: Bog/antologi/afhandling/rapportPh.d.-afhandlingForskning

  58. Udgivet

    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. s. 265-276 (The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  59. Udgivet

    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. s. 775-782 (A C M Symposium on the Theory of Computing. Annual Proceedings).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  60. Udgivet

    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. red. / Andrej Brodnik; Alejandro López-Ortiz; Venkatesh Raman; Alfredo Viola. Springer VS, 2013. s. 1-11 (Lecture Notes in Computer Science, Bind 8066).

    Publikation: Bidrag til bog/antologi/rapport/proceedingBidrag til bog/antologiForskningpeer review

  61. 2012
  62. Udgivet

    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. s. 293 - 301 .

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  63. Udgivet

    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. s. 323-338.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  64. Udgivet

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

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

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

  65. Udgivet

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

    I: SIGSPATIAL Special, Bind 4, Nr. 2, 2012, s. 2-7.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisLetterForskning

  66. Udgivet

    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. s. 171-178.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  67. Udgivet

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

    I: Leibniz International Proceedings in Informatics, Bind 14, 2012, s. 290-301.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

  68. Udgivet

    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. s. 85-94.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  69. Udgivet

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

    I: Electronic Colloquium on Computational Complexity, Nr. TR12-087, 2012.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  70. 2011
  71. Udgivet

    (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. s. 186-196.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  72. Udgivet

    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. s. 542-549.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  73. Udgivet

    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. s. 1-10.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  74. Udgivet

    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. s. 805-813.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  75. 2010
  76. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 6198, 2010, s. 605-616.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

  77. Udgivet

    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. s. 152-161.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  78. Udgivet

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

    2010. Abstract fra Workshop on Massive Data Algorithms, Snowbird, USA.

    Publikation: KonferencebidragKonferenceabstrakt til konferenceForskning

  79. Udgivet

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

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

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

  80. 2009
  81. Udgivet

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

    I: Symposium on Foundations of Computer Science. Annual Proceedings, 2009, s. 149-158.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

  82. 2007
  83. Udgivet

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

    I: S I G C S E Bulletin Inroads, Bind 39, Nr. 3, 2007, s. 206-210.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review