Showing 1 - 13 results of 13 for search 'Schloss Dagstuhl – Leibniz Center for Informatics', query time: 0.15s Refine Results
  1. 1
    Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion

    Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion by Harrow, Aram W.

    Published 2020
    “…Schloss Dagstuhl, Leibniz Center for Informatics…”
    Get full text
    Article
  2. 2
    Algorithms, bounds, and strategies for entangled XOR games

    Algorithms, bounds, and strategies for entangled XOR games by Watts, Adam Bene, Harrow, Aram W., Kanwar, Gurtej S.

    Published 2020
    “…Schloss Dagstuhl, Leibniz Center for Informatics…”
    Get full text
    Article
  3. 3
    Universal reconfiguration of facet-connected modular robots by pivots: The O(1) musketeers

    Universal reconfiguration of facet-connected modular robots by pivots: The O(1) musketeers by Demaine, Erik D

    Published 2020
    “…Schloss Dagstuhl, Leibniz Center for Informatics…”
    Get full text
    Article
  4. 4
    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
  5. 5
    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
  6. 6
    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
  7. 7
    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
  8. 8
    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
  9. 9
    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
  10. 10
    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
  11. 11
    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
  12. 12
    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
  13. 13
    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

Search Tools: