Showing 41 - 60 results of 294 for search ' Schloss Dagstuhl', query time: 0.09s Refine Results
  1. 41
    Linear-time model checking branching processes

    Linear-time model checking branching processes by Kiefer, SM, Semukhin, P, Widdershoven, C

    Published 2021
    “…Schloss Dagstuhl…”
    Conference item
  2. 42
    On the complexity of value iteration

    On the complexity of value iteration by Balaji, N, Kiefer, S, Novotny, P, Perez, G, Shirmohammadi, M

    Published 2019
    “…Schloss Dagstuhl…”
    Conference item
  3. 43
    Hierarchical cost-parity games

    Hierarchical cost-parity games by Bozzelli, L, Murano, A, Perelli, G, Sorrentino, L

    Published 2017
    “…Schloss Dagstuhl…”
    Conference item
  4. 44
    The taming of the semi-linear set

    The taming of the semi-linear set by Chistikov, D, Haase, C

    Published 2016
    “…Schloss Dagstuhl…”
    Conference item
  5. 45
    Model checking and strategy synthesis for stochastic games: from theory to practice

    Model checking and strategy synthesis for stochastic games: from theory to practice by Kwiatkowska, M

    Published 2016
    “…Schloss Dagstuhl…”
    Conference item
  6. 46
    On restricted nonnegative matrix factorization

    On restricted nonnegative matrix factorization by Kiefer, S, Chistikov, D, Marusic, I, Shirmohammadi, M, Worrell, J

    Published 2016
    “…Schloss Dagstuhl…”
    Conference item
  7. 47
    On sampling from Ising models with spectral constraints

    On sampling from Ising models with spectral constraints by Galanis, A, Kalavasis, A, Kandiros, AV

    Published 2024
    “…Schloss Dagstuhl…”
    Conference item
  8. 48
    A modal logic for subject-oriented spatial reasoning

    A modal logic for subject-oriented spatial reasoning by Wałęga, PA, Zawidzki, M

    Published 2019
    “…Schloss Dagstuhl…”
    Conference item
  9. 49
    From normal functors to logarithmic space queries

    From normal functors to logarithmic space queries by Nguyên, L, Pradic, P

    Published 2019
    “…Schloss Dagstuhl…”
    Conference item
  10. 50
    Globular: an online proof assistant for higher-dimensional rewriting

    Globular: an online proof assistant for higher-dimensional rewriting by Vicary, J, Kissinger, A, Bar, K

    Published 2016
    “…Schloss Dagstuhl…”
    Conference item
  11. 51
    On computing the total variation distance of hidden Markov models

    On computing the total variation distance of hidden Markov models by Kiefer, S

    Published 2018
    “…Schloss Dagstuhl…”
    Conference item
  12. 52
    Strategy complexity of parity objectives in countable MDPs

    Strategy complexity of parity objectives in countable MDPs by Kiefer, S, Mayr, R, Shirmohammadi, M, Totzke, P

    Published 2020
    “…Schloss Dagstuhl…”
    Conference item
  13. 53
    Polynomial-time equivalence testing for deterministic fresh-register automata

    Polynomial-time equivalence testing for deterministic fresh-register automata by Murawski, A, Ramsay, S, Tzevelekos, N

    Published 2018
    “…Schloss Dagstuhl…”
    Conference item
  14. 54
    Effective divergence analysis for linear recurrence sequences

    Effective divergence analysis for linear recurrence sequences by Almagor, S, Chapman, B, Hosseini, M, Ouaknine, J, Worrell, J

    Published 2018
    “…Schloss Dagstuhl…”
    Conference item
  15. 55
    Custom hypergraph categories via generalized relations

    Custom hypergraph categories via generalized relations by Marsden, D, Genovese, F

    Published 2017
    “…Schloss Dagstuhl…”
    Conference item
  16. 56
    Parity helps to compute majority

    Parity helps to compute majority by Oliveira, I, Santhanam, R, Srinivasan, S

    Published 2019
    “…Schloss Dagstuhl…”
    Conference item
  17. 57
    Towards a unified complexity theory of total functions

    Towards a unified complexity theory of total functions by Goldberg, P, Papadimitriou, C

    Published 2018
    “…Schloss Dagstuhl…”
    Conference item
  18. 58
    Binding forms in first-order logic

    Binding forms in first-order logic by Mogavero, F, Perelli, G

    Published 2015
    “…Schloss Dagstuhl…”
    Conference item
  19. 59
    Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness

    Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness by Oliveira, I, Santhanam, R

    Published 2017
    “…Schloss Dagstuhl…”
    Conference item
  20. 60
    Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs

    Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs by Bell, PC, Semukhin, P

    Published 2020
    “…Schloss Dagstuhl…”
    Conference item

Search Tools: