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. (2004). Constant Width Planar Computation Characterizes ACC⁰. I V. Diekert & M. Habib (red.), STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004. Proceedings (s. 44-55). Springer. https://doi.org/10.1007/978-3-540-24749-4_5

Hansen, K. A. (2006). Constant Width Planar Computation Characterizes ACC⁰. Theory of Computing Systems, 39(1), 79-92. https://doi.org/10.1007/s00224-005-1258-7

Hansen, K. A. (2008). Constant Width Planar Branching Programs Characterize ACC⁰ in Quasipolynomial Size. I 2008 23rd Annual IEEE Conference on Computational Complexity (s. 92-99). IEEE. https://doi.org/10.1109/CCC.2008.11

Hansen, K. A. (2006). Constant Width and Constant Depth Computation.

Abe, M., Chase, M., David, B., Kohlweiss, M., Nishimaki, R. & Ohkubo, M. (2016). Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. Journal of Cryptology, 29(4), 1-46. https://doi.org/10.1007/s00145-015-9211-7

Kolby, S., Ravi, D. & Yakoubov, S. (2024). Constant-Round YOSO MPC Without Setup. IACR Communications in Cryptology, 1(3). https://doi.org/10.62056/ae5w4fe-3

Abram, D., Doerner, J., Ishai, Y. & Narayanan, V. (2024). Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output. I M. Joye & G. Leander (red.), Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2024, Proceedings (s. 122–154). Springer. https://doi.org/10.1007/978-3-031-58740-5_5

Toft, T. (2009). Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values. Lecture Notes in Computer Science, 357-371. https://doi.org/10.1007/978-3-642-00862-7_24

Nan Cheng, Gupta, N., Mitrokotsa, A. & Tozawa, K. (2024). Constant-Round Private Decision Tree Evaluation for Secret Shared Data. Proceedings on Privacy Enhancing Technologies, 2024(1), 397-412. https://doi.org/10.56553/popets-2024-0023

Damgård, I. B. & Ishai, Y. (2005). Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. I V. Shoup (red.), Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005. Proceedings (s. 378-394). Springer. https://doi.org/10.1007/11535218_23

Nielsen, J. B., Schneider, T. & Trifiletti, R. (2017). Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. I NDSS ’17 (s. 1-15). Internet Society. https://doi.org/10.14722/ndss.2017.23075

Hazay, C., Polychroniadou, A. & Venkitasubramaniam, M. (2017). Constant-Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. I S. Fehr (red.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: PKC 2017 (Bind 10175, s. 428-460 ). Springer VS. https://doi.org/10.1007/978-3-662-54388-7_15

Damgård, I. B. & Zakarias, S. N. H. (2012). Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing. Cryptology ePrint Archive. http://eprint.iacr.org/2012/512

Damgård, I. B. & Zakarias, S. (2013). Constant-overhead secure computation of Boolean circuits using preprocessing. I A. Sahai (red.), Theory of Cryptography: 10th TCC 2013. Proceedings (s. 621-641). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_35

Timany, A. & Sozeau, M. (2017). Consistency of the Predicative Calculus of Cumulative Inductive Construction (pCuIC). https://hal.inria.fr/hal-01615123

Thomsen, J. G. (2013). Consistency in the World Wide Web: Specification, Verification, and Evaluation. Datalogisk Institut, Aarhus Universitet.

van Hellemond, I. E. G., Bouwmeester, S., Olson, C. W., Bøtker, H. E., Kaltoft, A. K., Nielsen, S. S., Terkelsen, C. J., Maynard, C., Andersen, M. P., Gorgels, A. P. M. & Wagner, G. S. (2011). Consideration of QRS complex in addition to ST-segment abnormalities in the estimated "risk region" during acute anterior myocardial infarction. Journal of Electrocardiology, 44(3), 370-6. https://doi.org/10.1016/j.jelectrocard.2011.01.004

Nouwens, M., Bagge, R., Kristensen, J. B. & Klokmose, C. N. (2022). Consent-O-Matic: Automatically Answering Consent Pop-ups Using Adversarial Interoperability. I CHI 2022 - Extended Abstracts of the 2022 CHI Conference on Human Factors in Computing Systems Artikel 238 Association for Computing Machinery. https://doi.org/10.1145/3491101.3519683

Beer, A., Draganov, A., Hohma, E., Jahn, P., Frey, C. M. M. & Assent, I. (2023). Connecting the Dots: Density-Connectivity Distance unifies DBSCAN, k-Center and Spectral Clustering. I KDD 2023 : Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (s. 80-92). Association for Computing Machinery. https://doi.org/10.1145/3580305.3599283

Clemensen, J., Larsen, S. B. & Ejskjær, N. (2004). Connecting Home and Clinican, Treatment of Diabetic Foot Ulcers at Home. I The CHI2004 workshop on HCI and Homecare: Connecting Families and Clinicians

Rasmusson, A., Sørensen, T. S. & Ziegler, G. (2013). Connected Components Labeling on the GPU with Generalization to Voronoi Diagrams and Signed Distance Fields. I G. Bebis et al. (red.), Advances in Visual Computing: 9th International Symposium, ISVC 2013, Rethymnon, Crete, Greece, July 29-31, 2013. Proceedings, Part I (s. 206-215). Springer VS. https://doi.org/10.1007/978-3-642-41914-0_21

Skyum, S. (1975). Confusion in the Garden of Eden. Proceedings of the American Mathematical Society, 50, 332-336.

Nieto Rodriguez, A. (2023). Conflict-free Replicated Data Types have Abstract Data Types. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus University.

Christensen, H. B. (2017). Configuration Management: Preprint of Chapter 33 in "Flexible, Reliable Software" 2nd Edition.

Engelmann, F., Speichert, J. P., God, R., Kargl, F. & Bösch, C. (2021). Confidential Token-Based License Management. I AMSec 2021 - Proceedings of the 2021 Workshop on Additive Manufacturing (3D Printing) Security, co-located with CCS 2021 (s. 39-48). Association for Computing Machinery. https://doi.org/10.1145/3462223.3485619

Damgård, I., Damgård, K., Nielsen, K., Nordholt, P. S. & Toft, T. (2017). Confidential benchmarking based on multiparty computation. I J. Grossklags & B. Preneel (red.), Financial Cryptography and Data Security - 20th International Conference, FC 2016, Revised Selected Papers (Bind 9603 LNCS, s. 169-187). Springer VS. https://doi.org/10.1007/978-3-662-54970-4_10

Miltersen, P. B. (red.) (2008). Conference on Computational Complexity 2007: Guest Editor's Foreword. Computational Complexity, 17(2), 147-148. https://doi.org/10.1007/s00037-008-0247-z

Dallant, J. & Iacono, J. (2025). Conditional Lower Bounds for Dynamic Geometric Measure Problems. ACM Transactions on Algorithms, 21(2), Artikel 23. https://doi.org/10.1145/3727878

Christensen, S., Kristensen, L. M. & Mailund (2001). Condensed State Spaces for Timed Petri Nets. I Proceedings of International Conference on Application and Theory of Petri Nets (ICATPN 2001) (s. 101-120)

Jensen, K. & Emerson, E. A. (red.) (1996). Condensed State Spaces for Symmetrical Coloured Petri Nets. Formal Methods in System Design, 9(1/2), 7-40. https://doi.org/10.1007/BF00625967

Afshani, P., Sheng, C., Tao, Y. & Wilkinson, B. T. (2014). Concurrent range reporting in two-dimensional space. I C. Chekuri (red.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (s. 983-994). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Van Der Berg, F. I. & Van De Pol, J. (2019). Concurrent chaining hash maps for software model checking. I C. Barrett & J. Yang (red.), Proceedings of the 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019 (s. 46-54). Artikel 8894279 IEEE. https://doi.org/10.23919/FMCAD.2019.8894279

van de Pol, J. (2019). Concurrent algorithms and data structures for model checking. I W. Fokkink & R. van Glabbeek (red.), 30th International Conference on Concurrency Theory, CONCUR 2019 Artikel 4 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CONCUR.2019.4

Qian, Z. (2023). Concurrency And Races In Classical Linear Logic. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus Universitet.

Larsen, K. G. & Nielsen, M. (red.) (2001). CONCUR 2001 - Concurrency Theory: 12th International Conference Aalborg, Denmark, August 20-25, 2001 Proceedings. Springer. Lecture Notes in Computer Science Bind 2154 https://doi.org/10.1007/3-540-44685-0

Baum, C. & Nof, A. (2020). Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. I A. Kiayias, M. Kohlweiss, P. Wallden & V. Zikas (red.), Public-Key Cryptography – PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (Bind 1, s. 495-526). Springer. https://doi.org/10.1007/978-3-030-45374-9_17

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). I T. Peyrin & S. Galbraith (red.), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Bind 11274, s. 86-117). Springer VS. https://doi.org/10.1007/978-3-030-03332-3_4

