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

Soden, R., Ribes, D., Jack, M., Sutherland, W., Khovanskaya, V., Avle, S., Sengers, P. & Bødker, S. (2019). Fostering Historical Research in CSCW & HCI. In CSCW 2019 Companion - Conference Companion Publication of the 2019 Computer Supported Cooperative Work and Social Computing (pp. 517-521). Association for Computing Machinery. https://doi.org/10.1145/3311957.3359436

Snow, S., Vyas, D., Lyle, P., Mallett, M. & Brereton, M. (2016). Building Connections: Technology Design for Living on a Low Income. In A. M. Kanstrup, J. Vines, L. Huybrechts, R. C. Smith, K. Bodker & C. Bossen (Eds.), PDC 2016: Proceedings of the 14th Participatory Design Conference: Short Papers, Interactive Exhibitions, Workshops - Volume 2 (pp. 1-4). Association for Computing Machinery. https://doi.org/10.1145/2948076.2948091

Smith, A. B., Sandel, B., Kraft, N. J. B. & Carey, S. (2013). Characterizing scale-dependent community assembly using the functional-diversity-area relationship. Ecology, 94(11), 2392-2402.

Skyum, S., Frandsen, G. S., Miltersen, P. B. & Binderup, P. G. (1999). The Complexity of Identifying Large Equivalence Classes. Fundamenta Informaticae, 38(1-2), 25-37. https://doi.org/10.3233/FI-1999-381203

Skyum, S. (1974). On extensions of ALGOL-like languages. Information and control, 26(1), 82-97. https://doi.org/10.1016/S0019-9958(74)90732-3

Skyum, S. (1974). Nonterminals and codings in defining variations of OL-systems. In G. Rozenberg & A. Salomaa (Eds.), L Systems (pp. 244-249). Springer. https://doi.org/10.1007/3-540-06867-8_19

Skyum, S. (1974). Parallel context-free languages. Information and control, 26(3), 280-285. https://doi.org/10.1016/S0019-9958(74)91399-0

Skyum, S. (1975). Confusion in the Garden of Eden. Proceedings of the American Mathematical Society, 50, 332-336.

Skyum, S. (1976). Decomposition Theorems for Various Kinds of Languages Parallel in Nature. S I A M Journal on Computing, 5(3), 284-296. https://doi.org/10.1137/0205022

Skyum, S. (1978). On good ETOL forms. Theoretical Computer Science, 7(3), 263-272. https://doi.org/10.1016/0304-3975(78)90017-8

Skyum, S. (1983). A measure in which Boolean negation is exponentially powerful. Information Processing Letters, 17(3), 125-128. https://doi.org/10.1016/0020-0190(83)90051-0

Skyum, S. & Valiant, L. (1985). A complexity theory based on Boolean algebra. Journal of the ACM, 32(2), 484-502. https://doi.org/10.1145/3149.3158

Skyum, S. & Eriksen, O. (1986). Symmetric Distributed Termination. In G. Rozenberg & A. Salomaa (Eds.), The Book of L (pp. 427-430). Springer.

Skyum, S. (1987). A Distributed Election and Spanning Tree Algorithm Based on Depth First Search Traversals. Department of Computer Science, Aarhus University. Daimi Report Series (DAIMI PB) No. 232

Skyum, S. (1991). A simple algorithm for computing the smallest enclosing circle. Information Processing Letters, 37(3), 121-125. https://doi.org/10.1016/0020-0190(91)90030-L

Skyum, S. (1991). A Sweepline Algorithm for Generalized Delaunay Triangulations. Department of Computer Science, Aarhus University. Daimi Report Series (DAIMI PB) No. 373

Skyum, S. (1975). On decomposing languages defined by parallel devices. In STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing (pp. 121-125). Association for Computing Machinery. https://doi.org/10.1145/800116.803760

Skyum, S. (1975). Decomposition of Languages. Paper presented at Conference on Formal Languages, Automata and Development, Noordwijkerhout, Netherlands.

Skyum, S. & Valiant, L. (1981). A complexity theory based on Boolean algebra. In 22nd Annual Symposium on Foundations of Computer Science, 1981. SFCS '81. (pp. 244-253). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1981.3

Skyum, S. (1988). A Distributed Election and Spanning Tree Algorithm Based on Depth First Search. Paper presented at Symposium on Mathematics of Computation. ICOMIDC, Ho Chi Minh City, Viet Nam.

Skyum, S. (1992). A Sweepline Algorithm for Generalized Delaunay Triangulations and a Simple Method for Nearest-Neighbour Search. In Proceedings of the Workshop on Computational Geometry Universiteit Utrecht.

Skyum, S., Larsen, K. G. & Winskel, G. (Eds.) (1998). Automata, Languages and Programming. Springer. Lecture Notes in Computer Science Vol. 1443 https://doi.org/10.1007/BFb0055035

Skovsgaard, A., Sidlauskas, D. & Jensen, C. S. (2014). Scalable Top-k Spatio-Temporal Term Querying. ICDE, 148-159. https://doi.org/10.1109/ICDE.2014.6816647

Skovsgaard, A. & Jensen, C. S. (2015). Finding Top-k Relevant Groups of Spatial Web Objects. V L D B Journal, 24(4), 537-555. https://doi.org/10.1007/s00778-015-0388-z

Skovsgaard, A., Sidlauskas, D. & Jensen, C. S. (2014). A Clustering Approach to the Discovery of Points of Interest from Geo-Tagged Microblog Posts. In J. E. Guerrero (Ed.), 15th IEEE International Conference on Mobile Data Management (MDM), 2014 : Proceedings (pp. 178-189 (vol. 1)). IEEE Computer Society Press. https://doi.org/10.1109/MDM.2014.28

Skovsgaard, A. & Jensen, C. S. (2014). Top-k point of interest retrieval using standard indexes. In Y. Huang & M. Schneider (Eds.), Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL '14 (pp. 173-182 ). Association for Computing Machinery. https://doi.org/10.1145/2666310.2666399

Skovsgaard, A. & Jensen, C. S. (2015). Scalable Spatio-Textual Region Querying in Key-Value Stores. Paper presented at ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Dallas, United States. http://sigspatial2014.sigspatial.org/

Skovsgaard, A. (2014). Indexing, Query Processing, and Clustering of Spatio-Temporal Text Objects. Department of Computer Science, Aarhus University.

Skovgaard, C., Thomsen, J. R., Verdezoto, N. & Vestergaard, D. (2015). DogPulse: Augmenting the Coordination of Dog Walking through an Ambient Awareness System at Home. In S. Nanayakkara & E. Y.-L. Do (Eds.), AH '15, Proceedings of the 6th Augmented Human International Conference: SIGCHI ACM. (pp. 41-44). Association for Computing Machinery. https://doi.org/10.1145/2735711.2735825

Skovenborg, E. (2005). Perceptual Features of Music and Speech - Measured by Listening Experiments, and Computer Modelled from Signal Analysis.

Skov, L. (2017). Methods for analyzing genetic variation in modern and archaic humans.

Skoulakis, S., Feng, Y., Fujii, K., Cevher, V. & Wang, X. (2025). Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games. In Proceedings of the 42nd International Conference on Machine Learning (Vol. 267, pp. 16670-16710)

Skoulakis, S., Muller, A., Viano, L., Cevher, V. & Scheider, J. (2026). Best of Both Worlds: Regret Minimization versus Minimax Play. Advance online publication.

Skorstensgaard, L., Devriese, D. & Birkedal, L. (2021). StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities. Journal of Functional Programming, 31, Article e9. https://doi.org/10.1017/S095679682100006X

Skorstengaard, L., Devriese, D. & Birkedal, L. (2018). Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. In A. Ahmed (Ed.), Programming Languages and Systems - 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Proceedings (Vol. 10801, pp. 475-501). Springer VS. https://doi.org/10.1007/978-3-319-89884-1_17

Skorstengaard, L., Devriese, D. & Birkedal, L. (2019). Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. A C M Transactions on Programming Languages and Systems, 41(4), Article 5. https://doi.org/10.1145/3363519

Skorstengaard, L., Devriese, D. & Birkedal, L. (2019). StkTokens: Enforcing Well-Bracketed Control Flow and Stack Encapsulation Using Linear Capabilities. Proceedings of the ACM on Programming Languages , 3(POPL), Article 19. https://doi.org/10.1145/3290332

Skorstengaard, L., Devriese, D. & Birkedal, L. (2019). Reasoning about a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. ACM Transactions on Programming Languages and Systems, 42(1), Article 5. https://doi.org/10.1145/3363519

Skorstengaard, L. (2019). Formal Reasoning about Capability Machines. Aarhus Universitet.

Skitsas, K., Orłowski, K., Hermanns, J., Mottin, D. & Karras, P. (2023). Comprehensive Evaluation of Algorithms for Unrestricted Graph Alignment. In Proceedings 26th International Conference on Extending Database Technology (EDBT 2023) (pp. 260-272). openproceedings.org. https://doi.org/10.48786/edbt.2023.21

Skitsas, K., Papageorgiou, I. G., Talebi, M. S., Kantere, V., Katehakis, M. N. & Karras, P. (2022). SIFTER: Space-Efficient Value Iteration for Finite-Horizon MDPs. Proceedings of the VLDB Endowment, 16(1), 90-98. https://doi.org/10.14778/3561261.3561269

Skitsas, K., Mottin, D. & Karras, P. (2025). Pilos: Scalable Large-Subgraph Matching by Online Spectral Filtering. In Proceedings - 2025 IEEE 41st International Conference on Data Engineering, ICDE 2025 (pp. 1180-1193). IEEE. https://doi.org/10.1109/ICDE65448.2025.00093

Skitsas, K. (2026). Graph-based Reasoning: Effective Mapping and Planning on Graphs. [PhD dissertation, Aarhus University].

Sitchinava, N. & Zeh, N. (2012). A parallel buffer tree. In Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (pp. 214-223). Association for Computing Machinery. https://doi.org/10.1145/2312005.2312046

Sitchinava, N. & Svenning, R. (2024). The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory. In SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 259-268). Association for Computing Machinery. https://doi.org/10.1145/3626183.3659979

Simonsen, M., Mailund, T. & Pedersen, C. S. (2008). Rapid Neighbour-Joining. In Proceedings of the 8th International Workshop on Algorithms in Bioinformatics (WABI) (pp. 113-122)

Simonsen, M., Mailund, T. & Pedersen, C. S. (2009). Building very large neighbour-joining trees. Poster session presented at 17th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB) & 8th European Conference on Computational Biology (ECCB), Stockholm, Sweden.

Simonsen, M., Mailund, T. & Pedersen, C. N. S. (2010). Building Very Large Neighbour-Joining Trees. In A. Fred, J. Filipe & H. Gamboa (Eds.), BIOINFORMATICS 2010: Proceedings of the First International Conference on Bioinformatics (part of the 3rd International Joint Conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2010) (pp. 26). Institute for Systems and Technologies of Information, Control and Communication.

Simonsen, M., Sand, A., Mailund, T. & Pedersen, C. N. S. (2010). Using the Power of Modern Processors in Bioformatics. Poster session presented at Conference on IT research at AU, Århus, Denmark.

Simonsen, M., Mailund, T. & Pedersen, C. N. S. (2011). Inference of Large Phylogenies Using Neighbour-Joining. Biomedical Engineering Systems and Technologies, 127(5), 334-344. https://doi.org/10.1007/978-3-642-18472-7_26

Displaying results 601 to 650 out of 5997

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University