Volume 56, Issue 1. January 2015. Approximation and Online Algorithms. Issue Editors: Roberto Solis-Oba,; Giuseppe Persiano,; Thomas Erlebach, ...
Volume 56, Number 1, January 2015. Approximation and Online Algorithms.
scholar.google.com › citations
Volume 56, Issue 2 · On the Turing Completeness of the Semantic Web · Rent or Buy Problems with a Fixed Time Horizon · New Results on Polynomial ...
Apr 1, 2015 · In this article, it is shown that there is much more structure to trivial computable measures than has been previously suspected.
Bibliographic content of Theoretical Computer Science, Volume 56.
We study the online strip packing problem and derive an improved lower bound of 2.589 for the competitive ratio of this problem.
Volume 56, Issue 2 · Pages 155-251 (February 1988) · C-tree systolic automata · A natural semantics for modal logic over databases · On the computational complexity ...
Missing: Theory | Show results with:Theory
Publication. Theory of Computing Systems , Volume 56 - Issue 2 p. 372- 393. Additional Metadata. Keywords, Computational complexity, Knapsack problem, Subset ...
All journal articles featured in Journal of Computer Information Systems vol 56 issue 4.
Missing: Theory | Show results with:Theory
Sep 27, 2001 · This volume collects up-to-date applications of the theory of association schemes to coding and presents new properties of both polynomial and general ...