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

Haselwarter, P. G. & Bauer, A. (2023). Finitary Type Theories With and Without Contexts. Journal of Automated Reasoning, 67(4), Artikel 36. https://doi.org/10.1007/s10817-023-09678-y

Haselwarter, P. G., Hvass, B. S., Hansen, L. L., Winterhalter, T., Hriţcu, C. & Spitters, B. (2024). The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography. I A. Timany, D. Traytel, B. Pientka & S. Blazy (red.), CPP 2024: Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs (s. 30-44). Association for Computing Machinery. https://doi.org/10.1145/3636501.3636961

Haselwarter, P. G., Li, K. H. E. I., Medeiros, M. D. E., Gregersen, S. O., Aguirre, A., Tassarotti, J. & Birkedal, L. (2024). Tachis: Higher-Order Separation Logic with Credits for Expected Costs. Proceedings of the ACM on Programming Languages , 8(OOPSLA2), 1189 - 1218. Artikel 313. https://doi.org/10.1145/3689753

Haselwarter, P. G., Li, K. H., Aguirre, A., Gregersen, S. O., Tassarotti, J. & Birkedal, L. (2025). Approximate Relational Reasoning for Higher-Order Probabilistic Programs. Proceedings of the ACM on Programming Languages , 9(POPL), 1196-1226. Artikel 41. https://doi.org/10.1145/3704877

Hansen, K. M. & Zhang, W. (2008). Limbo: an Ontology based Web Service Compiler for Networked Embedded Devices: Tool demostration. Afhandling præsenteret på International Conference on Software Reuse (ICSR 2008), Beijing, Kina. https://doi.org/10.1007/978-3-540-68073-4

Hansen, F. A., Kortbek, K. J. & Grønbæk, K. (2012). Mobile Urban Drama - Interactive Storytelling in Real World Environments. New Review of Hypermedia and Multimedia, 18(1-2), 63-89. https://doi.org/10.1080/13614568.2012.617842

Hansen, K. A., Koucký, M., Lauritzen, N., Miltersen, P. B. & Tsigaridas, E. (2011). Exact algorithms for solving stochastic games. I STOC'11: proceedings of the 43rd annual ACM symposium on Theory of computing (s. 205-214). Association for Computing Machinery. https://doi.org/10.1145/1993636.1993665

Hansen, M. T., Jurdak, R. & Kusy, B. (2011). Unified broadcast in sensor networks. I 10th International Conference on Information Processing in Sensor Networks (IPSN), 2011 (s. 306-317). IEEE Computer Society Press. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5779047

Hansen, M. T. & Kusy, B. (2011). TinyInventor: A Holistic Approach to Sensor Network Application Development. Afhandling præsenteret på Extending the Internet to Low power and Lossy Networks. IP+SN 2011 , Chicago, IL, USA.

Hansen, M. T. (2011). Multi-purpose passive debugging for embedded wireless. Poster-session præsenteret på 10th ACM/IEEE International Conference on Information Processing in Sensor Networks. IPSN 2011, Chicago, IL, USA. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5779092

Hansen, M. T. & Kusy, B. (2011). Cross-platform wireless sensor network development. Poster-session præsenteret på 10th ACM/IEEE International Conference on Information Processing in Sensor Networks. IPSN 2011, Chicago, IL, USA. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5779091

Hansen, M. S., Sørensen, T. S., Arai, A. & Kellman, P. (2012). Retrospective Reconstruction of High Temporal Resolution Cine Images from Real-Time MRI using Iterative Motion Correction. Magnetic Resonance in Medicine, 68(3), 741-750. https://doi.org/10.1002/mrm.23284

Hansen, K. A., Miltersen, P. B. & Ibsen-Jensen, R. (2011). The complexity of solving reachability games using value and strategy iteration. Lecture Notes in Computer Science, 6651, 77-90. https://doi.org/10.1007/978-3-642-20712-9_7

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

Hansen, K. M., Ingstrup, M., Kyng, M. & Olsen, J. W. (2011). Towards a Software Ecosystem of Healthcare Services. I Proceedings of the 3rd International Workshop on Infrastructures for Healthcare: Global Healthcare (s. 27-30) http://www.itu.dk/people/lrc/ProcInfraHealth2011.PDF

Hansen, M. T. (2011). TinyDebug: Multi-Purpose Passive Debugging Framework for Embedded Wireless Systems. D A I M I P B, (595).

Hansen, K. A., Koucky, M., Lauritzen, N. & Tsigaridas, E. (2011). Separation bounds for real roots of polynomial systems. Afhandling præsenteret på MEGA 2011: Effective Methods in Algebraic Geometry, Stockholm, Sverige.

Hansen, M. S. & Sørensen, T. S. (2013). Gadgetron: An Open Source Framework for Medical Image Reconstruction. Magnetic Resonance in Medicine, 69(6), 1768-1776. https://doi.org/10.1002/mrm.24389

Hansen, M. S. & Sørensen, T. S. (2012). Gadgetron Users Guide : A Medical Image Reconstruction Framework. (Revision 1.0 udg.) SourceForge. http://sourceforge.net/projects/gadgetron/files/manual/gadgetron_manual_1.0.pdf/download

Hansen, D. C., Lühr, A., Bassler, N. & Sørensen, T. S. (2012). Robust Combined Proton & Cone Beam X-ray Tomography. Poster-session præsenteret på PTCOG 51, Seoul, Sydkorea.

Hansen, A. B. & Midtgaard, J. (2012). Handling Overflow in MLton. Abstract fra ACM SIGPLAN Workshop on ML, Copenhagen, Danmark. http://www.lexifi.com/ml2012/full8.pdf

Hansen, T. D., Ibsen-Jensen, R. & Miltersen, P. B. (2012). A Faster Algorithm for Solving One-Clock Priced Timed Games. http://arxiv.org/abs/1201.3498

Hansen, M. T., Kusy, B., Jurdak, R. & Langendoen, K. (2012). AutoSync : Automatic duty-cycle control for synchronous low-power listening. I 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON) (s. 139 - 147 ). IEEE Signal Processing Society. https://doi.org/10.1109/SECON.2012.6275770

Hansen, K. A., Koucky, M., Lauritzen, N., Miltersen, P. B. & Tsigaridas, E. (2012). Exact Algorithms for Solving Stochastic Games. http://arxiv.org/abs/1202.3898

Hansen, K. A. & Podolskii, V. V. (2013). Polynomial threshold functions and Boolean threshold circuits. Electronic Colloquium on Computational Complexity, (TR13-021). http://eccc.hpi-web.de/report/2013/021/

Hansen, T. D., Miltersen, P. B. & Zwick, U. (2013). Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. Journal of the ACM, 60(1), Article No. 1 . https://doi.org/10.1145/2432622.2432623

Hansen, K. A., Ibsen-Jensen, R., Podolskii, V. V. & Tsigaridas, E. (2013). Patience of matrix games. Discrete Applied Mathematics, 161(16-17), 2440–2459. http://www.sciencedirect.com.ez.statsbiblioteket.dk:2048/science/article/pii/S0166218X13002357

Hansen, T. D., Ibsen-Jensen, R. & Miltersen, P. B. (2013). A Faster Algorithm for Solving One-Clock Priced Timed Games. I P. R. D*Argenio & H. Melgratti (red.), CONCUR 2013 – Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings (s. 531-545). Springer VS. https://doi.org/10.1007/978-3-642-40184-8_37

Hansen, T. D. & Ibsen-Jensen, R. (2013). The complexity of interior point methods for solving discounted turn-based stochastic games. I The Nature of Computation, Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings (s. 252-262). Springer VS. https://doi.org/10.1007/978-3-642-39053-1_29

Hansen, D. C., Bassler, N., Petersen, J. B. B. & Sørensen, T. S. (2014). Improved proton computed tomography by dual modality image reconstruction. Medical Physics, 41(3), Artikel 031904 . https://doi.org/10.1118/1.4864239

Hansen, K. A. & Podolskii, V. V. (2013). Polynomial threshold functions and Boolean threshold circuits. I K. Chatterjee & J. Sgall (red.), Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (s. 516-527 ). Springer VS. https://doi.org/10.1007/978-3-642-40313-2_46

Hansen, D. C., Bassler, N., Sørensen, T. S. & Seco, J. (2014). The image quality of ion computed tomography at clinical imaging dose levels. Medical Physics, 41(11), Artikel 111908. https://doi.org/10.1118/1.4897614

Hansen, K. A., Ibsen-Jensen, R. & Miltersen, P. B. (2014). The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory of Computing Systems, 55(2), 380-403. https://doi.org/10.1007/s00224-013-9524-6

