Sciweavers

2150 search results - page 132 / 430
» On a restricted cross-intersection problem
Sort
View
127
Voted
PODS
2001
ACM
85views Database» more  PODS 2001»
16 years 5 months ago
On XML Integrity Constraints in the Presence of DTDs
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
Wenfei Fan, Leonid Libkin
OOPSLA
2009
Springer
15 years 11 months ago
CZ: multiple inheritance without diamonds
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
Donna Malayeri, Jonathan Aldrich
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
15 years 11 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
15 years 11 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
138
Voted
FCT
2005
Springer
15 years 10 months ago
Leftist Grammars and the Chomsky Hierarchy
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
Tomasz Jurdzinski, Krzysztof Lorys