Gronvall, E., Verdezoto, N., Bagalkot, N. L. & Sokoler, T. (2015). Concordance: A Critical Participatory Alternative in Healthcare IT. I O. W. Bertelsen & K. Halskov (red.), Critical Alternatives, 5th decennial Aarhus Conference: conference proceedings, conference papers. Department of Computer Science, Aarhus University. https://doi.org/10.7146/aahcc.v1i1.21315

Shaik, I. & van de Pol, J. (2023). Concise QBF Encodings for Games on a Grid (extended version). https://doi.org/10.48550/arXiv.2303.16949

Shaik, I. (2023). Concise Encodings for Planning and 2-Player Games. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus Universitet.

Annenkov, D., Botsch Nielsen, J. & Spitters, B. (2020). ConCert: A smart contract certification framework in Coq. I Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’20), January 20-21, 2020, New Orleans, LA, USA (s. 215-228). Association for Computing Machinery. https://doi.org/10.1145/3372885.3373829

Annenkov, D., Nielsen, J. B. & Spitters, B. (2020). ConCert: A Smart Contract Certification Framework in Coq. (s. 215-228). arxiv.org. https://doi.org/10.1145/3372885.3373829

Nielsen, M. L. (2007). Conceptions of Object-oriented Terms: A Study in Progress. I Proceedings of WIP-PPIG 2007 Psychology of Programming Interest Group.

Damgård, I. B. (1987). Concatenated Group Codes and Their Exponents. I E E E Transactions on Information Theory, Vol. 33, Issue 6.

Madsen, O. L. (1999). COM Support in BETA. I Proceedings of the Workshop on Object-Oriented Technology (s. 187). Springer. https://doi.org/10.1007/3-540-46589-8

Tsirogiannis, C. & Sandel, B. S. (2013). Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time. I A. Darling & J. Stoye (red.), Algorithms in Bioinformatics: 13th International Workshop, WABI 2013, Sophia Antipolis, France, September 2-4, 2013. Proceedings (s. 170-184). Springer VS. https://doi.org/10.1007/978-3-642-40453-5_14

Tsirogiannis, C. & Sandel, B. S. (2014). Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time. Algorithms for Molecular Biology, 9(1), Artikel 15. https://doi.org/10.1186/1748-7188-9-15

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. https://doi.org/10.1007/978-3-030-25005-8_24

Christiansen, C., Mailund , Pedersen, C. N. S. & Randers, M. (2005). Computing the Quartet Distance between Trees of Arbitrary Degree. I Proceedings of the 5th International Workshop on Algorithms in Bioinformatics (WABI) (s. 77-88)

Stissing, M., Pedersen, C. N. S., Mailund, T. & Brodal, G. S. (2007). Computing the Quartet Distance between Evolutionary Trees of Bounded Degree. I Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC) (s. 101-110)

Viser resultater 4801 til 4850 ud af 6058

Revideret 26.11.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series