Hansen, T. D., Paterson, M. & Zwick, U. (2014). Improved upper bounds for random-edge and random-jump on abstract cubes. I C. Chekuri (red.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (s. 874-881). Association for Computing Machinery. http://delivery.acm.org/10.1145/2640000/2634137/p847-hansen.pdf?ip=130.225.0.251&id=2634137&acc=ACTIVE%20SERVICE&key=36332CD97FA87885.318148A04E30A4A4.4D4702B0C3E38B35.4D4702B0C3E38B35&CFID=595831098&CFTOKEN=20714772&__acm__=1415354926_7fe907c24139277eb45011338d13404e

Hansen, T. D., Kaplan, H. & Zwick, U. (2014). Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. I C. Chekuri (red.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (s. 847-860). Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2634074.2634137&coll=DL&dl=ACM&CFID=595831098&CFTOKEN=20714772

Hansen, K. A., Komarath, B., Sarma M. N., J., Talebanfard, N. & Skyum, S. (2014). Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. I E. Csuhaj-Varjú, M. Dietzfelbinger & Z. Ésik (red.), Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (s. 336-347 ). Springer VS. https://doi.org/10.1007/978-3-662-44465-8_29

Hansen, K. A. & Podolskii, V. V. (2015). Polynomial threshold functions and Boolean threshold circuits. Information and Computation, 240, 56-73. https://doi.org/10.1016/j.ic.2014.09.008

Hansen, T. D. & Zwick, U. (2015). Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. I Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15 (s. 209-218 ). Association for Computing Machinery. https://doi.org/10.1145/2746539.2746557

Hansen, T. D., Kaplan, H., Tarjan, R. E. & Zwick, U. (2015). Hollow Heaps. I M. M. Halldórsson, K. Iwama, N. Kobayashi & B. Speckmann (red.), Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (Bind Part 1, s. 689-700). Springer VS. https://doi.org/10.1007/978-3-662-47672-7_56

Hansen, T. D. & Zwick, U. (2016). Random-Edge Is Slower Than Random-Facet on Abstract Cubes. Leibniz International Proceedings in Informatics, 55, 51:1-51:14. https://doi.org/10.4230/LIPIcs.ICALP.2016.51

Hansen, K. A., Ibsen-Jensen, R. & Koucký, M. (2016). The big match in small space. I M. Gairing & R. Savani (red.), Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings (Bind 9928, s. 64-76). Springer VS. https://doi.org/10.1007/978-3-662-53354-3_6

Hansen, T. D., Kaplan, H., Tarjan, R. E. & Zwick, U. (2017). Hollow heaps. ACM Transactions on Algorithms, 13(3), 42:0-42:27. Artikel 42. https://doi.org/10.1145/3093240

Hansen, K. A. (2017). The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. I V. Bilò & M. Flammini (red.), Algorithmic Game Theory - 10th International Symposium, SAGT 2017, Proceedings: 10th International Symposium, SAGT 2017 (s. 119-130). Springer VS. https://doi.org/10.1007/978-3-319-66700-3_10

Hansen, K. A. & Lund, T. B. (2018). Computational Complexity of Proper Equilibrium. I É. Tardos, E. Elkind & R. Vohra (red.), ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation (s. 113-130). Association for Computing Machinery. https://doi.org/10.1145/3219166.3219199

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2018). The Big Match with a Clock and a Bit of Memory. I É. Tardos, E. Elkind & R. Vohra (red.), ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation (s. 149-150). Association for Computing Machinery. https://doi.org/10.1145/3219166.3219198

Hansen, K. A. (2019). The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. Theory of Computing Systems, 63(7), 1554-1571. https://doi.org/10.1007/s00224-018-9887-9

Hansen, K. A. & Raskin, M. (2019). A Stay-in-a-Set Game without a Stationary Equilibrium. I J. Leroux & J.-F. Raskin (red.), Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification (Bind 305, s. 83-90). Electronic Proceedings in Theoretical Computer Science. https://doi.org/10.4204/EPTCS.305.6

Hansen, K. A. & Sølvsten, S. C. (2020). ∃R-completeness of stationary nash equilibria in perfect information stochastic games. I J. Esparza & D. Král (red.), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 (s. 45:1-45:15). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2020.45

Hansen, J. C., Kjelstrøm, A. H. & Pavlogiannis, A. (2021). Tight bounds for reachability problems on one-counter and pushdown systems. Information Processing Letters, 171, Artikel 106135. https://doi.org/10.1016/j.ipl.2021.106135

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2021). Absorbing games with a clock and two bits of memory. Games and Economic Behavior, 128, 213-230. https://doi.org/10.1016/j.geb.2021.04.008

Viser resultater 1551 til 1600 ud af 3070

Forrige

Næste

Revideret 10.10.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series