Alfons Laarman
Associate professor
- Name
- Dr. A.W. Laarman
- Telephone
- +31 71 527 5775
- a.w.laarman@liacs.leidenuniv.nl
- ORCID iD
- 0000-0002-2433-4174
Alfons Laarman is an associate professor at LIACS, the Computer Science department of Leiden University.
More information about Alfons Laarman
PhD candidates
News
-
Fifteen lecturers gain Senior Teaching Qualification -
Leiden quantum technology research very successful in funding call -
Students build software for real customers -
Towards relevant quantum computers -
NWA grants for interdisciplinary consortia -
LIACS part of European consortium to boost industrial quantum computing
See also
External PhD candidate
Alfons Laarman leads the system verification lab and is a co-founding member of the inter-departmental applied quantum algorithms (aQa) initiative. His research interests span automated reasoning, formal methods, parallel computing and quantum computing.
Associate professor
- Science
- Leiden Inst of Advanced Computer Science
- Thanos D., Coopmans T.J. & Laarman A.W. (2023), Fast equivalence checking of quantum circuits of Clifford gates. André E. & Sun J. (Eds.), Automated Technology for Verification and Analysis. 21st International Symposium, ATVA 2023 24 October 2023 - 27 October 2023. Lecture Notes in Computer Science no. 14216. Cham: Springer. 199-216.
- Rennela M., Brand S., Laarman A. & Dunjko V. (2023), Hybrid divide-and-conquer approach for tree search algorithms, Quantum 7: 959.
- Brand S.O., Bäck T.H.W. & Laarman A.W. (2023), A decision diagram operation for reachability. Chechik M., Katoen J.P. & Leucker M. (Eds.), Formal methods: 25th International Symposium, FM 2023, Lübeck, Germany, March 6–10, 2023, Proceedings. International Symposium on Formal Methods, 2023 7 March 2023 - 9 March 2023. Lecture Notes in Computer Science no. 14000. Cham: Springer. 514-532.
- Quist A. & Laarman A.W. (2023), Optimizing quantum space using spooky pebble games. Kutrib M. & Meyer U. (Eds.), Reversible Computation RC 2023. Interrnational Conference on Reversible Computation RC 2023: Reversible Computation 18 July 2023 - 19 July 2023. Lecture Notes in Engineering and Computer Science no. 13960. Cham: Springer. 134-149.
- Vinkhuijzen L.T., Grurl T., Hillmich S., Brand S.O., Wille R. & Laarman A.W. (2023), Efficient Implementation of LIMDDs for Quantum Circuit Simulation. Caltais G. & Schilling C. (Eds.), Model Checking Software. SPIN 2023. Model Checking Software. SPIN 2023 26 April 2023 - 27 April 2023. Lecture Notes in Computer Science no. 13872. Cham: Springer. 3-21.
- Vinkhuijzen L.T., Coopmans T.J., Elkouss D., Dunjko V. & Laarman A.W. (2023), LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States, Quantum 7: 1108.
- Dal G.H., Laarman A.W. & Lucas P.J.F. (2018), Parallel Probabilistic Inference by Weighted Model Counting, Proceedings of the Ninth International Conference on Probabilistic Graphical Models. The 9th International Conference on Probabilistic Graphical Models (PGM 2018) 11 September 2018 - 14 September 2018 no. Proceedings of Machine Learning Research 72 97-108.
- Laarman A.W. (2018), Optimal Storage of Combinatorial State Spaces. Dutle A., Munoz C. & Narkawicz A. (Eds.), NASA Formal Methods 10th International Symposium, NFM 2018, Newport News, VA, USA, April 17-19, 2018, Proceedings. NASA Formal Methods 10th International Symposium, NFM 2018 17 April 2018 - 19 April 2018 no. Lecture Notes in Computer Science, volume 10811. Cham: Springer. 261-279.
- Laarman A.W. (2018), Stubborn Transaction Reduction. Dutle A., Munoz C. & Narkawicz A. (Eds.), NASA Formal Methods 10th International Symposium, NFM 2018, Newport News, VA, USA, April 17-19, 2018, Proceedings. NASA Formal Methods 10th International Symposium, NFM 2018 17 April 2018 - 19 April 2018 no. Lecture Notes in Computer Science, volume 10811. Cham: Springer. 280-298.
- Barnat J., Bloemen V., Duret-Lutz A., Laarman A.W., Petrucci L., Pol J. van de & Renault E. (2018), Parallel Model Checking Algorithms for Linear-Time Temporal Logic. In: Hamadi Y. & Sais L. (Eds.), Handbook of Parallel Constraint Reasoning. Cham: Springer. 457-507.