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

Jensen, A. H., Lauridsen, F., Zardbani, F., Idreos, S. & Karras, P. (2021). Revisiting Multidimensional Adaptive Indexing [Experiment Analysis]. I Y. Velegrakis, D. Zeinalipour-Yazti, P. K. Chrysanthis & F. Guerra (red.), Proceedings of the 24th International Conference on Extending Database Technology, EDBT 2021, Nicosia, Cyprus, March 23 - 26, 2021 (s. 469-474). openproceedings.org. https://doi.org/10.5441/002/edbt.2021.53

Jensen, J. M. (2017). Reference free phasing and representation of complex variation.

Jensen, J. L. (2012). Supporting Seamful Development of Positioning Applications through Model Based Translucent Middleware. Department of Computer Science, Aarhus University.

Jensen, M. M. (2016). Game Mechanics and Bodily Interactions: Designing Interactive Technologies for Sports Training. Department of Computer Science, Aarhus University.

Jensen, S. H. (2013). Static Analysis for JavaScript. Datalogisk Institut, Aarhus Universitet.

Jensen, C. S. (2015). Automated Testing of Event-Driven Applications. Department of Computer Science, Aarhus University.

Jawurek, M., Kerschbaum, F. & Orlandi, C. (2013). Zero-knowledge using garbled circuits: Or how to prove non-algebraic statements efficiently. I A.-R. Sadeghi , V. Gligor & M. Yung (red.), Proceedings of the ACM Conference on Computer and Communications Security, CCS '13 (s. 955-966). Association for Computing Machinery. https://doi.org/10.1145/2508859.2516662

Javadi, S., Moradan, A., Sorkhpar, M., Zaporojets, K., Mottin, D. & Assent, I. (2024). Wiki Entity Summarization Benchmark.

Januzelli, J., Roy, L. & Xu, J. (2025). Under What Conditions Is Encrypted Key Exchange Actually Secure? I S. Fehr & P.-A. Fouque (red.), Advances in Cryptology – EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques: Proceedings (s. 451-481). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-91124-8_16

Jansson, J., Mampentzidis, K., Rajaby, R. & Sung, W.-K. (2019). Computing the Rooted Triplet Distance between Phylogenetic Networks. I C. J. Colbourn, R. Grossi & N. Pisanti (red.), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings (s. 290-303). Springer.

Jansson, J., Mampentzidis, K. & Thekkumpadan Puthiyaveedu, S. (2019). Building a Small and Informative Phylogenetic Supertree. Abstract fra Workshop on Algorithms in Bioinformatics (WABI) 2019, Buffalo, New York, USA.

Jansson, J., Mampentzidis, K. & Sandhya, T. P. (2019). Building a small and informative phylogenetic supertree. I K. T. Huber & D. Gusfield (red.), 19th International Workshop on Algorithms in Bioinformatics, WABI 2019 Artikel 1 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.WABI.2019.1

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2014). Framework for Outsourcing of Secure Computation. I G.-J. Ahn , A. Oprea & R. Safavi-Naini (red.), Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, CCSW '14 (s. 81-92 ). Association for Computing Machinery. https://doi.org/10.1145/2664168.2664170

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://arxiv.org/pdf/1502.05273v1

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://eprint.iacr.org/2015/130

Jakobsen, J. & Orlandi, C. (2015). On the CCA (in)security of MTProto. http://eprint.iacr.org/2015/1177

Jakobsen, J. & Orlandi, C. (2016). On the CCA (in)security of MTProto. I Proceedings of the 6th Workshop on Security and Privacy in Smartphones and Mobile Devices: SPSM '16 (s. 113-116). Association for Computing Machinery. https://doi.org/10.1145/2994459.2994468

Jakobsen, K., Stougaard, J., Petersen, M. G., Winge, J., Grønbæk, J. E. & Rasmussen, M. K. (2016). Expressivity in Open-ended Constructive Play: Building and Playing Musical Lego Instruments. I L. Anthony, G. Sim & R. Jones (red.), Proceedings of IDC 2016 - The 15th International Conference on Interaction Design and Children (s. 46 - 57). Association for Computing Machinery. https://doi.org/10.1145/2930674.2930683

Jakobsen, S. K. & Orlandi, C. (2016). How To Bootstrap Anonymous Communication. I ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (s. 333-344). Association for Computing Machinery. https://doi.org/10.1145/2840728.2840743

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2016). A Framework for Outsourcing of Secure Computation. http://eprint.iacr.org/2016/037

Jakobsen, F. L., Pedersen, S. M., Schnedler, J. A. & Øllegaard, N. H. (2016). Exploring the use of shape change in home appliances. I M. Broekhuijsen (red.), Proceedings of the 10th Anniversary Conference on Tangible Embedded and Embodied Interaction - TEI 2016 (s. 462-467). Association for Computing Machinery. https://doi.org/10.1145/2839462.2856539

Jakobsen, K., Petersen, M. G. & Rasmussen, M. K. (2015). Framing Open-Ended and Constructive Play with Emerging Interactive Materials. 150-159. Afhandling præsenteret på Interaction Design and Children 2015, Boston, Massachusetts, USA.

Jakobsen, K., Winge, J. & Petersen, M. G. (2016). Hitmachine: Collective Musical Expressivity for Novices. Afhandling præsenteret på New Interfaces for Musical Expression 2016, Brisbane, Queensland, Australien.

Jakobsen, A. B., Jørgensen, R. S. M., van de Pol, J. & Pavlogiannis, A. (2024). Fast Symbolic Computation of Bottom SCCs. I B. Finkbeiner & L. Kovács (red.), Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2024 (s. 110-128). Springer. https://doi.org/10.1007/978-3-031-57256-2_6

Jakobsen, T. P. (2015). Practical Aspects of Secure Multiparty Computation. Department of Computer Science, Aarhus University.

Jakobsen, K. (2019). Graphene-based Interaction Design for Constructive Play: Tangible Music-making Technologies for Children. Aarhus University.

Jafargholi, Z., Kamath, C., Klein, K., Komargodski, I., Pietrzak, K. & Wichs, D. (2017). Be Adaptive, Avoid Overcommitting. I J. Katz & H. Shacham (red.), Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Bind 10401, s. 133-163). Springer VS. https://doi.org/10.1007/978-3-319-63688-7_5

Jafargholi, Z., Scafuro, A. & Wichs, D. (2017). Adaptively Indistinguishable Garbled Circuits. I Y. Kalai & L. Reyzin (red.), Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (Bind 10678, s. 40-71). Springer VS. https://doi.org/10.1007/978-3-319-70503-3

Jafargholi, Z. & Oechsner, S. (2020). Adaptive Security of Practical Garbling Schemes. I K. Bhargavan, E. Oswald & M. Prabhakaran (red.), Progress in Cryptology – INDOCRYPT 2020 - 21st International Conference on Cryptology in India 2020, Proceedings: INDOCRYPT 2020 (s. 741-762). Springer VS. https://doi.org/10.1007/978-3-030-65277-7_33

Jafargholi, Z., Larsen, K. G. & Simkin, M. (2021). Optimal oblivious priority queues. I D. Marx (red.), ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 (s. 2366-2383). Association for Computing Machinery.

Jacobs, K., Timany, A. & Devriese, D. (2021). Fully abstract from static to gradual. Proceedings of the ACM on Programming Languages , 5(POPL), Artikel 7. https://doi.org/10.1145/3434288

Jacobs, K., Devriese, D. & Timany, A. (2022). Purity of an ST monad: Full abstraction by semantically typed back-translation. Proceedings of the ACM on Programming Languages , 6(OOPSLA1), Artikel 82. https://doi.org/10.1145/3527326

Jacobs, J., Hinrichsen, J. K. & Krebbers, R. (2023). Dependent Session Protocols in Separation Logic from First Principles (Functional Pearl). Proceedings of the ACM on Programming Languages , 7(ICFP), 768-795. Artikel 214. https://doi.org/10.1145/3607856

Jacobs, J., Hinrichsen, J. K. & Krebbers, R. (2024). Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing. Proceedings of the ACM on Programming Languages , 8(POPL), Artikel 47. https://doi.org/10.1145/3632889

Jacob, R., Larsen, K. G. & Nielsen, J. B. (2019). Lower Bounds for Oblivious Data Structures. I T. M. Chan (red.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (s. 2439-2447). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.149

Iversen, O. S., Caspersen, M. E. & Petersen, M. G. (2025). Professorer: Fire spørgsmål er afgørende i fagudviklingen af teknologiforståelse. Skolemonitor. https://skolemonitor.dk/debat/art10264270/Fire-spørgsmål-er-afgørende-i-fagudviklingen-af-teknologiforståelse

Ishai, Y., Kumarasubramanian, A., Orlandi, C. & Sahai, A. (2011). On Invertible Sampling and Adaptive Security. Lecture Notes in Computer Science, 6477, 466-482. https://doi.org/10.1007/978-3-642-17373-8_27

Ishai, Y., Kushilevitz, E., Meldgaard, S. T., Orlandi, C. & Paskin-Cherniavsky, A. (2013). On the Power of Correlated Randomness in Secure Computation. I A. Sahai (red.), Theory of Cryptography: 10th TCC 2013. Proceedings (s. 600-620 ). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_34

Ishai, Y., Patra, A., Patranabis, S., Ravi, D. & Srinivasan, A. (2022). Fully-Secure MPC with Minimal Trust. I Theory of Cryptography - 20th International Conference, TCC 2022, Proceedings (s. 470–501). Springer. https://doi.org/10.1007/978-3-031-22365-5_17

Ingesman, M. D. & Ernst, E. (2012). Lifted Java: A Minimal Calculus for Translation Polymorphism. Journal of Object Technology, 11(1), 1-23. https://doi.org/10.5381/jot.2012.11.1.a2

Ingesman, M. D. & Ernst, E. (2011). Lifted Java: A Minimal Calculus for Translation Polymorphism. Lecture Notes in Computer Science, 6705, 179-193. https://doi.org/10.1007/978-3-642-21952-8_14

Iivari, N., Iversen, O. S., Kafai, Y. B., Antle, A. N., Petersen, M. G., Kinnula, M., Dindler, C., Kayali, F., Bonsignore, E., Monga, C., Schaper, M.-M. & Sharma, S. (Accepteret/In press). Pushing the Boundaries of Computational Empowerment of Children. I IDC '25: Interaction Design and Children Conference https://interact.oulu.fi/idc-2025

Ibsen-Jensen, R. & Miltersen, P. B. (2011). Solving simple stochastic games with few coin toss positions. http://arxiv.org/abs/1112.5255

Ibsen-Jensen, R. & Miltersen, P. B. (2012). Solving Simple Stochastic Games with Few Coin Toss Positions. Lecture Notes in Computer Science, 7501, 636-647. https://doi.org/10.1007/978-3-642-33090-2_55

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

Ibsen-Jensen, R. (2013). Strategy complexity of two-player, zero-sum games. Department of Computer Science, University of Aarhus.

Hwang, C., Feuchtner, T., Oakley, I. & Grønbæk, K. (2024). Enriching Industrial Training Experience in Virtual Reality with Pseudo-Haptics and Vibrotactile Stimulation. 1-11. Afhandling præsenteret på The 30th ACM Symposium on Virtual Reality Software and Technology. https://doi.org/10.1145/3641825.3687728

Hwang, C., Feuchtner, T. & Grønbæk, K. (2025). Pseudo-Haptics for Weight Perception in VR: Controller vs. Bare Hand Interactions with Tracking Delay and Vertical Offset. I 2024 10th International Conference on Virtual Reality, ICVR 2024 (s. 91-99) https://doi.org/10.1109/ICVR62393.2024.10868891

Hvilshøj, F., Iosifidis, A. & Assent, I. (2021). On Quantitative Evaluations of Counterfactuals. ArXiv. https://doi.org/10.48550/arXiv.2111.00177

Hvilshøj, F., Iosifidis, A. & Assent, I. (2021). ECINN: Efficient Counterfactuals from Invertible Neural Networks. I 32nd British Machine Vision Conference 2021, BMVC 2021, Virtual https://arxiv.org/abs/2103.13701

Viser resultater 1351 til 1400 ud af 3005

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series