Showing 1 - 20 results of 83 for search 'Schloss Dagstuhl - Leibniz-Zentrum für Informatik', query time: 0.40s Refine Results
  1. 1
    Counting induced subgraphs: an algebraic approach to #W[1]-hardness

    Counting induced subgraphs: an algebraic approach to #W[1]-hardness by Dörfler, J, Roth, M, Schmitt, J, Wellnitz, P

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  2. 2
    Two variable logic with ultimately periodic counting

    Two variable logic with ultimately periodic counting by Benedikt, M, Kostylev, EV, Tan, T

    Published 2020
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  3. 3
    Better bounds for online line chasing

    Better bounds for online line chasing by Bienkowski, M, Byrka, J, Chrobak, M, Coester, C, Jeż, Ł, Koutsoupias, E

    Published 2019
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  4. 4
    Improved strong spatial mixing for colorings on trees

    Improved strong spatial mixing for colorings on trees by Efthymiou, C, Galanis, A, Hayes, T, Štefankovič, D, Vigoda, E

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  5. 5
    Counting induced subgraphs: a topological approach to #W[1]-hardness

    Counting induced subgraphs: a topological approach to #W[1]-hardness by Roth, M, Schmitt, J

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  6. 6
    Equivalence of hidden Markov models with continuous observations

    Equivalence of hidden Markov models with continuous observations by Darwin, O, Kiefer, SM

    Published 2020
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  7. 7
    Probabilistic automata of bounded ambiguity

    Probabilistic automata of bounded ambiguity by Fijalkow, N, Riveros, C, Worrell, J

    Published 2017
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  8. 8
    The difference λ-calculus: a language for difference categories

    The difference λ-calculus: a language for difference categories by Alvarez-Picallo, M, Ong, CL

    Published 2020
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  9. 9
    Design-by-contract for flexible multiparty session protocols

    Design-by-contract for flexible multiparty session protocols by Gheri, L, Lanese, I, Sayers, N, Tuosto, E, Yoshida, N

    Published 2022
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  10. 10
    Automatically discovering and learning new visual categories with ranking statistics

    Automatically discovering and learning new visual categories with ranking statistics by Han, K, Rebuffi, SA, Ehrhardt, S, Vedaldi, A, Zisserman, A

    Published 2020
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  11. 11
    Fearless asynchronous communications with timed multiparty session protocols

    Fearless asynchronous communications with timed multiparty session protocols by Hou, P, Lagaillardie, N, Yoshida, N

    Published 2024
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  12. 12
    Complexity of repair checking and consistent query answering

    Complexity of repair checking and consistent query answering by Arming, S, Pichler, R, Sallinger, E

    Published 2016
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  13. 13
    Strategy synthesis for partially observable stochastic games with neural perception mechanisms

    Strategy synthesis for partially observable stochastic games with neural perception mechanisms by Kwiatkowska, M

    Published 2024
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  14. 14
    Logic of local inference for contextuality in quantum physics and beyond

    Logic of local inference for contextuality in quantum physics and beyond by Kishida, K

    Published 2016
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  15. 15
    Bounding the escape time of a linear dynamical system over a compact semialgebraic set

    Bounding the escape time of a linear dynamical system over a compact semialgebraic set by D'Costa, J, Lefaucheux, E, Neumann, E, Ouaknine, J, Worrell, J

    Published 2022
    “… Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  16. 16
    Unfolding-based partial order reduction

    Unfolding-based partial order reduction by Rodríguez, C, Sousa, M, Sharma, S, Kroening, D

    Published 2015
    “…Schloss Dagstuhl - Leibniz-Zentrum fur Informatik…”
    Journal article
  17. 17
    A dichotomy for homomorphism−closed queries on probabilistic graphs

    A dichotomy for homomorphism−closed queries on probabilistic graphs by Amarilli, A, Ceylan, II

    Published 2020
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  18. 18
    Counting edge-injective homomorphisms and matchings on restricted graph classes

    Counting edge-injective homomorphisms and matchings on restricted graph classes by Curticapean, R, Dell, H, Roth, M

    Published 2017
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  19. 19
    A universal Skolem set of positive lower density

    A universal Skolem set of positive lower density by Luca, F, Ouaknine, J, Worrell, J

    Published 2022
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  20. 20
    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

Search Tools: