Publications

 
   2025   |   2024   |   2023   |   2022   |   2021   |   2020   |   2019   |   2018   |   2017   |   2016   
  • The weak call-by-value λ-calculus is reasonable for both time and space
    Forster Y, Kunze F and Roth M
    Proceedings of The Acm on Programming Languages, Association For Computing Machinery (Acm) vol. 4 (POPL), 1-23.  
    20-12-2019
  • Deriving Logical Relations from Interpretations of Predicate Logic
    Hermida C, Reddy US and Robinson EP
    Electronic Notes in Theoretical Computer Science, Elsevier vol. 347, 241-259.  
    01-11-2019
  • Channel Ordering and Supermodularity
    Américo A, Malacaria P and Khouzani M
    2019 IEEE Information Theory Workshop (ITW). vol. 00, 1-5.  
    28-08-2019
  • Counting induced subgraphs: An algebraic approach to #W[1]-hardness
    Dörfler J, Roth M, Schmitt J and Wellnitz P
    Leibniz International Proceedings in Informatics, LIPIcs. vol. 138 
    01-08-2019
  • Counting answers to existential questions
    Dell H, Roth M and Wellnitz P
    Leibniz International Proceedings in Informatics, LIPIcs. vol. 132 
    01-07-2019
  • Deterministic Channel Design for Minimum Leakage
    Américo A, Khouzani M and Malacaria P
    , Institute of Electrical and Electronics Engineers (Ieee) vol. 00, 428-441.  
    25-06-2019
  • Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
    Khouzani MHR, Liu Z and Malacaria P
    European Journal of Operational Research, Elsevier Bv 
    29-04-2019
  • Generalized Entropies and Metric-Invariant Optimal Countermeasures for Information Leakage Under Symmetric Constraints.
    Khouzani MHR and Malacaria P
    Ieee Trans. Inf. Theory vol. 65, 888-901.  
    01-02-2019
  • Distributed programming using role-parametric session types in go: statically-typed endpoint APIs for dynamically-instantiated communication structures
    Castro D, Hu R, Jongmans S-S, Ng N and Yoshida N
    Proceedings of The Acm on Programming Languages, Association For Computing Machinery (Acm) vol. 3 (POPL), 1-30.  
    02-01-2019
  • Counting induced subgraphs: A topological approach to #W[1]-hardness
    Roth M and Schmitt J
    Leibniz International Proceedings in Informatics, LIPIcs. vol. 115 
    01-01-2019
  • Channel Ordering and Supermodularity
    Americo A, Malacaria P and Khouzani MHR
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW)., 674-678.  
    01-01-2019