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

Pagter, J. I. & Rauhe, T. (1998). Optimal Time-Space Trade-Offs for Sorting. In Proc. of 39th Annual Symposium on Foundations of Computer Science (FOCS '98) IEEE. https://doi.org/10.1109/SFCS.1998.743455

Pagter, J. I., Toft, T., Damgård, I. B., Bogetoft, P., Nielsen, K. & Jakobsen, T. (2005). Secure Computing, Economy, and Trust - A Generic Solution for Secure Auctions with Real-World Applications. B R I C S Report Series, (RS-05-18), 1-35.

Pagnin, E., Gunnarsson, G., Talebi, P., Orlandi, C. & Sabelfeld, A. (2019). TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing. Proceedings on Privacy Enhancing Technologies, 2019(4), 93-111. https://doi.org/10.2478/popets-2019-0060

Pagh, R. & Pagter, J. (2001). Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. B R I C S Report Series, (RS-01-2), 20-20.

Pagh, R., Pagter, J. I. & Eppstein, D. (Ed.) (2002). Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. In Symposium on Discrete Algorithm: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (pp. 9-18). Association for Computing Machinery.

Pagh, R., Wei, Z., Yi, K. & Zhang , Q. (2014). Cache-Oblivious Hashing. Algorithmica, 69(4), 864-883. https://doi.org/10.1007/s00453-013-9763-6

Pablos-Sarabia, R., Griol, D. & Callejas, Z. (2023). A Proposal for Data Collection and Process Automatization for Ubiquitous Engagement with Mental Health Organizations. In J. Bravo, S. Ochoa & J. Favela (Eds.), Proceedings of the International Conference on Ubiquitous Computing and Ambient Intelligence, UCAmI 2022 (pp. 336-341). Springer. https://doi.org/10.1007/978-3-031-21333-5_34

Ozbek, D., Alalawi, M., Eckroth, T. M. & Wessely, M. (2024). Demonstration of AcceloPrint: Fabricating Accelerometers with Multi-Material 3D Printing. In M. Wessely, V. Savage, P. Didyk & J. Martinez (Eds.), SCF Adjunct '24: Adjunct Proceedings of the 9th ACM Symposium on Computational Fabrication Article 8 Association for Computing Machinery, Inc.. https://doi.org/10.1145/3665662.3673256

Ostermann, K. (2008). Aspects and modular reasoning in nonmonotonic logic. In W. Harrison & S. Katz (Eds.), ACM International Conference Proceeding Series: Proceedings of the 6th workshop on Foundations of aspect-oriented languages (Vol. 268, pp. 59-64). Association for Computing Machinery.

Ostermann, K. (2008). Reasoning about Aspects With Common Sense. In Proceedings of the 7th international conference on Aspect-oriented software development (pp. 48-59). Association for Computing Machinery.

Ostermann, K. (2007). Nominal and Structural Subtyping in Component-Based Programming. Journal of Object Technology, 7(1), 121 - 145.

Østergaard Laursen, C., Pedersen, S., Merritt, T. R. & Caprani, O. (2016). Robot-Supported Food Experiences: Exploring Aesthetic Plating with Design Prototypes. In J. T.K.V.Koh, B. J. Dunstan, D. Silvera-Tawil & M. Velonaki (Eds.), Cultural Robotics - 1st International Workshop, CR 2015 and Held as Part of IEEE RO-MAN 2015, Revised Selected Papers: First International Workshop, CR 2015, Held as Part of IEEE RO-MAN 2015, Kobe, Japan, August 31, 2015. Revised Selected Papers (Vol. 9549, pp. 107-130). Springer. https://doi.org/10.1007/978-3-319-42945-8_10

Østerby, O. (2007). Numerical Solution of Parabolic Equations. Datalogisk Institut.

Østerby, O. & Sørensen, H. H. B. (2009). On One-Point Iterations and DIIS. A I P Conference Proceedings Series, 468-472. https://doi.org/10.1063/1.3241499

Østerby, O. (1973). Analysis of Numerical Solution of the Stefan Problem. Department of Mathematics, University of California, Berkeley. DAIMI PB Vol. 24

Østerby, O., Møller-Pedersen, K. & North, J. (1975). Summa Ratione Confectum. Archives Internationales d'Histoire des Sciences, 25(96), 73-81.

Østerby, O. (1976). SOR with Non-property a Matrices. In J. Albrecht & L. Collatz (Eds.), Numerische Behandlung von Differentialgleichungen, ISNM 31 (pp. 181-190). Birkhäuser Verlag.

Østerby, O. (1976). Prime Decompositions with Minimum Sum. BIT Numerical Mathematics, 16, 451-458.

Østerby, O. (1979). Efficient Solution of Tridiagonal Linear Systems. The Computer Journal, 22(3), 283-285.

Østerby, O. (1985). Step Change Strategies for Multistep Methods. Department of Computer Science, Aarhus University. DAIMI PB No. 196

Østerby, O. (1987). Estimation of Reaction Parameters in Gas Chromatograhy. In Proceedings of the Symposium on Applied Statistics. UNI-C (pp. 369-378)

Østerby, O. (1993). Stability of finite difference formulas for linear parabolic equations. In D. D. Bainov & V. Covachev (Eds.), Proceedings of the Second International Colloquium on Numerical Analysis (pp. 165-176)

Østerby, O. (1998). The Error of the Crank-Nicolson Method for Linear Parabolic Equations with a Derivative Boundary Condition. Department of Computer Science, Aarhus University. DAIMI PB No. 534

Østerby, O. (2003). Five ways of reducing the Crank-Nicolson oscillations. BIT Numerical Mathematics, 43(4), 811-822. https://doi.org/10.1023/B:BITN.0000009942.00540.94

Østerby, O. & Zlatev, Z. (1983). Direct Methods for Sparces Matrices. Springer. Lecture Notes in Computer Science No. 157

Østerby, O. (2015). Numerical Solution of Parabolic Equations. Department of Computer Science, Aarhus University. https://doi.org/10.7146/aul.5.5

Østerby, O. (2016). On the Stability of ADI Methods. DAIMI PB, 598, 1-7. https://doi.org/10.7146/dpb.v42i598.25146

Østerby, O. (2017). On Saulyev's Methods. In DAIMI Report Series (Vol. 599, pp. 1-11). Århus Universitet. https://doi.org/10.7146/dpb.v43i599.26410

Orlandi, C. (2011). Is Multiparty Computation Any Good In Practice? I E E E International Conference on Acoustics, Speech and Signal Processing. Proceedings, 5848-5851. https://doi.org/10.1109/ICASSP.2011.5947691

Orlandi, C. (2011). Secure Computation in Untrusted Environments. Department of Computer Science, Aarhus University.

Orlandi, C., Ostrovsky, R., Rao, V., Sahai, A. & Visconti, I. (2014). Statistical Concurrent Non-malleable Zero Knowledge. In Y. Lindell (Ed.), Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, 2014. Proceedings (pp. 167-191). Springer Publishing Company. https://doi.org/10.1007/978-3-642-54242-8_8

Orlandi, C. (2017). Faster Zero-Knowledge Protocols and Applications: Invited Talk Abstract. In P. Farshim & E. Simion (Eds.), Innovative Security Solutions for Information Technology and Communications - 10th International Conference,SecITC 2017, Revised Selected Papers: Innovative Security Solutions for Information Technology and Communications (Vol. 10543, pp. 1-11). Springer VS. https://doi.org/10.1007/978-3-319-69284-5_1

Orlandi, C., Scholl, P. & Yakoubov, S. (2021). The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. In A. Canteaut & F.-X. Standaert (Eds.), Advances in Cryptology – EUROCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 678-708). Springer. https://doi.org/10.1007/978-3-030-77870-5_24

Orlandi, C., Ravi, D. & Scholl, P. (2022). On the Bottleneck Complexity of MPC with Correlated Randomness. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 194-220). Springer. https://doi.org/10.1007/978-3-030-97121-2_8

Ørbæk, P. (2005). Programming with Hierarchical Maps. Datalogisk Institut.

Ørbæk, P., Mogensen, P. H. & Grønbæk, K. (2001). Interaction Techniques for Spatial Organization of Digital and Physical materials - the Topos Approach. In O. W. Bertelsen (Ed.), Proceedings of the First Dansih Human-Computer Interaction Research Symposium (pp. 51-53). Department of Computer Science, Aarhus University.

Oortwijn, W., Huisman, M., Joosten, S. J. C. & van de Pol, J. (2020). Automated verification of parallel nested DFS. In A. Biere & D. Parker (Eds.), Tools and Algorithms for the Construction and Analysis of Systems- 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings, Part I (pp. 247-265). Springer. https://doi.org/10.1007/978-3-030-45190-5_14

Olsen, M. (2007). Nash Stability in Additively Separable Hedonic Games is NP-hard. In Computation and Logic in the Real World (4497 of Lecture Notes in Computer Science ed., Vol. 4497/2007, pp. 598 - 605). Springer.

Olsen, M. (2008). Communities in Large Networks: Identification and Ranking. Lecture Notes in Computer Science, 4936, 84-96.

Olsen, M. (2008). The Computational Complexity of Link Building. Lecture Notes in Computer Science, 5092, 119-129.

Olsen, M. (2009). Nash Stability in Additively Separable Hedonic Games and Community Structures. Theory of Computing Systems, 45(4), 917-925. https://doi.org/10.1007/s00224-009-9176-8

Olsen, M. (2009). Link Building. Aarhus Universitetsforlag.

Olsen, J. W. (2010). Material Dispositions - a hybrid and interwoven design perspective on maiking computing palpable. Department of Computer Science, Aarhus University.

Olsen, M. & Revsbæk, M. (2013). On Alliance Partitions and Bisection Width for Planar Graphs. Journal of Graph Algorithms and Applications, 17(6), 599-614. https://doi.org/10.7155/jgaa.00307

Olsen, M. & Revsbæk, M. (2013). Alliances and Bisection Width for Planar Graphs. In S. K. Ghosh & T. Tokuyama (Eds.), WALCOM: Algorithms and Computation: 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings (pp. 206-216). Springer VS. https://doi.org/10.1007/978-3-642-36065-7_20

Olin, P. A., Issa, A. M., Feuchtner, T. & Grønbæk, K. (2020). Designing for Heterogeneous Cross-Device Collaboration and Social Interaction in Virtual Reality. In N. Ahmadpour, T. Leong, B. Ploderer, C. Parker, S. Webber, D. Munoz, L. Loke & M. Tomitsch (Eds.), Proceedings of the 32nd Australian Computer-Human Interaction Conference, OzCHI 2020 (pp. 112-127). Association for Computing Machinery. https://doi.org/10.1145/3441000.3441070

Oechsner, S. (2019). Constructions and Proof Techniques for Secure Computation. Århus Universitet.

Obremski, M. & Skorski, M. (2017). Renyi Entropy Estimation Revisited. In J. D. P. Rolim, K. Jansen, D. P. Williamson & S. S. Vempala (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017 (Vol. 81, pp. 20:1-20:15). Article 20 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20

Obremski, M. & Skorski, M. (2018). Inverted Leftover Hash Lemma. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (Vol. 2018-June, pp. 1834-1838). Article 8437654 IEEE. https://doi.org/10.1109/ISIT.2018.8437654

Nygaard, M. & Winskel, G. (2003). Domain Theory for Concurrency. B R I C S Report Series, (RS-03-43).

Displaying results 951 to 1000 out of 5426

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University