Kasper Green Larsen

Distributed Shuffling in Adversarial Environments. / Larsen, Kasper Green; Obremski, Maciej; Simkin, Mark.
4th Conference on Information-Theoretic Cryptography, ITC 2023. red. / Kai-Min Chung. Dagstuhl Publishing, 2023. 10 (Leibniz International Proceedings in Informatics, LIPIcs, Bind 267).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Barriers for Faster Dimensionality Reduction. / Fandina, Ora Nova; Høgsgaard, Mikael Møller; Larsen, Kasper Green.
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023. red. / Petra Berenbrink; Patricia Bouyer; Anuj Dawar; Mamadou Moustapha Kante. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2023. 31 (Leibniz International Proceedings in Informatics, LIPIcs, Bind 254).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Hierarchical Categories in Colored Searching. / Afshani, Peyman; Killmann, Rasmus; Larsen, Kasper Green.
33rd International Symposium on Algorithms and Computation, ISAAC 2022. red. / Sang Won Bae; Heejin Park. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022. 25 (Leibniz International Proceedings in Informatics, LIPIcs, Bind 248).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Towards optimal lower bounds for k-median and k-means coresets. / Cohen-Addad, Vincent; Larsen, Kasper Green; Saulpic, David et al.
STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. red. / Stefano Leonardi; Anupam Gupta. Association for Computing Machinery, 2022. s. 1038-1051.

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. / Bartal, Yair; Fandina, Ora Nova; Larsen, Kasper Green.
38th International Symposium on Computational Geometry, SoCG 2022. red. / Xavier Goaoc; Michael Kerber. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022. 13 (Leibniz International Proceedings in Informatics, LIPIcs, Bind 224).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions. / Fleischhacker, Nils; Larsen, Kasper Green; Simkin, Mark.
Advances in Cryptology – EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. red. / Orr Dunkelman; Stefan Dziembowski. Springer, 2022. s. 764-781 (Lecture Notes in Computer Science (LNCS), Bind 13276).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Broadcast secret-sharing, bounds and applications. / Damgård, Ivan Bjerre; Larsen, Kasper Green; Yakoubov, Sophia.
2nd Conference on Information-Theoretic Cryptography, ITC 2021. red. / Stefano Tessaro. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021. 10 (Leibniz International Proceedings in Informatics, LIPIcs, Bind 199).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

CountSketches, Feature Hashing and the Median of Three. / Larsen, Kasper Green; Pagh, Rasmus; Tetek, Jakub.
Proceedings of the 38th International Conference on Machine Learning, ICML 2021. red. / Marina Meila; Tong Zhang. 2021. s. 6011-6020 (Proceedings of Machine Learning Research, Bind 139).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Optimal oblivious priority queues. / Jafargholi, Zahra; Larsen, Kasper Green; Simkin, Mark.
ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. red. / Daniel Marx. Association for Computing Machinery, 2021. s. 2366-2383 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Lower Bounds for Multi-server Oblivious RAMs. / Larsen, Kasper Green; Simkin, Mark; Yeo, Kevin.
Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. red. / Rafael Pass; Krzysztof Pietrzak. Cham: Springer, 2020. s. 486-503 (Lecture Notes in Computer Science, Bind 12550).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Lower Bounds for Oblivious Near-Neighbor Search. / Larsen, Kasper Green; Malkin, Tal; Weinstein, Omri et al.
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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Lower bounds for external memory integer sorting via network coding. / Farhadi, Alireza; Hajiaghayi, Mohammad Taghi; Larsen, Kasper Green et al.
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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Margin-Based Generalization Lower Bounds for Boosted Classifiers. / Grønlund, Allan; Kamma, Lior; Larsen, Kasper Green et al.
Advances in Neural Information Processing Systems 32 (NIPS 2019). red. / Hanna Wallach; Hugo Larochelle; Alina Beygelzimer; Florence d'Alché-Buc; Emily Fox; Roman Garnett. Bind 32 Neural Information Processing Systems Foundation, 2019.

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Optimal Minimal Margin Maximization with Boosting. / Grønlund, Allan; Larsen, Kasper Green; Mathiasen, Alexander.
36th International Conference on Machine Learning, ICML 2019. 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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Upper and lower bounds for dynamic data structures on strings. / Clifford, Raphael; Grønlund, Allan; Larsen, Kasper Green et al.
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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

A Dichotomy for Regular Expression Membership Testing. / Bringmann, K.; Grønlund, A.; Larsen, K. G.
Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society Press, 2017. s. 307-318 8104068.

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Optimality of the Johnson-Lindenstrauss Lemma. / Larsen, K. G.; Nelson, J.
Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017. 2017. s. 633-638 8104096.

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Faster Online Matrix-Vector Multiplication. / Larsen, Kasper Green; Williams, Ryan.
28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. red. / Philip N. Klein . Bind PRDA17 Society for Industrial and Applied Mathematics, 2017. s. 2182-2189.

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Heavy hitters via cluster-preserving clustering. / Larsen, Kasper Green; Nelson, Jelani; Nguyen, Huy L. et al.
Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE, 2016. s. 61-70 7782918.

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

How to prove knowledge of small secrets. / Baum, Carsten; Damgård, Ivan Bjerre; Larsen, Kasper Green et al.
Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: 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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Approximate Range Emptiness in Constant Time and Optimal Space. / Goswami, Mayank; Jørgensen, Allan Grønlund; Larsen, Kasper Green et al.
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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

On Hardness of Several String Indexing Problems. / Larsen, Kasper Green; Munro, J. Ian; Nielsen, Jesper Asbjørn Sindahl et al.
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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

The Query Complexity of Finding a Hidden Permutation. / Afshani, Peyman; Agrawal, Manindra; Benjamin, Doerr et al.
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/proceeding › Bidrag til bog/antologi › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

(Approximate) Uncertain Skylines. / Afshani, Peyman; Agarwal, Pankaj K.; Arge, Lars Allan et al.
Proceedings of the 14th International Conference on Database Theory . Association for Computing Machinery, 2011. s. 186-196.

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

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/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Cleaning Massive Sonar Point Clouds. / Arge, Lars Allan; Larsen, Kasper Green; Mølhave, Thomas et al.
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/proceeding › Konferencebidrag i proceedings › Forskning › peer review