| Delayed sampling and automatic Rao-Blackwellization of probabilistic programs L Murray, D Lundén, J Kudlicka, D Broman, T Schön International Conference on Artificial Intelligence and Statistics, 1037-1046, 2018 | 43 | 2018 |
| Universal probabilistic programming offers a powerful approach to statistical phylogenetics F Ronquist, J Kudlicka, V Senderov, J Borgström, N Lartillot, D Lundén, ... Communications biology 4 (1), 1-10, 2021 | 13 | 2021 |
| Delayed sampling in the probabilistic programming language Anglican D Lundén | 6 | 2017 |
| Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages. D Lundén, J Borgström, D Broman ESOP, 404-431, 2021 | 4 | 2021 |
| Automatic alignment of Sequential Monte Carlo inference in higher-order probabilistic programs D Lundén, D Broman, F Ronquist, LM Murray arXiv preprint arXiv:1812.07439, 2018 | 4 | 2018 |
| Probabilistic programming: a powerful new approach to statistical phylogenetics F Ronquist, J Kudlicka, V Senderov, J Borgström, N Lartillot, D Lundén, ... | 3 | 2020 |
| Publisher Correction: Universal probabilistic programming offers a powerful approach to statistical phylogenetics F Ronquist, J Kudlicka, V Senderov, J Borgström, N Lartillot, D Lundén, ... Communications Biology 4 (1), 1-1, 2021 | 1 | 2021 |
| Combining static and dynamic optimizations using closed-form solutions D Lundén, D Broman, LM Murray Proceedings of the Workshop on Probabilistic Programming Semantics (PPS) 3, 2018 | 1 | 2018 |
| Factoring integers with parallel SAT solvers D Lundén, E Forsblom | 1 | 2015 |
| Compiling Universal Probabilistic Programming Languages with Efficient Parallel Sequential Monte Carlo Inference. D Lundén, J Öhman, J Kudlicka, V Senderov, F Ronquist, D Broman ESOP, 29-56, 2022 | | 2022 |
| Universal Probabilistic Programming Language Compilation with Parallel Efficient Sequential Monte Carlo Inference D Lundén, J Öhman, J Kudlicka, V Senderov, F Ronquist, D Broman arXiv preprint arXiv:2112.00364, 2021 | | 2021 |
| Compilation of Universal Probabilistic Programs to GPGPUs D Lundén, J Öhman, D Broman | | |
| Automatic Discovery of Static Structures in Probabilistic Programs D Lundén, D Broman, F Ronquist, LM Murray | | |
| Fördröjd provtagning i det probabilistiska programmeringssprĺket Anglican D Lundén | | |
David BromanKTH Royal Institute of TechnologyVerified email at kth.se
