Showing 241 - 260 results of 294 for search ' Schloss Dagstuhl', query time: 0.15s Refine Results
  1. 241
    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. 242
    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. 243
    Selective monitoring

    Selective monitoring by Grigore, R, Kiefer, S

    Published 2018
    “…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
    Conference item
  4. 244
    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
  5. 245
    Quasi−Weak Cost Automata: A New Variant of Weakness

    Quasi−Weak Cost Automata: A New Variant of Weakness by Kuperberg, D, Boom, M

    Published 2011
    “…Schloss Dagstuhl − Leibniz−Zentrum fuer Informatik…”
    Conference item
  6. 246
    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
  7. 247
    The Hairy Ball problem is PPAD-complete

    The Hairy Ball problem is PPAD-complete by Goldberg, P, Hollender, A

    Published 2019
    “…Schloss Dagstuhl: Leibniz-Zentrum fuer Informatik…”
    Conference item
  8. 248
    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
  9. 249
    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
  10. 250
    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
  11. 251
    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
  12. 252
    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
  13. 253
    Some formal structures in probability

    Some formal structures in probability by Staton, S

    Published 2021
    “…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
    Conference item
  14. 254
    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
  15. 255
    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
  16. 256
    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
  17. 257
    Deciding the weak definability of Büchi definable tree languages

    Deciding the weak definability of Büchi definable tree languages by Colcombet, T, Kuperberg, D, Löding, C, Boom, M

    Published 2013
    “…Schloss Dagstuhl − Leibniz−Zentrum fuer Informatik…”
    Conference item
  18. 258
    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
  19. 259
    Modularity of Erdos-Rényi random graphs

    Modularity of Erdos-Rényi random graphs by McDiarmid, C, Skerman, F

    Published 2018
    “…Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik…”
    Conference item
  20. 260
    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

Search Tools: