Aarhus Universitets segl

Publikationer

Søg publikationer fra Institut for Datalogi

Liste over publikationer af videnskabelige medarbejdere fra Institut for Datalogi, Aarhus Universitet.

Sortér efter: Dato | Forfatter | Titel

Hansen, T. R. (2006). Strings of experiments: looking at the design process as a set of socio-technical experiments. I Proceedings of the ninth conference on Participatory design: Expanding boundaries in design - Volume 1 (Bind 1, s. 1-10). Association for Computing Machinery. https://doi.org/10.1145/1147261.1147263
Madsen, M. & Andreasen, E. (2014). String Analysis for Dynamic Field Access. I A. Cohen (red.), Compiler Construction: 23rd International Conference, CC 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings (s. 197-217). Springer. https://doi.org/10.1007/978-3-642-54807-9_12
Gratzer, D., Shulman, M. & Sterling, J. (2026). STRICT UNIVERSES FOR GROTHENDIECK TOPOI. Theory and Applications of Categories, 45, 1227-1279.
Brodal, G. S., Nielsen, J. A. S. & Truelsen, J. (2015). Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. I F. Dehne, J.-R. Sack & U. Stege (red.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Proceedings (s. 91-102). Springer VS. https://doi.org/10.1007/978-3-319-21840-3_8
Brodal, G. S., Lagogiannis, G. & Tarjan, R. E. (2025). Strict Fibonacci Heaps. ACM Transactions on Algorithms, 21(2), Artikel 15. https://doi.org/10.1145/3707692
Brodal, G. S., Lagogiannis, G. & Tarjan, R. E. (2012). Strict fibonacci heaps. I STOC '12 Proceedings of the 44th symposium on Theory of Computing (s. 1177-1184 ). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214082
Son, W. & Afshani, P. (2015). Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. I R. Jain, S. Jain & F. Stephan (red.), Theory and Applications of Models of Computation: 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (s. 189-199 ). Springer VS. https://doi.org/10.1007/978-3-319-17142-5
Abam, M., de Berg, M., Hachenberger, P. & Zarei, A. (2010). Streaming Algorithms for Line Simplification. Discrete & Computational Geometry, 43(3), 497-515. https://doi.org/10.1007/s00454-008-9132-4
Lex, A., Streit, M., Schulz, H.-J., Partl, C., Schmalstieg, D., Park, P. J. & Gehlenborg, N. (2012). StratomeX: Visual Analysis of Large-Scale Heterogeneous Genomics Data for Cancer Subtype Characterization. Computer Graphics Forum, 31(3), 1175-1184. https://doi.org/10.1111/j.1467-8659.2012.03110.x
Hansen, T. D., Miltersen, P. B. & Zwick, U. (2011). Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. I Proceedings of the Second Symposium on Innovations in Computer Science (s. 253-263). Tsinghua University Press, Beijing. http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/7.html
Cermak, J., Bosansky, B. & Gatti, N. (2015). Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games. Abstract fra International Conference on Autonomous Agents and Multiagent Systems, Istanbul, Tyrkiet. http://dl.acm.org/citation.cfm?id=2773450&CFID=719158965&CFTOKEN=25615646
Ibsen-Jensen, R. (2013). Strategy complexity of two-player, zero-sum games. Department of Computer Science, University of Aarhus.
Ibsen-Jensen, R. & Chatterjee , K. (2013). Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games. I A. Kučera , T. A. Henzinger, J. Nešetřil, T. Vojnar & D. Antoš (red.), Mathematical and Engineering Methods in Computer Science: 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers (s. 106-117). Springer VS. https://doi.org/10.1007/978-3-642-36046-6_11
Chatterjee, K., Hansen, K. A. & Ibsen-Jensen, R. (2017). Strategy Complexity of Concurrent Safety Games. I K. G. Larsen, H. L. Bodlaender & J.-F. Raskin (red.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) (Bind 83, s. 55:1-55:13). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2017.55
Rossitto, C., Berns, K. & Larsen-Ledet, I. (2020). Strategies of Visibility: Growth, Media and Social Movements. Afhandling præsenteret på The 23rd ACM Conference on Computer-Supported Cooperative Work and Social Computing.
Rohde, J., Wolff, S. & Toftegaard, T. S. (2009). Strategies For Releasing The Green Potential In Home Automation. Proceedings of the Wireless Personal Multimedia Communications Symposia.
Guerraoui, R., Aksit, M., Black, A., Cardelli, L., Cointe, P., Coplien, J., Kiczales, G., Lea, D., Madsen, O., Magnusson, B., Meseguer, J., Moessenboeck, H., Palsberg, J. & Schmidt, D. (1996). Strategic directions in object-oriented programming. ACM Computing Surveys, 28(4), 691-700. https://doi.org/10.1145/242223.242275
Yang, B., Guo, C., Jensen, C. S., Kaul, M. & Shang, S. (2014). Stochastic skyline route planning under time-varying uncertainty. I 2014 IEEE 30th International Conference on Data Engineering (ICDE), (s. 136-147). IEEE. https://doi.org/10.1109/ICDE.2014.6816646
Baumann, P., Nyman, J., Høyer, M., Gagliardi, G., Lax, I., Wennberg, B., Drugge, N., Ekberg, L., Friesland, S., Johansson, K.-A., Lund, J.-S., Morhed, E., Nilsson, K. K., Levin, N., Paludan, M., Sederholm, C., Hansen, A. T., Wittgren, L. & Lewensohn, R. (2008). Stereotactic body radiotherapy for medically inoperable patients with stage I non-small cell lung cancer - a first report of toxicity related to COPD/CVD in a non-randomized prospective phase II study. Radiotherapy & Oncology, 88(3), 359-367. https://doi.org/10.1016/j.radonc.2008.07.019
Da Rocha Pinto, P., Dinsdale-Young, T. & Gardner, P. (2015). Steps in Modular Specifications for Concurrent Modules: (Invited Tutorial Paper). Electronic Notes in Theoretical Computer Science, 319, 3-18. https://doi.org/10.1016/j.entcs.2015.12.002
Birkedal, L., Bizjak, A. & Schwinghamme, J. (2013). Step-Indexed Relational Reasoning for Countable Nondeterminism. Logical Methods in Computer Science, 9(4), Artikel 4. https://doi.org/10.2168/LMCS-9(4:4)2013
Bizjak, A. & Birkedal, L. (2015). Step-indexed logical relations for probability. I A. Pitts (red.), Foundations of Software Science and Computation Structures: 18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings (s. 279-294 ). Springer VS. https://doi.org/10.1007/978-3-662-46678-0_18
Østerby, O. (1985). Step Change Strategies for Multistep Methods. Department of Computer Science, Aarhus University. Daimi Report Series (DAIMI PB) Nr. 196
Hogräfer, M., Angelini, M., Santucci, G. & Schulz, H.-J. (2022). Steering-by-Example for Progressive Visual Analytics. ACM Transactions on Intelligent Systems and Technology, 13(6), 1–26. Artikel 96. https://doi.org/10.1145/3531229
Bhatacharya, H., Nielsen, M. B. & Bridson, R. (2012). Steady State Stokes Flow Interpolation for Fluid Control. Annual Conference of the European Association for Computer Graphics , 33, 57-60. https://doi.org/10.2312/conf/EG2012/short/057-060
Damgård, I. B., Pedersen, T. P. & Pfitzmann, B. (1998). Statistical secrecy and multibit commitments. I E E E Transactions on Information Theory, 44(3), 1143-1151. https://doi.org/10.1109/18.669255
Orlandi, C., Ostrovsky, R., Rao, V., Sahai, A. & Visconti, I. (2014). Statistical Concurrent Non-malleable Zero Knowledge. I Y. Lindell (red.), Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, 2014. Proceedings (s. 167-191). Springer Publishing Company. https://doi.org/10.1007/978-3-642-54242-8_8
Møller, A., Olesen, M. Ø. & Schwartzbach, M. I. (2007). Static Validation of XSL Transformations. A C M Transactions on Programming Languages and Systems, 29(4), Article 21. https://doi.org/10.1145/1255450.1255454
Brabrand, C., Møller, A. & Schwartzbach, M. I. (2001). Static Validation of Dynamically Generated HTML. I Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (s. 38-45). Association for Computing Machinery. https://doi.org/10.1145/379605.379657
Schwartzbach, M. I. & Palsberg, J. (1994). Static Typing for Object-Oriented Programming. Science of Computer Programming, 23(1), 19-53. https://doi.org/10.1016/0167-6423(94)00014-X
Danvy, O., Damian, D. & Taha, W. (red.) (2001). Static Transition Compression. I Semantics, Applications, and Implementation of Program Generation (Bind 2196 of Lecture Notes in Computer Science, s. 92-107). Springer.
Damian, D. & Danvy, O. (2001). Static Transition Compression. I W. Taha (red.), Semantics, Applications, and Implementation of Program Generation: Second International Workshop, SAIG 2001 Florence, Italy, September 6, 2001 Proceedings (s. 92-107). Springer. https://doi.org/10.1007/3-540-44806-3_6
Vorreiter Pedersen, M. & Askarov, A. (2019). Static Enforcement of Security in Runtime Systems. I Proceedings - 2019 IEEE 32nd Computer Security Foundations Symposium, CSF 2019 (s. 335-350). Artikel 8823712 IEEE. https://doi.org/10.1109/CSF.2019.00030
Vorreiter Pedersen, M. & Askarov, A. (2019). Static enforcement of security in runtime systems. I Proceedings - 2019 IEEE 32nd Computer Security Foundations Symposium, CSF 2019 (s. 335-350). Artikel 8823712 IEEE Computer Society Press. https://doi.org/10.1109/CSF.2019.00030
Andersson, A., Miltersen, P. B., Riis, S. & Thorup, M. (1996). Static dictionaries on AC0 RAMs: query time (√log n/log log n) is necessary and sufficient. I 37th Annual Symposium on Foundations of Computer Science, 1996. Proceedings. (s. 441-450). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1996.548503
Schwartzbach, M. I. (1990). Static Correctness of Hierarchical Procedures. I M. S. Paterson (red.), Automata, Languages and Programming: 17th International Colloquium Warwick University, England, July 16-20, 1990 Proceedings (s. 32-45). Springer. https://doi.org/10.1007/BFb0032020
Stein, B., Nielsen, B. B., Chang, B.-Y. E. & Møller, A. (2019). Static Analysis with Demand-driven Value Refinement. Proceedings of the ACM on Programming Languages , 3(OOPSLA), Artikel 140. https://doi.org/10.1145/3360566