Publications

Search for publications at Department of Computer Science

Below you find a complete list of publications published and edited by scientists at the Department of Computer Science

Sort by: Date | Author | Title

Laursen, M. R., Xu, W. & Møller, A. (2024). Reducing Static Analysis Unsoundness with Approximate Interpretation. Proceedings of the ACM on Programming Languages , 8, 1165-1188. https://doi.org/10.1145/3656424

Lassen, K. B. & van der Aalst, W. M. P. (2007). WorkflowNet2BPEL4WS: A Tool for Translating Unstructured Workflow Processes to Readable BPEL. In On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE (4275 of Lecture Notes in Computer Science ed., pp. 127-144). Springer.

Lassen, K. B. (2006). Translating BPEL to FLOWer. (pp. 1-24). Aarhus Universitetsforlag.

Lassen, K. B. & Westergaard, M. (2006). Embedding Java Types in CPN Tools: Technical Report. http://www.daimi.au.dk/~krell/download.php?file=Embedding Java Types in CPN Tools.pdf.

Lassen, K. B. (2007). Converting Workflow Nets to BPEL 1.1 in ProM: This is a conversion plugin for the process mining framework ProM.. Computer programme .

Lassen, K. B. (2006). Progress Report: From Real World Problems to Implementation Using Coloured Petri Nets and Translations Between Workflow Languages. Datalogisk Institut, Aarhus Universitet.

Lassen, K. B., van Dongen, B. & van der Aalst, W. M. P. (2007). Translating Message Sequence Charts to other Process Languages using Process Mining. (207 ed.) (pp. 1-15). Eindhoven Technical University.

Lassen, K. B. & van Dongen, B. F. (2008). Translating Message Sequence Charts to other Process Languages using Process. Lecture Notes in Computer Science, 5100, 71-85. https://doi.org/10.1007/978-3-540-89287-8_5

Lassen, K. B. & Tjell, S. (2007). Translating Colored Control Flow Nets into Readable Java via Annotated Java Workflow Nets. In K. Jensen (Ed.), Proceedings of the Eighth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (8 ed., pp. 127-146)

Lassen, K. B. & van der Aalst, W. M. P. (2009). Complexity Metrics for Workflow Nets. Information and Software Technology, 51(3), 610-626.

Lassen, K. B. (2008). Using Formal Behavioral Modelsin Software Development:From Real-World Problems to Software Systems. Aarhus Universitetsforlag.

Larsen-Ledet, I. (2018). Privacy in Collaborative Work: A Situated Challenge. 1. Abstract from 2018 CHI Conference on Human Factors in Computing Systems, CHI 2018, Montreal, Canada.

Larsen-Ledet, I., Bressa, N. A. & Vermeulen, J. (2019). Reflections on Teaching a Mandatory HCI Course to Computer Science Undergraduates. Paper presented at The 2019 EduCHI Symposium on HCI Teaching and Learning, Glasgow, United Kingdom. https://educhi2019.hcilivingcurriculum.org/wp-content/uploads/2019/04/p09-Reflections-on-Teaching-a-Mandatory-HCI-Course-to-Computer-Science-Undergraduates.pdf

Larsen-Ledet, I. (2020). Understanding and Supporting Collaborative Academic Writing as a Fragmented Process. Paper presented at The ECSCW 2019 Doctoral Colloquium, Salzburg, Austria. https://doi.org/10.18420/ecscw2019_dc6

Larsen-Ledet, I. & Korsgaard, H. (2019). Territorial Functioning in Collaborative Writing: Fragmented Exchanges and Common Outcomes. Computer Supported Cooperative Work, 28(3-4), 391-433. https://doi.org/10.1007/s10606-019-09359-8

Larsen-Ledet, I., Korsgaard, H. & Bødker, S. (2020). Collaborative Writing Across Multiple Artifact Ecologies. In CHI 2020 - Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems Article 3376422 Association for Computing Machinery. https://doi.org/10.1145/3313831.3376422

Larsen-Ledet, I. (2020). More Than Writing Text: Multiplicity in Collaborative Academic Writing. Århus Universitet.

Larsen-Ledet, I. & Borowski, M. (2020). "It Looks Like You Don't Agree": Idiosyncratic Needs and Practices in Collaborative Writing. In N. Ahmadpour, T. Leong, B. Ploderer, C. Parker, S. Webber, D. Munoz, L. Loke & M. Tomitsch (Eds.), OzCHI '20: 32nd Australian Conference on Human-Computer Interaction (pp. 339-354). Association for Computing Machinery. https://doi.org/10.1145/3441000.3441032

Larsen, R. D. & Bouvin, N. O. (2004). HyperPeer: Searching for resemblance in a P2P network. In Fifteenth ACM conference on Hypertext & Hypermedia (pp. 268-269). Association for Computing Machinery. https://doi.org/10.1145/1012807.1012873

Larsen, S. B., Clemensen, J. & Ejskjær, N. (2006). A feasibility study of UMTS mobile phones for supporting nurses doing home visits to patients with diabetic foot ulcers. Journal of Telemedicine and Telecare, 12(7), 363-369(5).

Larsen, S. B. (2006). Pervasive Home Care - Technological support for treatment of diabetic foot ulcers at home. Daimi PhD Dissertation No. PD-06-11 http://www.daimi.au.dk/PD/06/11/PD-06-11.pdf

Larsen, S. B. & Bardram, J. E. (2008). Competence articulation: Alignment of competences and responsibilities in synchronous telemedical collaboration. In M. Czerwinski, A. Lund & D. Tan (Eds.), CHI 2008 Proceedings: Proceeding of the twenty-sixth annual SIGCHI conference on Human factors in computing systems (pp. 553-562). Association for Computing Machinery.

Larsen, T. W. & Mayoh, B. H., (TRANS.) (2008). Process Grammar and Process History for 2D Objects. Datalogisk Institut, Aarhus Universitet. DAIMI PB No. 586

Larsen, K. G. & Nielsen, M. (Eds.) (2001). CONCUR 2001 - Concurrency Theory: 12th International Conference Aalborg, Denmark, August 20-25, 2001 Proceedings. Springer. Lecture Notes in Computer Science Vol. 2154 https://doi.org/10.1007/3-540-44685-0

Larsen, P. G., Rovsing, P. E. & Toftegaard, T. S. (2010). Challenges in Gaining Large Scale Carbon Reductions through Wireless Home Automation Systems. In M. S. Alencar & V. C. da Rocha Jr. (Eds.), Proceedings of the WPMC 2010 Internation Symposium on Wireless Personal Multimedia Communications.

Larsen, J., Green, O., Nadimi, E. S. & Toftegaard, T. S. (2011). The Effect on Wireless Sensor Communication When Deployed in Biomass. Sensors, 11(9), 8295-8308. https://doi.org/10.3390/s110908295

Larsen, K. G. (2011). On Range Searching in the Group Model and Combinatorial Discrepancy. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 542-549). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2011.14

Larsen, K. G. (2012). Higher Cell Probe Lower Bounds for Evaluating Polynomials. In FOCS'12: IEEE 53rd Annual Symposium on Foundations of Computer Science (pp. 293 - 301 ). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2012.21

Larsen, K. G. (2012). The Cell Probe Complexity of Dynamic Range Counting. In STOC’12 : Proceedings of the 44th symposium on Theory of Computing (pp. 85-94). Association for Computing Machinery. https://doi.org/10.1145/2213977.2213987

Larsen, K. G. & Pagh, R. (2012). I/O-Efficient Data Structures for Colored Range and Prefix Reporting. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 23, 583-592. http://siam.omnibooksonline.com/2012SODA/index.html

Larsen, K. G. & Nguyen, H. L. (2012). Improved Range Searching Lower Bounds. In Proceedings of the 2012 symposuim on Computational Geometry: Chapel Hill, NC, USA — June 17 - 20, 2012 (pp. 171-178). Association for Computing Machinery. https://doi.org/10.1145/2261250.2261275

Larsen, K. G. (2013). Models and Techniques for Proving Data Structure Lower Bounds. Department of Computer Science, Aarhus University.

Larsen, K. G. & Walderveen, F. V. (2013). Near-Optimal Range Reporting Structures for Categorical. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 (pp. 265-276). Association for Computing Machinery. http://knowledgecenter.siam.org/0236-000081/~~PdfSource/0

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

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

Larsen, K. G., Munro, J. I., Nielsen, J. S. & Thankachan, S. V. (2015). On hardness of several string indexing problems. Theoretical Computer Science, 582, 74-82. https://doi.org/10.1016/j.tcs.2015.03.026

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

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

Larsen, K. G. & Nelson, J. (2016). The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. Leibniz International Proceedings in Informatics, 55, 82:1 - 82:11. https://doi.org/10.4230/LIPIcs.ICALP.2016.82

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

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., Nelson, J., Huy L Nguyen & Thorup, M. (2019). Heavy Hitters via Cluster-Preserving Clustering. Communications of the ACM, 62(8), 95-100. https://doi.org/10.1145/3339185

Larsen, K. G. (2014). ON range searching in the group model and combinatorial discrepancy. S I A M Journal on Computing, 43(2), 673-686. https://doi.org/10.1137/120865240

Larsen, K. G., Malkin, T., Weinstein, O. & Yeo, K. (2020). Lower Bounds for Oblivious Near-Neighbor Search. In S. Chawla (Ed.), SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1116-1134). Society for Industrial and Applied Mathematics. https://doi.org/10.5555/3381089.3381157

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

Larsen, M. R. E., Han, W. & Schulz, H.-J. (2020). Sketchy Rendering to Aid the Recollection of Regular Visualizations. In EuroVis 2020: Short Papers (pp. 139-143). Eurographics Association. https://doi.org/10.2312/evs.20201062

Larsen, K. G., Mitzenmacher, M. & Tsourakakis, C. E. (2020). Optimal Learning of Joint Alignments with a Faulty Oracle. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 (pp. 2492-2497). IEEE. https://doi.org/10.1109/ISIT44484.2020.9174310

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 566-578). Springer. https://doi.org/10.1007/978-3-030-57990-6_28

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

Displaying results 1751 to 1800 out of 5640

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University