Aarhus University Seal

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

Boudol, G., Castellani, I., Hennessy, M., Nielsen, M. & Winskel, G. (2008). Twenty Years on: Reflections on the CEDISYS Project: Combining True Concurrency with Process Algebra. Lecture Notes in Computer Science, 5065, 757-777. https://doi.org/10.1007/978-3-540-68679-8_47
Reyzin, L., Smith, A. & Yakoubov, S. (2021). Turning HATE Into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC. In Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Proceedings: Proceedings (Vol. 12716, pp. 361-378). Springer. https://doi.org/10.1007/978-3-030-78086-9_27
Derczynski, L., Chester, S. & Bøgh, K. S. (2015). Tune Your Brown Clustering, Please. In G. A. Angelova, K. Bontcheva & R. Mitkov (Eds.), International Conference Recent Advances in Natural Language Processing ’2015 Proceedings (pp. 110–117). INCOMA Ltd. http://lml.bas.bg/ranlp2015/docs/RANLP_main.pdf
Christensen, H. B. (2005). TS-05: 150 lines of java with high architectural complexity. In 10th annual SIGCSE conference on Innovation and technology in computer science education, ITiCSE '05 Proceedings (Caparica, Portugal, June 27-29, 2005) (pp. 396-396). Association for Computing Machinery. https://doi.org/10.1145/1067445.1067599
Caragiannis, I., Filos-Ratsikas, A., Nath, S. & Voudouris, A. (2024). Truthful ownership transfer with expert advice. Mathematical Programming, 203(1-2), 871-900. https://doi.org/10.1007/s10107-022-01834-3
Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S. K. S., Hansen, K. A. & Tan, Z. (2016). Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship. In Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings (Vol. 10123, pp. 236-250). Springer VS. https://doi.org/10.1007/978-3-662-54110-4_17
Filos-Ratsikas, A. & Miltersen, P. B. (2014). Truthful Approximations to Range Voting. In T.-Y. Liu, Q. Qi & Y. Ye (Eds.), Web and Internet Economics : 10th Workshop of Internet and Web Economics (WINE), proceedings (pp. 175-188 ). Springer VS. https://doi.org/10.1007/978-3-319-13129-0_13
Caragiannis, I., Christodoulou, G. & Protopapas, N. (2022). Truthful Aggregation of Budget Proposals with Proportionality Guarantees. Proceedings of the AAAI Conference on Artificial Intelligence, 36(5), 4917-4924. https://doi.org/10.1609/aaai.v36i5.20421
Caragiannis, I., Christodoulou, G. & Protopapas, N. (2024). Truthful aggregation of budget proposals with proportionality guarantees. Artificial Intelligence, 335, Article 104178. https://doi.org/10.1016/j.artint.2024.104178
Nielsen, M. & Krukow, K. (2007). Trust Structures. International Journal of Information Security, 6(2-3), 153-181.
Nielsen, M., Krukow, K. & Sassone, V. (2008). Trust Models in Ubiquitous Computing. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 366(1881), 3781-3793. https://doi.org/10.1098/rsta.2008.0134
Carbone, M., Nielsen, M. & Sassone, V. (2004). Trust in Global Computing. Association for Logic Programming Newsletter, 17(4).
Nielsen, M. (2014). Trust in Event Structures. Theoretical Computer Science, 546(August), 3-6. https://doi.org/10.1016/j.tcs.2014.02.039
Carbone, M. (2005). Trust and Mobility. Aarhus Universitet.
Engberg, U. H. (1990). True Concurrency can be Traced. Daimi Report No. PB-308
Condit, R., Ashton, P., Balslev, H., Brokaw, N., Bunyavejchewin, S., Chuyong, G., Co, L., Shivaramaiah, H. S., Davies, S., Ewango, C. E. N., Foster, R., Gunatilleke, N., Gunatilleke, S., Hernandez, C., Hubbell, S., John, R., Kenfack, D., Kiratiprayoon, S., Hall, P. ... Zimmerman, J. K. (2005). Tropical tree α-diversity: Results from a worldwide network of large plots. Biologiske Skrifter, 55, 565-582.
Scheder, D. (2013). Trivial, tractable, hard. A not so sudden complexity jump in neighborhood restricted CNF formulas. In L. Cai, S.-W. Cheng & A.-W. Lam (Eds.), Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (pp. 251-261). Springer VS. https://doi.org/10.1007/978-3-642-45030-3_24
Mogensen, P. H. & Robinson, M. (1995). Triggering Artefacts. AI & Society, 9(4), 373-388. https://doi.org/10.1007/BF01210588
Rachuri, S. R., Suresh, A. & Chaudhari, H. (2020). Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning. In Proceedings 2020 Network and Distributed System Security Symposium (pp. 1-18). Internet Society. https://doi.org/10.14722/ndss.2020.23005
Abdul, A., Vermeulen, J., Wang, D., Lim, B. Y. & Kankanhalli, M. (2018). Trends and Trajectories for Explainable, Accountable and Intelligible Systems: An HCI Research Agenda. In R. Mandryk & M. Hancock (Eds.), CHI 2018 - Extended Abstracts of the 2018 CHI Conference on Human Factors in Computing Systems: Engage with CHI (pp. 582:1-582:18). Association for Computing Machinery. https://doi.org/10.1145/3173574.3174156
Valencia, R., Foster, R. B., Villa, G., Condit, R., Svenning, J.-C., Hernandez, C., Romoleroux, K., Losos, E., Magård, E. & Balslev, H. (2004). Tree species distributions and local habitat variation in the Amazon: large forest plot in eastern Ecuador. Journal of Ecology, 92, 214-229.
Ferragina, P. & Satti, S. R. (2008). Tree Compression and Indexing. In Encyclopedia of Algorithms (pp. 1-99). Springer.
Corry, A. V., Hansen, K. M. & Svensson, D. (2006). Traveling Architects: A New Way of Herding Cats. In C. Hofmeister, I. Crnkovic & R. Reussner (Eds.), Quality of Software Architectures (pp. 111-126). Springer. https://doi.org/10.1007/11921998_12
Bertelsen, O. W. (2004). Transparency by Tertiary Artefactness. In Workshop on Aesthetic Approaches to Human-Computer Interaction (Vol. DAIMI PB-572, pp. 1-4). Department of Computer Science.
van der Aalst, W. M. P. & Lassen, K. B. (2008). Translating Unstructured Workflow Processes to Readable BPEL: Theory and Implementation. Information and Software Technology, 50(3), 131-159.
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. & 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. (2006). Translating BPEL to FLOWer. (pp. 1-24). Aarhus Universitetsforlag.
Nielsen, M., Rozenberg, G. & Thiagarajan, P. S. (1995). Transition-Systems, Event Structures, and Unfoldings. Information and Computation, 118(2), 191-207. https://doi.org/10.1006/inco.1995.1062
Nielsen, M., Rozenberg, G. & Thiagarajan, P. S. (1991). Transition Systems, Event Structures and Unfoldings. Department of Computer Science, Aarhus University.
Schulz, H.-J. & Weaver, C. (2024). Transient Visual Analytics. In D. Fellner, D. Fellner, M. El-Assady & H.-J. Schulz (Eds.), EuroVA 2024 - EuroVis Workshop on Visual Analytics The Eurographics Association. https://doi.org/10.2312/eurova.20241108
Mendling, J., Lassen, K. B. & Zdun, U. (2006). Transformation Strategies between Block-Oriented and Graph-Oriented Process Modelling Languages. In 3rd GI Workshop XML4BPM - XML Integration and Transformation for Business Process Management at MKWI 2006
Mendling, J., Lassen, K. B. & Zdun, U. (2005). Transformation Strategies between Block-Oriented and Graph-Oriented Process Modelling Languages. (pp. 20). Vienna University of Economics and Business Administration.
Svendsen, K., Sieczkowski, F. & Birkedal, L. (2016). Transfinite step-indexing: Decoupling concrete and logical steps. In P. Thiemann (Ed.), Programming Languages and Systems (Vol. 9632, pp. 727-751). Springer VS. https://doi.org/10.1007/978-3-662-49498-1_28
Spies, S., Gäher, L., Gratzer, D., Tassarotti, J., Krebbers, R., Dreyer, D. & Birkedal, L. (2021). Transfinite Iris: Resolving an existential dilemma of step-indexed separation logic. In S. N. Freund & E. Yahav (Eds.), PLDI 2021 - Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 80-95). Association for Computing Machinery. https://doi.org/10.1145/3453483.3454031