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

Nielsen, J. B. (red.), Damgård, I. B., Salvail, L. & Cachin, C. (2006). Summary Report on Unconditionally Secure Protocols. (s. 1- 25). ECRYPT - European Network of Excellence in Cryptology.

Nielsen, J. B. (red.), Alwen, J., Cachin, C., Pereira, O., Sadeghi, A.-R., Schoenmakers, B., Shelat, A. & Visconti, I. (2007). Summary Report on Rational Cryptographic Protocols. ECRYPT - European Network of Excellence in Cryptology.

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

Bertelsen, O. W. (2014). Suffering Beyond Negotiation: Towards a Biographic Perspective on Cooperative Design for Therapy. I C. Rossitto, L. Ciolfi, D. Martin & B. C. (red.), COOP 2014 - Proceedings of the 11th International Conference on the Design of Cooperative Systems, 27-30 May 2014, Nice (France) Springer. http://www.springer.com/computer/hci/book/978-3-319-06497-0

Bringmann, K. & Larsen, K. G. (2013). Succinct Sampling from Discrete Distributions. I Proceedings of the 45th annual ACM Symposium on Theory of Computing, STOC '13 (s. 775-782 ). Association for Computing Machinery. https://doi.org/10.1145/2488608.2488707

Davoodi, P., Raman, R. & Satti, S. (2012). Succinct Representations of Binary Trees for Range Minimum Queries. Lecture Notes in Computer Science, 7434, 396-407 . https://doi.org/10.1007/978-3-642-32241-9_34

Campanelli, M. & Khoshakhlagh, H. (2021). Succinct Publicly-Certifiable Proofs: Or, Can a Blockchain Verify a Designated-Verifier Proof? I A. Adhikari, R. Küsters & B. Preneel (red.), Progress in Cryptology – INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, 2021, Proceedings: 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings (s. 607-631). Springer. https://doi.org/10.1007/978-3-030-92518-5_27

Abram, D., Malavolta, G. & Roy, L. (2025). Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits. I M. Koucky & N. Bansal (red.), STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing (s. 1875-1886). Association for Computing Machinery. https://doi.org/10.1145/3717823.3718164

Schmidt, E. M. & Szymanski, T. G. (1977). Succinctness of Descriptions of Unambiguous Context-Free Languages. S I A M Journal on Computing, 6(3), 547-553. https://doi.org/10.1137/0206039

Abram, D., Roy, L. & Scholl, P. (2024). Succinct Homomorphic Secret Sharing. I M. Joye & G. Leander (red.), Advances in Cryptology -- EUROCRYPT 2024 (s. 301-330). Springer Nature. https://doi.org/10.1007/978-3-031-58751-1_11

Davoodi, P. & Satti, S. R. (2011). Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. Lecture Notes in Computer Science, 6648, 195-205. https://doi.org/10.1007/978-3-642-20877-5_21

Ateniese, G., Magri, B. & Venturi, D. (2020). Subversion-resilient signatures: Definitions, constructions and applications. Theoretical Computer Science, 820, 91-122. https://doi.org/10.1016/j.tcs.2020.03.021

Abboud, A., Backurs, A., Hansen, T. D., Williams, V. V. & Zamir, O. (2016). Subtree isomorphism revisited. I 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016 (Bind 2, s. 1256-1271). Association for Computing Machinery. https://doi.org/10.1137/1.9781611974331.ch88

Klokmose, C. N. (2025). Substrates: From Webstrates and Beyond. I Proceedings of Substrates 2025 workshop https://software-substrates.github.io/proceedings/2025/statements/Paper%205%20-%20Clemens%20Klokmose%20-%20Substrates,%20From%20Webstrates%20and%20Beyond.pdf

Bent, R., Katriel, I. & van Hentenryck, P. (2005). Sub-Optimality Approximations. I Springer LNCS 3709 (s. 122-136). Springer.

Alon, N., Grønlund, A., Jørgensen, S. F. & Larsen, K. G. (2024). Sublinear Time Shortest Path in Expander Graphs. I R. Kralovic & A. Kucera (red.), 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024 (s. 8:1-8:13). Artikel 8 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2024.8

Toft, T. (2011). Sub-linear, Secure Comparison With Two Non-Colluding Parties. Lecture Notes in Computer Science, 6571, 174-191. https://doi.org/10.1007/978-3-642-19379-8_11

Pinder, C., Vermeulen, J. & Cowan, B. R. (2018). Subliminal Semantic Number Processing on Smartphones. I L. Bailie & N. Oliver (red.), MobileHCI 2018 - Beyond Mobile: The Next 20 Years - 20th International Conference on Human-Computer Interaction with Mobile Devices and Services, Conference Proceedings (s. 24:1-24:13). Artikel a24 Association for Computing Machinery. https://doi.org/10.1145/3229434.3229451

Pinder, C., Vermeulen, J., Beale, R. & Hendley, R. (2015). Subliminal Priming of Nonconscious Goals on Smartphones. MobileHCI '15 Adjunct, 825-830. https://doi.org/10.1145/2786567.2793707

Friedmann, O., Hansen, T. D. & Zwick, U. (2011). Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. I Proceedings of the 43rd annual ACM symposium on Theory of computing (s. 283-292). Association for Computing Machinery. https://doi.org/10.1145/1993636.1993675

Liu, Y., Zhou, Q., Lystbæk, M. N., Kehoe, A., Gutierrez, M., Gellersen, H. & Pfeuffer, K. (2026). StylusPort: Investigating Teleportation using Stylus in VR. I N. Oliver, D. A. Shamma, H. Candello, P. Cesar, P. Lopes, A. Bozzon, T. Kosch, V. Liao, X. Ma, V. Artizzu, F. Draxler, G. Lopez, A. V. Reinschluessel, X. Tong & P. O. Toups Dugas (red.), CHI '26: Proceedings of the 2026 CHI Conference on Human Factors in Computing System Artikel 1678 Association for Computing Machinery. https://doi.org/10.1145/3772318.3793420

Riedel, C., Michael, G. G., Orgel, C., Baum, C., van der Bogert, C. H. & Hiesinger, H. (2021). Studying the Global Spatial Randomness of Impact Craters on Mercury, Venus, and the Moon With Geodesic Neighborhood Relationships. Journal of Geophysical Research: Planets, 126(3), Artikel e2020JE006693. https://doi.org/10.1029/2020JE006693

Kjærgaard, M. B. (2013). Studying Sensing-Based Systems: Scaling to Human Crowds in the Real World . I E E E Internet Computing, 17(5), 80 - 84 . https://doi.org/10.1109/MIC.2013.101

Bødker, S. & Bertelsen, O. W. (1998). Studying programming environments in use: Between principles and praxis. I Proceedings of NWPER '98: Nordic workshop on programming environment research

Hjorth, A. & Wilensky, U. (2019). Studying Conceptual Change in Classrooms Using Association Rule Mining to Detect Changes in Students' Explanations of the Effects of Urban Planning and Social Policy. Constructivist Foundations, 14(3), 272-283. https://constructivist.info/14/3/272

Avdic, M. & Vermeulen, J. (2019). Studying Breakdowns in Interactions with Smart Speakers. Afhandling præsenteret på The 2019 ACM CHI Conference on Human Factors in Computing Systems (CHI'19), Glasgow, Storbritannien. https://iotdirections.wordpress.com/

Kolby, S. (2025). Studies on Scalable Security. [Ph.d.-afhandling, Aarhus Universitet].

Campanelli, M., Francati, D. & Orlandi, C. (2023). Structure-Preserving Compilers from New Notions of Obfuscations. I A. Boldyreva & V. Kolesnikov (red.), Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part II (s. 663-693). Springer. https://doi.org/10.1007/978-3-031-31371-4_23

Matthews, P. (2026). Structure-Guided Explainability - From Regional to Counterfactual Explanations. [Ph.d.-afhandling, Aarhus Universitet].

Couteau, G., Bui, D. & Melissaris Papanikolaou, N. (2024). Structured-Seed Local Pseudorandom Generators and their Applications. https://eprint.iacr.org/2024/1027

Madsen, O. L., Magnusson, B. & Møller-Pedersen, B. (1990). Strong typing of object-oriented languages revisited. I OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (s. 140-150). Association for Computing Machinery. https://doi.org/10.1145/97946.97964

Madsen, O. L., Magnusson, B. & Møller-Pedersen, B. (1990). Strong typing of object-oriented languages revisited. I Proceedings of the European Conference on Object-Oriented Programming on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA/ECOOP 1990 (s. 140-150). Association for Computing Machinery. https://doi.org/10.1145/97945.97964

Grønbæk, K., Ørbæk, P., Kristensen, J. F. & Eriksen, M. A. (2003). Physical hypermedia: augmenting physical material with hypermedia structures. New Review of Hypermedia and Multimedia, 9(1), 5-34. https://doi.org/10.1080/13614560410001725293

Loss, J., Maurer, U. & Tschudi, D. (2018). Strong Separations Between Broadcast and Authenticated Channels. I U. Schmid & J. Widder (red.), 32nd International Symposium on Distributed Computing (DISC 2018) (Bind 121, s. 36:1-36:17). Artikel 36 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.DISC.2018.36

Balat, V. & Danvy, O. (1997). Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation. BRICS Report Series, (RS-97-43).

Balat, V. & Danvy, O. (1998). Strong normalization by type-directed partial evaluation and run-time code generation. I X. Leroy & A. Ohori (red.), Types in Compilation: Second International Workshop, TIC ’98 Kyoto, Japan, March 25–27, 1998 Proceedings (s. 240-252). Springer. https://doi.org/10.1007/BFb0055521

Gerhardy, P. & Kohlenbach, U. (2004). Strongly Uniform Bounds from Semi-Constructive Proofs. BRICS Report Series, (RS-04-31).

Gerhardy, P. & Kohlenbach, U. (2006). Strongly uniform bounds from semi-constructive proofs. Annals of Pure and Applied Logic, 141, 89-107.

Damgård, I., Haagh, H., Mercer, R., Nitulescu, A., Orlandi, C. & Yakoubov, S. (2020). Stronger Security and Constructions of Multi-designated Verifier Signatures. I R. Pass & K. Pietrzak (red.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings: Proceedings (Bind II, s. 229-260). Springer. https://doi.org/10.1007/978-3-030-64378-2_9

Munch-Hansen, A., Orlandi, C. & Yakoubov, S. (2021). Stronger Notions and a More Efficient Construction of Threshold Ring Signatures. I P. Longa & C. Ràfols (red.), Progress in Cryptology – LATINCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (s. 363-381). Springer. https://doi.org/10.1007/978-3-030-88238-9_18

Aggarwal, D., Damgård, I., Nielsen, J. B., Obremski, M., Purwanto, E., Ribeiro, J. & Simkin, M. (2019). Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. I A. Boldyreva & D. Micciancio (red.), Advances in Cryptology – CRYPTO 2019 : 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Bind II, s. 510-539). Springer. https://doi.org/10.1007/978-3-030-26951-7_18

Chung, E. & Larsen, K. G. (2023). Stronger 3SUM-Indexing Lower Bounds. I N. Bansal & V. Nagarajan (red.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (s. 444-455). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch19

Triandopoulos, N., Papamanthou, C. & Tamassia, R. (2008). Authenticated hash tables: Proceedings of the 15th ACM Conference on Computer and communications security. I Proceedings of the 15th ACM Conference on Computer and communications security (s. 437-448). Association for Computing Machinery. https://doi.org/10.1145/1455770.1455826

Batziou, E., Hansen, K. A. & Høgh, K. (2021). Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. I N. Bansal, E. Merelli & J. Worrell (red.), 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (Bind 198, s. 24:1-24:20). Artikel 24 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2021.24

Triandopoulos, N., Cornelius, C., Kapadia, A., Kotz, D., Peebles, D. & Shin, M. (2008). Anonysense: privacy-aware people-centric sensing. I Proceeding of the 6th international conference on Mobile systems, applications, and services (s. 211-224). Association for Computing Machinery. https://doi.org/10.1145/1378600.1378624

Valsted, F. M., Nielsen, C. V. H., Jensen, J. Q., Sonne, T. & Jensen, M. M. (2017). Strive: Exploring Assistive Haptic Feedback on the Run. I M. Brereton, D. Vyas, A. Soro, B. Ploderer, J. Waycott & A. Morrison (red.), Proceedings of the 29th Australian Computer-Human Interaction Conference: Human-Nature, OzCHI 2017 (s. 275-284). Association for Computing Machinery. https://doi.org/10.1145/3152771.3152801

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

Viser resultater 1051 til 1100 ud af 6138

Forrige

Næste

Revideret 26.11.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series