Showing 61 - 80 results of 84 for search 'Leibniz−Zentrum für Informatik', query time: 0.11s Refine Results
  1. 61
    Beyond PCSP(1-in-3,NAE)

    Beyond PCSP(1-in-3,NAE) by Brandts, A, Živný, S

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik …”
    Conference item
  2. 62
    Approximation via correlation decay when strong spatial mixing fails

    Approximation via correlation decay when strong spatial mixing fails by Bezakova, I, Galanis, A, Goldberg, L, Guo, H, Stefankovic, D

    Published 2016
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  3. 63
    Sparsification of Binary CSPs

    Sparsification of Binary CSPs by Butti, S, Zivny, S

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  4. 64
    On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond

    On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond by Bell, P, Potapov, I, Semukhin, P

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum fur Informatik…”
    Conference item
  5. 65
    Refinements for multiparty message-passing protocols: specification-agnostic theory and implementation

    Refinements for multiparty message-passing protocols: specification-agnostic theory and implementation by Vassor, M, Yoshida, N

    Published 2024
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  6. 66
    The pseudo-Skolem Problem is decidable

    The pseudo-Skolem Problem is decidable by D'Costa, J, Karimov, T, Majumdar, R, Ouaknine, J, Salamati, M, Soudjani, S, Worrell, J

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  7. 67
    Bayesian Inversion by ω-complete cone duality

    Bayesian Inversion by ω-complete cone duality by Dahlqvist, F, Danos, V, Garnier, I, Kammar, O

    Published 2016
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  8. 68
    Carpooling in social networks

    Carpooling in social networks by Fiat, A, Karlin, A, Koutsoupias, E, Mathieu, C, Zach, R

    Published 2016
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  9. 69
    Beyond boolean surjective VCSPs

    Beyond boolean surjective VCSPs by Matl, G, Zivny, S

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  10. 70
    On transcendence of numbers related to Sturmian and Arnoux-Rauzy words

    On transcendence of numbers related to Sturmian and Arnoux-Rauzy words by Kebis, P, Luca, F, Ouaknine, J, Scoones, A, Worrell, J

    Published 2024
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  11. 71
    Quantitative foundations for resource theories

    Quantitative foundations for resource theories by Marsden, DG, Maaike, M

    Published 2018
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  12. 72
    On the size of finite rational matrix semigroups

    On the size of finite rational matrix semigroups by Bumpus, G, Haase, C, Kiefer, S, Stoienescu, P-I, Tanner, J

    Published 2020
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  13. 73
    On positivity and minimality for second-order holonomic sequences

    On positivity and minimality for second-order holonomic sequences by Kenison, G, Klurman, O, Lefaucheux, E, Luca, F, Moree, P, Ouaknine, J, Whiteland, MA, Worrell, J

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  14. 74
    Solving promise equations over monoids and groups

    Solving promise equations over monoids and groups by Larrauri, A, Živný, S

    Published 2024
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  15. 75
    Monadic decomposabily of regular relations

    Monadic decomposabily of regular relations by Barceló, P, Hong, C-D, Le, XB, Lin, A, Niskanen, R

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  16. 76
    Skolem meets Schanuel

    Skolem meets Schanuel by Bilu, Y, Luca, F, Nieuwveld, J, Ouaknine, J, Purser, D, Worrell, J

    Published 2022
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  17. 77
    Fearless asynchronous communications with timed session types in Rust (artifact)

    Fearless asynchronous communications with timed session types in Rust (artifact) by Lagaillardie, N, Hou, P, Yoshida, N

    Published 2024
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  18. 78
    The pseudo-reachability problem for diagonalisable linear dynamical systems

    The pseudo-reachability problem for diagonalisable linear dynamical systems by D'Costa, J, Karimov, T, Majumdar, R, Ouaknine, J, Salamati, M, Worrell, J

    Published 2022
    “… Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  19. 79
    Finally, a polymorphic linear algebra language (Pearl)

    Finally, a polymorphic linear algebra language (Pearl) by Shaikhha, A, Parreaux, L

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  20. 80
    Dynamically updatable multiparty session protocols: generating concurrent go code from unbounded protocols

    Dynamically updatable multiparty session protocols: generating concurrent go code from unbounded protocols by Castro-Perez, D, Yoshida, N

    Published 2023
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik …”
    Conference item

Search Tools: