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, 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

Hansen, K. A. & Lund, T. B. (2021). Computational Complexity of Computing a Quasi-Proper Equilibrium. I E. Bampis & A. Pagourtzis (red.), Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Proceedings: 23rd International Symposium, FCT 2021 Athens, Greece, September 12–15, 2021 Proceedings (s. 259-271). Springer. https://doi.org/10.1007/978-3-030-86593-1_18

Hansen, S. T., Gomes, C., Larsen, P. G. & Van De Pol, J. (2021). Synthesizing Co-Simulation Algorithms with Step Negotiation and Algebraic Loop Handling. I C. R. Martin, M. J. Blas & A. I. Psijas (red.), 2021 Annual Modeling and Simulation Conference (ANNSIM) (s. 62-73). IEEE. https://doi.org/10.23919/ANNSIM52504.2021.9552073

Hansen, S. T., Gomes, C., Palmieri, M., Thule, C., van de Pol, J. & Woodcock, J. (2021). Verification of Co-simulation Algorithms Subject to Algebraic Loops and Adaptive Steps. I A. L. Lafuente & A. Mavridou (red.), Formal Methods for Industrial Critical Systems (s. 3-20). Springer. https://doi.org/10.1007/978-3-030-85248-1_1

Hansen, F. A. & Grønbæk, K. (2010). Urbanweb: A platform for mobile, context-aware web services. I Mobile Web 2.0: Developing and Delivering Services to Mobile Devices (s. 137-162). CRC Press. https://doi.org/10.1201/b10445

Hansen, J. Ø., Musaeus, L. H. & Nielsen, K. (2021). Computational Thinking i Matematik og Naturvidenskab (CTiMNAT): Evaluering af projektets andet kursusforløb 2019-2021. Rapport udarbejdet for Danske Science Gymnasier (DASG) af Center for Computational Thinking & Design, Aarhus Universitet.

Hansen, S. T., Thule, C., Gomes, C., van de Pol, J., Palmieri, M., Inci, E. O., Madsen, F., Alfonso, J., Castellanos, J. Á. & Rodriguez, J. M. (2022). Verification and synthesis of co-simulation algorithms subject to algebraic loops and adaptive steps. International Journal on Software Tools for Technology Transfer, 24(6), 999-1024. https://doi.org/10.1007/s10009-022-00686-8

Hansen, K. A., Liu, T. X. & Malekian, A. (red.) (2022). Web and Internet Economics: 18th International Conference, WINE 2022, Troy, NY, USA, December 12-15, 2022, Proceedings. Springer. Lecture Notes in Computer Science Bind 13778 https://doi.org/10.1007/978-3-031-22832-2

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2023). The Big Match with a Clock and a Bit of Memory. Mathematics of Operations Research, 48(1), 419-432. https://doi.org/10.1287/moor.2022.1267

Hansen, R. T., Borghegn, N. W., Gundtoft, P. H., Nielsen, K. A., Balslev-Clausen, A. & Viberg, B. (2023). Change in treatment preferences in pediatric diaphyseal forearm fractures: a Danish nationwide register study of 36,244 fractures between 1997 and 2016. Acta Orthopaedica. Supplementum (Print Edition), 94, 32-37. https://doi.org/10.2340/17453674.2023.7132

Hansen, S. M., Assent, I. & Schulz, H.-J. (2024). A Web Framework for Explainable and Malleable Visualisation. I K. Kucher, A. Diehl & C. Gillmann (red.), EuroVisPosters2024: Poster Proceedings of the 26th Eurographics Conference on Visualization The Eurographics Association. https://doi.org/10.2312/evp.20241080

Hansen, T. D. (2012). Worst-case Analysis of Strategy Iteration and the Simplex Method. Aarhus Universitet, Datalogisk Institut.

Hansen, M. T. (2012). Low-Power Wireless Sensor Network Infrastructures. Department of Computer Science, Aarhus University.

Hansen, A. B., Nielsen, J. B. & Simkin, M. (2025). OCash: Fully Anonymous Payments Between Blockchain Light Clients. I T. Jager & J. Pan (red.), Public-Key Cryptography – PKC 2025 - 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (s. 169-202). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-91832-2_6

Hanneke, S., Larsen, K. G. & Zhivotovskiy, N. (2024). Revisiting Agnostic PAC Learning. I Proceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024 (s. 1968-1982). IEEE. https://doi.org/10.1109/FOCS61266.2024.00118

Han, W. & Schulz, H.-J. (2020). Exploring Vibrotactile Cues for Interactive Guidance in Data Visualization. I Proceedings of the 13th International Symposium on Visual Information Communication and Interaction, VINCI 2020 Artikel 3430042 Association for Computing Machinery. https://doi.org/10.1145/3430036.3430042

Han, W. & Schulz, H.-J. (2020). Beyond Trust Building - Calibrating Trust in Visual Analytics. I Proceedings - 2020 IEEE Workshop on TRust and EXpertise in Visual Analytics, TREX 2020: Proceedings (s. 9-15). Artikel 9307969 IEEE. https://doi.org/10.1109/TREX51495.2020.00006

Han, K., Wu, B., Tang, J., Cui, S., Aslay, C. & Lakshmanan, L. VS. (2021). Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. I Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data (s. 671-684). Association for Computing Machinery. https://doi.org/10.1145/3448016.3459243

Han, W. (2021). Making and Trusting Decisions in Visual Analytics. I Proceedings - 2021 IEEE Workshop on TRust and EXpertise in Visual Analytics, TREX 2021 (s. 14 - 19). IEEE. https://doi.org/10.1109/TREX53765.2021.00008

Han, W. & Schulz, H.-J. (2023). Providing visual analytics guidance through decision support. Information Visualization, 22(2), 140-165. https://doi.org/10.1177/14738716221147289

Han, W. (2023). Towards Trustworthy Decision Making in Visual Analytics. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus Universitet.

Hammond, A., Liu, Z., Pérami, T., Sewell, P., Birkedal, L. & Pichon-Pharabod, J. (2024). An Axiomatic Basis for Computer Programming on the Relaxed Arm-A Architecture: The AxSL Logic. Proceedings of the ACM on Programming Languages , 8, 604-637. Artikel 21. https://doi.org/10.1145/3632863

Ham, F. V., Schulz, H.-J. & Dimicco, J. M. (2009). Honeycomb: Visual Analysis of Large Scale Social Networks. I Human-Computer Interaction – INTERACT 2009: 12th IFIP TC 13 International Conference Uppsala, Sweden, August 24-28, 2009 Proceedings, Part II (s. 429-442). Springer. https://doi.org/10.1007/978-3-642-03658-3_47

Hallgren, P. A., Orlandi, C. & Sabelfeld, A. (2017). PrivatePool: Privacy-Preserving Ridesharing. I Proceedings - IEEE 30th Computer Security Foundations Symposium, CSF 2017 (s. 276-291). Artikel 8049726 IEEE Press. https://doi.org/10.1109/CSF.2017.24

Hall-Andersen, M. N. & Schwartzbach, N. I. (2021). Game Theory on the Blockchain: A Model for Games with Smart Contracts. I I. Caragiannis & K. A. Hansen (red.), Algorithmic Game Theory - 14th International Symposium, SAGT 2021, Proceedings: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021Proceedings (s. 156-170). Springer. https://doi.org/10.1007/978-3-030-85947-3_11

Hall-Andersen, M. N. & Nielsen, J. B. (2023). On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles. I C. Hazay & M. Stam (red.), Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23–27, 2023, Proceedings, Part II (s. 438-469). Springer. https://doi.org/10.1007/978-3-031-30617-4_15, https://doi.org/10.1007/978-3-031-30617-415

Hall-Andersen, M. N. (2024). Either/Or. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus University.

Hall, M., Hoggan, E. & Brewster, S. (2008). T-Bars: towards tactile user interfaces for mobile touchscreens. I Proceedings of the 10th international conference on Human computer interaction with mobile devices and services (s. 411-414)

Hadlak, S., Schumann, H. & Schulz, H.-J. (2015). A Survey of Multi-faceted Graph Visualization. I R. Borgo, F. Ganovelli & I. Viola (red.), EuroVis'15 State of the Art Reports (s. 1-20). Eurographics Association. https://doi.org/10.2312/eurovisstar.20151109

Hadlak, S., Tominski, C., Schulz, H.-J. & Schumann, H. (2010). Visualization of attributed hierarchical structures in a spatiotemporal context. International Journal of Geographical Information Science, 24(10), 1497-1513. https://doi.org/10.1080/13658816.2010.510840

Hadlak, S., Schulz, H.-J. & Schumann, H. (2011). In Situ Exploration of Large Dynamic Networks. IEEE Transactions on Visualization and Computer Graphics, 17(12), 2334-2343. https://doi.org/10.1109/TVCG.2011.213

Hachisuka, T. & Jensen, H. W. (2011). Robust Adaptive Photon Tracing using Photon Path Visibility. A C M Transactions on Graphics, 30(5), 114:1 - 114:11. https://doi.org/10.1145/2019627.2019633

Hachisuka, T., Pantaleoni, J. & Jensen, H. W. (2012). A Path Space Extension for Robust Light Transport Simulation. A C M Transactions on Graphics, 31(6), Article 191. https://doi.org/10.1145/2366145.2366210

Hachisuka, T., Jarosz, W., Bouchard , G., Christensen, P., Frisvad, J. R., Wenzel, J., Henrik Wann, J., Kaschalk, M., Knaus, C., Selle, A. & Spencer, B. (2012). State of the Art in Photon-Density Estimation: Course notes. I SIGGRAPH '12 ACM SIGGRAPH 2012 Courses Association for Computing Machinery. https://doi.org/10.1145/2343483.2343489

Hachisuka, T., Jarosz, W., Georgiev, I., Kaplanyan, A., Nowrouzezahrai, D. & Spencer, B. (2013). State of the Art in Photon-Density Estimation: Course notes. I Proceeding, SA '13 SIGGRAPH Asia 2013 Courses Association for Computing Machinery. https://doi.org/10.1145/2542266.2542281

Hachisuka, T., Kaplanyan, A. S. & Dachsbacher, C. (2014). Multiplexed Metropolis Light Transport. A C M Transactions on Graphics, 33(4), Artikel 100. https://doi.org/10.1145/2601097.2601138

Viser resultater 1601 til 1650 ud af 3093

Forrige

Næste

Revideret 26.11.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series