Showing 1 - 20 results of 34 for search 'Schloss Dagstuhl,', query time: 1.99s Refine Results
  1. 1
    Local Algorithms for Sparse Spanning Graphs
    by Levi, Reut, Ron, Dana, Rubinfeld, Ronitt
    Published 2016
    “...Schloss Dagstuhl,...”
    Get fulltext
    Article
  2. 2
    Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
    “...Schloss Dagstuhl Publishing,...”
    Get fulltext
    Article
  3. 3
    Algorithms for Designing Pop-Up Cards
    “...Schloss Dagstuhl Publishing,...”
    Get fulltext
    Article
  4. 4
    Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM
    “...Schloss Dagstuhl Publishing,...”
    Get fulltext
    Article
  5. 5
    1 × 1 rush hour with fixed blocks is PSPACE-complete
    “...Schloss Dagstuhl, Leibniz Center for Informatics,...”
    Get fulltext
    Article
  6. 6
    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 fulltext
    Article
  7. 7
    Algorithms, bounds, and strategies for entangled XOR games
    “...Schloss Dagstuhl, Leibniz Center for Informatics,...”
    Get fulltext
    Article
  8. 8
    Overparameterization: A connection between software 1.0 and software 2.0
    by Carbin, Michael James
    Published 2021
    “...Schloss Dagstuhl, Leibniz Center for Informatics,...”
    Get fulltext
    Article
  9. 9
    Tatamibari is NP-complete
    “...Schloss Dagstuhl, Leibniz Center for Informatics,...”
    Get fulltext
    Article
  10. 10
    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 fulltext
    Article
  11. 11
    Finding closed quasigeodesics on convex polyhedra
    “...Schloss Dagstuhl, Leibniz Center for Informatics,...”
    Get fulltext
    Article
  12. 12
    Computation Offloading for Frame-Based Real-Time Tasks under Given Server Response Time Guarantees
    by Anas S. M. Toma, Jian-Jia Chen
    Published 2014-11-01
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
  13. 13
    Blocking Optimality in Distributed Real-Time Locking Protocols
    by Björn Bernhard Brandenburg
    Published 2014-09-01
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
  14. 14
    More General Optimal Offset Assignment
    by Sven Mallach
    Published 2015-06-01
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
  15. 15
    Randomized Caches Can Be Pretty Useful to Hard Real-Time Systems
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
  16. 16
    TLM.open: a SystemC/TLM Frontend for the CADP Verification Toolbox
    by Claude Helmstetter
    Published 2014-04-01
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
  17. 17
    Implementing Mixed-criticality Systems Upon a Preemptive Varying-speed Processor
    by Zhishan Guo, Sanjoy K. Baruah
    Published 2014-11-01
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
  18. 18
    Randomized Caches Considered Harmful in Hard Real-Time Systems
    by Jan Reineke
    Published 2014-06-01
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
  19. 19
    Foreword
    by Alan Burns
    Published 2014-06-01
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
  20. 20
    From Dataflow Specification to Multiprocessor Partitioned Time-triggered Real-time Implementation
    “...Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik...”
    Get full text
    Article
Search Tools: Get RSS Feed — Email this Search