Random generation of combinatorial structures from a uniform
Theoretical Computer Science
On generating all maximal independent sets
Information Processing Letters
Probabilistic quantifiers and games
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Approximating probabilistic inference in Bayesian belief networks is NP-hard
Artificial Intelligence
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
On the complexity of database queries
Journal of Computer and System Sciences
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
ICDT '03 Proceedings of the 9th International Conference on Database Theory
A Probabilistic XML Approach to Data Integration
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Full disjunctions: polynomial-delay iterators in action
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The dichotomy of conjunctive queries on probabilistic structures
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Maximally joining probabilistic data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
ProTDB: probabilistic data in XML
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Databases with uncertainty and lineage
The VLDB Journal — The International Journal on Very Large Data Bases
Query efficiency in probabilistic XML models
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Incorporating constraints in probabilistic XML
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient evaluation of HAVING queries on a probabilistic database
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Querying and updating probabilistic information in XML
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Parameterized Complexity
E = MC3: managing uncertain enterprise data in a cluster-computing environment
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Certain answers for XML queries
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Boosting twig joins in probabilistic XML
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
On the complexity of query answering over incomplete XML documents
Proceedings of the 15th International Conference on Database Theory
Uncertain version control in open collaborative editing of tree-structured documents
Proceedings of the 2013 ACM symposium on Document engineering
| Hi-index | 0.00 |