Showing 1 - 20 results of 294 for search ' Schloss Dagstuhl', query time: 0.20s Refine Results
  1. 1
    Local Algorithms for Sparse Spanning Graphs

    Local Algorithms for Sparse Spanning Graphs by Levi, Reut, Ron, Dana, Rubinfeld, Ronitt

    Published 2016
    “…Schloss Dagstuhl…”
    Get full text
    Get full text
    Article
  2. 2
    Comparison-free polyregular functions

    Comparison-free polyregular functions by Nguyễn, LTD, Noûs, C, Pradic, P

    Published 2021
    “…Schloss Dagstuhl…”
    Conference item
  3. 3
    Minimising the probabilistic bisimilarity distance

    Minimising the probabilistic bisimilarity distance by Kiefer, S, Tang, Q

    Published 2024
    “…Schloss Dagstuhl…”
    Conference item
  4. 4
    Completeness of asynchronous session tree subtyping in Coq

    Completeness of asynchronous session tree subtyping in Coq by Yoshida, N, Ekici, B

    Published 2024
    “… Schloss Dagstuhl…”
    Conference item
  5. 5
    The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains

    The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains by Viola, C, Zivny, S

    Published 2020
    “…Schloss Dagstuhl…”
    Conference item
  6. 6
    Expressiveness and complexity results for strategic reasoning

    Expressiveness and complexity results for strategic reasoning by Gutierrez, J, Harrenstein, P, Wooldridge, M

    Published 2015
    “…Schloss Dagstuhl…”
    Conference item
  7. 7
    On the complexity of quantified integer programming

    On the complexity of quantified integer programming by Chistikov, D, Haase, C

    Published 2017
    “…Schloss Dagstuhl…”
    Conference item
  8. 8
    Med7: a transferable clinical natural language processing model for electronic health records

    Med7: a transferable clinical natural language processing model for electronic health records by Kormilitzin, A, Vaci, N, Liu, Q, Nevado-Holgado, A

    Published 2020
    “…Schloss Dagstuhl…”
    Journal article
  9. 9
    Boolean tensor decomposition for conjunctive queries with negation

    Boolean tensor decomposition for conjunctive queries with negation by Abo Khamis, M, Ngo, H, Olteanu, D, Suciu, D

    Published 2019
    “…Schloss Dagstuhl…”
    Conference item
  10. 10
    Hardness magnification near state-of-the-art lower bounds

    Hardness magnification near state-of-the-art lower bounds by Oliveira, I, Pich, J, Santhanam, R

    Published 2019
    “…Schloss Dagstuhl…”
    Conference item
  11. 11
    Covers of query results

    Covers of query results by Kara, A, Olteanu, D

    Published 2018
    “…Schloss Dagstuhl…”
    Conference item
  12. 12
    On the expressivity of linear recursion schemes

    On the expressivity of linear recursion schemes by Clairambault, P, Murawski, A

    Published 2019
    “…Schloss Dagstuhl…”
    Conference item
  13. 13
    Fast mixing via polymers for random graphs with unbounded degree

    Fast mixing via polymers for random graphs with unbounded degree by Galanis, A, Goldberg, L, Stewart, J

    Published 2021
    “…Schloss Dagstuhl…”
    Conference item
  14. 14
    SMT-based model checking of max-plus linear systems

    SMT-based model checking of max-plus linear systems by Mufid, MSU, Micheli, A, Abate, A, Cimatti, A

    Published 2021
    “…Schloss Dagstuhl…”
    Conference item
  15. 15
    Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem

    Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem by Fijalkow, N, Ohlmann, P, Ouaknine, J, Pouly, A, Worrell, J

    Published 2017
    “…Schloss Dagstuhl…”
    Journal article
  16. 16
    How large is your graph?

    How large is your graph? by Kanade, V, Mallmann-Trenn, F, Verdugo, V

    Published 2017
    “…Schloss Dagstuhl…”
    Conference item
  17. 17
    Invariants for continuous linear dynamical systems

    Invariants for continuous linear dynamical systems by Kelmendi, E, Ouaknine, J, Worrell, J, Almagor, S

    Published 2020
    “…Schloss Dagstuhl…”
    Conference item
  18. 18
    Beyond natural proofs: Hardness magnification and locality

    Beyond natural proofs: Hardness magnification and locality by Chen, L, Hirahara, S, Oliveira, IC, Pich, J, Rajgopal, N, Santhanam, R

    Published 2020
    “…Schloss Dagstuhl…”
    Conference item
  19. 19
    Arboreal categories and resources

    Arboreal categories and resources by Abramsky, S, Reggio, L

    Published 2021
    “…Schloss Dagstuhl…”
    Conference item
  20. 20
    Semialgebraic invariant synthesis for the Kannan-Lipton Orbit Problem

    Semialgebraic invariant synthesis for the Kannan-Lipton Orbit Problem by Fijalkow, N, Ohlmann, P, Ouaknine, J, Pouly, A, Worrell, J

    Published 2017
    “…Schloss Dagstuhl…”
    Conference item

Search Tools: