Search w/in this Title for Titles All Reviews
	Theory of Computing Systems Springer-Verlag         Options: Date Reviewed Title Author Publisher Published Date Descending Order Ascending Order     1-6 of 6 reviews Date Reviewed     Complexity and expressive power of weakly well-designed SPARQL Kaminski M., Kostylev E. Theory of Computing Systems 62(4): 772-809, 2018.  Type: Article The resource description framework (RDF) is a data model standard for the web that represents linked data as subject-predicate-object triples. Such triples can be naturally represented as labeled directed graphs. SPARQL is a query lang... Sep 10 2018   On the uniform computational content of computability theory Brattka V., Hendtlass M., Kreuzer A. Theory of Computing Systems 61(4): 1376-1426, 2017.  Type: Article Weihrauch reducibility (≤W) is a type of reducibility relation that can be used to classify the uniform computational content of various mathematical objects. It is first defined for multivalued functions between s... Jun 26 2018   The complexity of the list homomorphism problem for graphs Egri L., Krokhin A., Larose B., Tesson P. Theory of Computing Systems 51(2): 143-178, 2012.  Type: Article Homomorphisms are very useful in combinatorial problems in mapping and assignments. Homomorphism problems involve greater modeling power than graph coloring, yet compared to general constraint satisfaction problems (CSPs), they are sim... May 8 2013   Proofs, programs, processes Berger U., Seisenberger M. Theory of Computing Systems 51(3): 313-329, 2012.  Type: Article Ensuring that the implementation of a program meets its specification is one of the long-running goals of computer science. Approaches to the problem can be divided into two main branches: program verification and program generation. I... Nov 30 2012   Classification of computably approximable real numbers Zheng X. Theory of Computing Systems 43(3): 603-624, 2008.  Type: Article Real numbers can be represented mathematically in several equivalent ways, but these representations are not equivalent when they are used to compute real numbers and real functions. Although all representations yield computable real n... Jul 21 2009   The effect of faults on network expansion Bagchi A., Bhargava A., Chaudhary A., Eppstein D., Scheideler C. Theory of Computing Systems 39(6): 903-928, 2006.  Type: Article Faults are a normal aspect of network operations--indeed, they are commonplace and expected in mobile networks. The authors study the problem of how resilient networks are to node faults. They focus on how many faults a networ... Nov 13 2007       Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy