Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2016).
Guarded Cubical Type Theory: Path Equality for Guarded Recursion. I J.-M. Talbot & L. Regnier (red.),
CSL 2016: 25th EACSL Annual Conference on Computer Science Logic (s. 1 - 17)
Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2016).
Guarded Cubical Type Theory.
https://arxiv.org/pdf/1611.09263v1.pdf
Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2016).
Guarded cubical type theory. Abstract fra 22nd International Conference on Types for Proofs and Programs, Novi Sad, Serbien.
http://www.cs.au.dk/~spitters/TYPES16.pdf
Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2019).
Guarded Cubical Type Theory.
Journal of Automated Reasoning,
63(2), 211-253.
https://doi.org/10.1007/s10817-018-9471-7,
https://doi.org/10.1007/s10817-018-9471-7
Birkedal, L., Clouston, R., Mannaa, B., Ejlers Møgelberg, R., Pitts, A. M.
& Spitters, B. (2020).
Modal dependent type theory and dependent right adjoints.
Mathematical Structures in Computer Science,
30(2), 118-138.
https://doi.org/10.1017/S0960129519000197
Birkedal, L., Dinsdale-Young, T.
, Guéneau, A., Jaber, G., Svendsen, K. & Tzevelekos, N. (2021).
Theorems for free from separation logic specifications.
Proceedings of the ACM on Programming Languages ,
5(ICFP), Artikel 81.
https://doi.org/10.1145/3473586
Biniaz, A., Bose, P.
, van Duijn, I., Maheshwari, A. & Smid, M. (2016).
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. I T. C. Shermer (red.),
Proceedings of the 28th Canadian Conference on Computational Geometry (s. 140-146). Simon Fraser University. Vancouver, British Columbia Canada.
http://people.scs.carleton.ca/~michiel/RedBluePurpleCCCG16.pdf
Biniaz, A., Bose, P.
, van Duijn, I., Maheshwari, A. & Smid, M. (2017).
Faster algorithms for the minimum red-blue-purple spanning graph problem.
Journal of Graph Algorithms and Applications,
21(4), 527-546.
https://doi.org/10.7155/jgaa.00427
Bilstrup, K. E. K., Kaspersen, M. H., Assent, I., Enni, S. & Petersen, M. G. (2022).
From Demo to Design in Teaching Machine Learning. I
Proceedings of the 5th ACM Conference on Fairness, Accountability, and Transparency, FAccT 2022 (s. 2168-2178). Association for Computing Machinery.
https://doi.org/10.1145/3531146.3534634
Bilstrup, K.-E. K., Kaspersen, M. H., Lunding, M. S., Schaper, M.-M. A., Van Mechelen, M., Tamashiro, M. A., Smith, R. C., Iversen, O. S. & Petersen, M. G. (2022).
Supporting Critical Data Literacy in K-9 Education: Three Principles for Enriching Pupils’ Relationship to Data. I
Proceedings of Interaction Design and Children, IDC 2022 (s. 225-236). Association for Computing Machinery.
https://doi.org/10.1145/3501712.3530783
Bilo, V.
, Caragiannis, I., Flammini, M., Igarashi, A., Monaco, G., Peters, D., Vinci, C. & Zwicker, W. (2022).
Almost envy-free allocations with connected bundles.
Games and Economic Behavior,
131, 197-221.
https://doi.org/10.1016/j.geb.2021.11.006
Billington, J.
, Christensen, S., Hee, K. V., Kindler, E., Kummer, O., Petrucci, L., Post, R., Stehno, C., Weber, M., Aalst, W. M. P. V. D. (red.) & Best, E. (red.) (2003).
The Petri Net Markup Language: Concepts, Technology, and Tools. I
Ikke angivet (2679 of Lecture Notes in Computer Science udg., s. 483-505). Springer.
Billington, J., Gallasch, G. E.
, Kristensen, L. M. & Mailund, T. (2004).
Exploiting Equivalence Reduction and the Sweep-Line Method for Detecting Terminal States.
I E E E Transactions on Systems, Man and Cybernetics, Part A: Systems & Humans,
34(1), 23-37.