Hazay, C., Orsini, E.
, Scholl, P. & Soria-Vazquez, E. (2018).
TinyKeys: A New Approach to Efficient Multi-Party Computation. I H. Shacham & A. Boldyreva (red.),
Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (Bind 10993, s. 3-33). Springer VS.
https://doi.org/10.1007/978-3-319-96878-0_1
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
Hazay, C., López-Alt, A., Wee, H.
& Wichs, D. (2013).
Leakage-resilient cryptography from minimal assumptions. I T. Johansson & P. Nguyen (red.),
Leakage-Resilient Cryptography from Minimal Assumptions: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings (s. 160-176). Springer VS.
https://doi.org/10.1007/978-3-642-38348-9_10
Haselwarter, P. G., Rivas, E., Van Muylder, A., Winterhalter, T., Abate, C.
, Sidorenco, N., Hriţcu, C., Maillard, K.
& Spitters, B. (2023).
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq.
ACM Transactions on Programming Languages and Systems,
45(3), 61. Artikel 15.
https://doi.org/10.1145/3594735
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, 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, 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, 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