Showing 21 - 40 results of 84 for search 'Leibniz−Zentrum für Informatik', query time: 0.27s Refine Results
  1. 21
    The complexity of promise SAT on non-Boolean domains

    The complexity of promise SAT on non-Boolean domains by Brandts, A, Wrochna, M, Živný, S

    Published 2020
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  2. 22
    Metastability of the Potts ferromagnet on random regular graphs

    Metastability of the Potts ferromagnet on random regular graphs by Coja-Oghlan, A, Galanis, A, Goldberg, LA, Ravelomanana, JB, Stefankovic, D, Vigoda, E

    Published 2022
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  3. 23
    Complexity of restricted variants of Skolem and related problems

    Complexity of restricted variants of Skolem and related problems by Akshay, S, Balaji, N, Vyas, N

    Published 2017
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  4. 24
    On the pseudo-deterministic query complexity of NP search problems

    On the pseudo-deterministic query complexity of NP search problems by Goldwasser, S, Impagliazzo, R, Pitassi, T, Santhanam, R

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik …”
    Conference item
  5. 25
    The complexity of Presburger arithmetic with power or powers

    The complexity of Presburger arithmetic with power or powers by Benedikt, M, Chistikov, D, Mansutti, A

    Published 2023
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  6. 26
    Behavioural up/down casting for statically typed languages

    Behavioural up/down casting for statically typed languages by Bacchiani, L, Bravetti, M, Giunti, M, Mota, J, Ravara, A

    Published 2024
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  7. 27
    Metrical service systems with transformations

    Metrical service systems with transformations by Bubeck, S, Buchbinder, N, Coester, C, Sellke, M

    Published 2021
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  8. 28
    Generalised multiparty session types with crash-stop failures

    Generalised multiparty session types with crash-stop failures by Barwell, AD, Scalas, A, Yoshida, N, Zhou, F

    Published 2022
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  9. 29
    On reachability problems for low-dimensional matrix semigroups

    On reachability problems for low-dimensional matrix semigroups by Colcombet, T, Ouaknine, J, Semukhin, P, Worrell, J

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  10. 30
    Digital palaeography: New machines and old texts (Dagstuhl seminar 14302)

    Digital palaeography: New machines and old texts (Dagstuhl seminar 14302) by Hassner, T, Sablatnig, R, Stutzmann, D, Tarte, S

    Published 2014
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Journal article
  11. 31
    Recursion and sequentiality in categories of sheaves

    Recursion and sequentiality in categories of sheaves by Matache, C, Moss, S, Staton, S

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  12. 32
    On deciding linear arithmetic constraints over -adic integers for all primes

    On deciding linear arithmetic constraints over -adic integers for all primes by Haase, C, Mansutti, A

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  13. 33
    Comparing labelled Markov decision processes

    Comparing labelled Markov decision processes by Kiefer, S, Tang, Q

    Published 2020
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  14. 34
    Parameterized (modular) counting and Cayley graph expanders

    Parameterized (modular) counting and Cayley graph expanders by Peyerimhoff, N, Roth, M, Schmitt, J, Stix, J, Vdovina, A

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  15. 35
    A relativization perspective on meta-complexity

    A relativization perspective on meta-complexity by Ren, H, Santhanam, R

    Published 2022
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  16. 36
    Counting subgraphs in somewhere dense graphs

    Counting subgraphs in somewhere dense graphs by Bressan, M, Goldberg, LA, Meeks, K, Roth, M

    Published 2023
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  17. 37
    Termination of linear loops over the integers

    Termination of linear loops over the integers by Hosseini, M, Ouaknine, J, Worrell, J

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  18. 38
    When is containment decidable for probabilistic automata?

    When is containment decidable for probabilistic automata? by Daviaud, L, Jurdziński, M, Lazić, R, Mazowiecki, F, Pérez, G, Worrell, J

    Published 2018
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  19. 39
    Probabilistic model checking for strategic equilibria-based decision making: advances and challenges

    Probabilistic model checking for strategic equilibria-based decision making: advances and challenges by Kwiatkowska, M, Norman, G, Parker, D, Santos, G, Yan, R

    Published 2022
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  20. 40
    On the Skolem Problem for continuous linear dynamical systems

    On the Skolem Problem for continuous linear dynamical systems by Ouaknine, J, Worrell, J, Chonev, V

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

Search Tools: