Showing 101 - 120 results of 294 for search ' Schloss Dagstuhl', query time: 0.10s Refine Results
  1. 101
    Tatamibari is NP-complete

    Tatamibari is NP-complete by Adler, Aviv, Bosboom, Jeffrey William, Demaine, Erik D, Demaine, Martin L, Liu, Quanquan C., Lynch, Jayson R.

    Published 2021
    “…Schloss Dagstuhl, Leibniz Center for Informatics…”
    Get full text
    Article
  2. 102
    1 × 1 rush hour with fixed blocks is PSPACE-complete

    1 × 1 rush hour with fixed blocks is PSPACE-complete by Brunner, Josh, Chung, Lily, Demaine, Erik D, Hendrickson, Dylan H., Hesterberg, Adam Classen, Zeff, Avi

    Published 2021
    “…Schloss Dagstuhl, Leibniz Center for Informatics…”
    Get full text
    Article
  3. 103
    Finding closed quasigeodesics on convex polyhedra

    Finding closed quasigeodesics on convex polyhedra by Demaine, Erik D, Hesterberg, Adam Classen, Ku, Jason S

    Published 2021
    “…Schloss Dagstuhl, Leibniz Center for Informatics…”
    Get full text
    Article
  4. 104
    Overparameterization: A connection between software 1.0 and software 2.0

    Overparameterization: A connection between software 1.0 and software 2.0 by Carbin, Michael James

    Published 2021
    “…Schloss Dagstuhl, Leibniz Center for Informatics…”
    Get full text
    Article
  5. 105
    Nonnegativity problems for matrix semigroups

    Nonnegativity problems for matrix semigroups by D'Costa, J, Ouaknine, J, Worrell, J

    Published 2024
    “…Schloss Dagstuhl – Leibniz Center for Informatics…”
    Conference item
  6. 106
    Model checking flat freeze LTL on one-counter automata

    Model checking flat freeze LTL on one-counter automata by Lechner, A, Mayr, R, Ouaknine, J, Pouly, A, Worrell, J

    Published 2016
    “…Schloss Dagstuhl – Leibniz Center for Informatics…”
    Conference item
  7. 107
    Minimum quantum resources for strong non-locality

    Minimum quantum resources for strong non-locality by Abramsky, S, Barbosa, R, Carù, G, De Silva, N, Kishida, K, Mansfield, S

    Published 2018
    “…Schloss Dagstuhl – Leibniz Center for Informatics…”
    Conference item
  8. 108
    On the skolem problem for continuous linear dynamical systems

    On the skolem problem for continuous linear dynamical systems by Chonev, V, Ouaknine, J, Worrell, J

    Published 2016
    “…Schloss Dagstuhl – Leibniz Center for Informatics…”
    Conference item
  9. 109
    Decision problems for second-order holonomic sequences

    Decision problems for second-order holonomic sequences by Neumann, E, Ouaknine, J, Worrell, J

    Published 2021
    “…Schloss Dagstuhl – Leibniz Center for Informatics…”
    Conference item
  10. 110
    Counting Homomorphisms to Square-Free Graphs, Modulo 2

    Counting Homomorphisms to Square-Free Graphs, Modulo 2 by Gobel, A, Goldberg, L, Richerby, D

    Published 2015
    “…Schloss Dagstuhl - LZI GmbH…”
    Conference item
  11. 111
    The quantum monad on relational structures

    The quantum monad on relational structures by Abramsky, S, Barbosa, RS, de Silva, N, Zapata, O

    Published 2017
    “…Schloss Dagstuhl – Leibniz Center for Informatics…”
    Conference item
  12. 112
    A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems

    A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems by Davis, Robert I., Cucu-Grosjean, Liliana

    Published 2019-05-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article
  13. 113
    A Survey of Probabilistic Timing Analysis Techniques for Real-Time Systems

    A Survey of Probabilistic Timing Analysis Techniques for Real-Time Systems by Davis, Robert I., Cucu-Grosjean, Liliana

    Published 2019-05-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article
  14. 114
    Programming Language Constructs Supporting Fault Tolerance

    Programming Language Constructs Supporting Fault Tolerance by Houben, Christina, Houben, Sebastian

    Published 2016-06-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article
  15. 115
    Computation Offloading for Frame-Based Real-Time Tasks under Given Server Response Time Guarantees

    Computation Offloading for Frame-Based Real-Time Tasks under Given Server Response Time Guarantees by Toma, Anas S. M., Chen, Jian-Jia

    Published 2014-09-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article
  16. 116
    Trust, Accountability, and Autonomy in Knowledge Graph-Based AI for Self-Determination

    Trust, Accountability, and Autonomy in Knowledge Graph-Based AI for Self-Determination by Ibáñez, Luis-Daniel, Domingue, John, Kirrane, Sabrina, Seneviratne, Oshani, Third, Aisling, Vidal, Maria-Esther

    Published 2023-12-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article
  17. 117
    Autonomy in the Age of Knowledge Graphs: Vision and Challenges

    Autonomy in the Age of Knowledge Graphs: Vision and Challenges by Calbimonte, Jean-Paul, Ciortea, Andrei, Kampik, Timotheus, Mayer, Simon, Payne, Terry R., Tamma, Valentina, Zimmermann, Antoine

    Published 2023-12-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article
  18. 118
    Foreword

    Foreword by Burns, Alan

    Published 2014-04-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article
  19. 119
    Foreword

    Foreword by Burns, Alan, Goddard, Steve

    Published 2021-08-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article
  20. 120
    Real-Time Scheduling on Uni- and Multiprocessors based on Priority Promotions

    Real-Time Scheduling on Uni- and Multiprocessors based on Priority Promotions by Pathan, Risat Mahmud

    Published 2016-06-01
    “…Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik…”
    Get full text
    Article

Search Tools: