Showing 41 - 60 results of 84 for search 'Leibniz−Zentrum für Informatik', query time: 0.30s Refine Results
  1. 41
    Counting restricted homomorphisms via Möbius inversion over matroid lattices

    Counting restricted homomorphisms via Möbius inversion over matroid lattices by Roth, M

    Published 2017
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  2. 42
    On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets

    On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets by D'Costa, J, Lefaucheux, E, Neumann, E, Ouaknine, J, Worrell, J

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  3. 43
    Learning algorithms versus automatability of Frege systems

    Learning algorithms versus automatability of Frege systems by Pich, J, Santhanam, R

    Published 2022
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  4. 44
    A polynomial-time algorithm for reachability in branching VASS in dimension one

    A polynomial-time algorithm for reachability in branching VASS in dimension one by Göller, S, Haase, C, Lazic, R, Totzke, P

    Published 2016
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  5. 45
    Approximate counting CSP seen from the other side

    Approximate counting CSP seen from the other side by Bulatov, A, Zivny, S

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  6. 46
    The 2-dimensional constraint loop problem is decidable

    The 2-dimensional constraint loop problem is decidable by Guilmant, Q, Lefaucheux, E, Ouaknine, J, Worrell, J

    Published 2024
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  7. 47
    Consensus division in an arbitrary ratio

    Consensus division in an arbitrary ratio by Goldberg, P, Li, J

    Published 2023
    “… Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  8. 48
    Lower bounds for unambiguous automata via communication complexity

    Lower bounds for unambiguous automata via communication complexity by Göös, M, Kiefer, S, Yuan, W

    Published 2022
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  9. 49
    Hardness of KT characterizes parallel cryptography

    Hardness of KT characterizes parallel cryptography by Ren, H, Santhanam, R

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik …”
    Conference item
  10. 50
    Some formal structures in probability

    Some formal structures in probability by Staton, S

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  11. 51
    Counting Euler Tours in Undirected Bounded Treewidth Graphs

    Counting Euler Tours in Undirected Bounded Treewidth Graphs by Balaji, N, Datta, S, Ganesan, V

    Published 2015
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  12. 52
    Online metric allocation and time-varying regularization

    Online metric allocation and time-varying regularization by Bansal, N, Coester, C

    Published 2022
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  13. 53
    Asymmetric distances for approximate differential privacy

    Asymmetric distances for approximate differential privacy by Chistikov, D, Murawski, A, Purser, D

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  14. 54
    CONCUR Test-of-Time Award 2021

    CONCUR Test-of-Time Award 2021 by Bertrand, N, de Alfaro, L, van Glabbeek, R, Palamidessi, C, Yoshida, N

    Published 2021
    “… Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  15. 55
    Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques

    Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques by Kiefer, S, Widdershoven, C

    Published 2019
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  16. 56
    Detecting and counting small subgraphs, and evaluating a parametrized Tutte Polynomial: Lower bounds via toroidal grids and Cayley graph expanders

    Detecting and counting small subgraphs, and evaluating a parametrized Tutte Polynomial: Lower bounds via toroidal grids and Cayley graph expanders by Roth, M, Schmitt, J, Wellnitz, P

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  17. 57
    Parameterised and fine-grained subgraph counting, modulo 2

    Parameterised and fine-grained subgraph counting, modulo 2 by Goldberg, L, Roth, M

    Published 2023
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  18. 58
    A strongly polynomial-time algorithm for weighted general factors with three feasible degrees

    A strongly polynomial-time algorithm for weighted general factors with three feasible degrees by Shao, S, Zivny, S

    Published 2023
    “…Schloss-Dagstuhl - Leibniz Zentrum für Informatik…”
    Conference item
  19. 59
    Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications

    Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications by Baier, C, Funke, F, Jantsch, S, Karimov, T, Lefaucheux, E, Ouaknine, J, Purser, D, Whiteland, MA, Worrell, J

    Published 2022
    “…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
    Conference item
  20. 60
    From proof complexity to circuit complexity via interactive protocols

    From proof complexity to circuit complexity via interactive protocols by Arteche, N, Khaniki, E, Pich, J, Santhanam, R

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

Search Tools: