1686 search results - page 8 / 338 » Programs as polygraphs: computability and complexity |
PPDP
2010
Springer
14 years 7 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
SP
2008
IEEE
14 years 9 months ago
2008
IEEE
f abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Resear...
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
DAGSTUHL
2006
14 years 11 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
102
click to vote
ORDER
2010
14 years 8 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...