Chakraborty, S., Kayal, C.
& Paraashar, M. (2022).
Separations Between Combinatorial Measures for Transitive Functions. I M. Bojanczyk, E. Merelli & D. P. Woodruff (red.),
49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Artikel 36 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.ICALP.2022.36
Chakraborty, S., Kayal, C., Mittal, R.
, Paraashar, M., Sanyal, S. & Saurabh, N. (2023).
On the Composition of Randomized Query Complexity and Approximate Degree. I N. Megow & A. Smith (red.),
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX/RANDOM 2023 Artikel 63 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63
Castric, V.
, Bechsgaard, J. S., Grenier, S., Noureddine, R.
, Schierup, M. H. & Vekemans, X. (2010).
Molecular evolution within and between self-incompatibility specificities.
Molecular Biology and Evolution,
27(1), 11-20.
https://doi.org/10.1093/molbev/msp224
Caspersen, M. E. (2004).
Discussant Submission. Afhandling præsenteret på 3rd "Killer Examples" for Design Patterns and Objects First Workshop at OOPSLA 2004, Vancouver, British Columbia, Canada.
Caspersen, M. E., Cassel, L. N., Davies, G., McCauley, R., McGettrick, A., Pyster, A. & Sloan, R. (2008).
Curriculum Update from the ACM Education Board: CS2008 and a Report on Masters Degrees.Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education.
S I G C S E Bulletin Inroads, (1), 530.
https://doi.org/10.1145/1352135.1352313
Caspersen, M. E., Hummel, J., Alphonce, C., Bergin, J., Hansen, S., Heliotis, J. & Kölling, M. (2008).
Nifty Objects for CS0 and CS1. I
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education (s. 437). Association for Computing Machinery.
https://doi.org/10.1145/1352135.1352283
Caspersen, M. E., Cassel, L. N., Davies, G., Pears, A., Seidman, S. & Topi, H. (2008).
What is Masters Level Education in Informatics. I
Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2008 (s. 341). Association for Computing Machinery.
https://doi.org/10.1145/1384271.1384383
Cascudo Pueyo, I., Damgård, I. B., David, B. M., Giacomelli, I., Nielsen, J. B. & Trifiletti, R. (2015).
Additively Homomorphic UC commitments with Optimal Amortized Overhead. I J. Katz (red.),
Public-Key Cryptography, PKC 2015: 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30-April 1, 2015, Proceedings (s. 495–515). Springer.
https://doi.org/10.1007/978-3-662-46447-2_22
Cascudo Pueyo, I., Cramer, R., Mirandola, D., Padró, C. & Xing, C. (2015).
On Secret Sharing with Nonlinear Product Reconstruction.
S I A M Journal on Discrete Mathematics,
29(2), 1114-1131.
https://doi.org/10.1137/130931886
Cascudo, I.
, Damgård, I., David, B. M., Döttling, N. & Nielsen, J. B. (2016).
Rate-1, linear time and additively homomorphic UC commitments. I M. Robshaw & J. Katz (red.),
Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings (Bind 9816, s. 179-207). Springer VS.
https://doi.org/10.1007/978-3-662-53015-3_7
Cascudo, I., Damgård, I., Farràs, O.
& Ranellucci, S. (2017).
Resource-Efficient OT Combiners with Active Security. I Y. Kalai & L. Reyzin (red.),
Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (Bind 10678, s. 461-486). Springer VS.
https://doi.org/10.1007/978-3-319-70503-3_15
Cascudo, I.
, Damgård, I., David, B., Döttling, N., Dowsley, R. & Giacomelli, I. (2019).
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). I S. D. Galbraith & S. Moriai (red.),
Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (s. 606-635). Springer.
https://doi.org/10.1007/978-3-030-34621-8_22