Sciweavers

197 search results - page 1 / 40
» Circuits, Pebbling and Expressibility
Sort
View
COCO
1990
Springer
71views Algorithms» more  COCO 1990»
13 years 9 months ago
Circuits, Pebbling and Expressibility
V. Vinay, H. Venkateswaran, C. E. Veni Madhavan
AAAI
2000
13 years 7 months ago
A Game-Theoretic Approach to Constraint Satisfaction
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
Phokion G. Kolaitis, Moshe Y. Vardi
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 5 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
LATIN
2010
Springer
14 years 11 days ago
The Size and Depth of Layered Boolean Circuits
We consider the relationship between size and depth for layered Boolean circuits, synchronous circuits and planar circuits as well as classes of circuits with small separators. In ...
Anna Gál, Jing-Tang Jang
LICS
2005
IEEE
13 years 11 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx