On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximating the number of zeroes of a GF[2] polynomial
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Counting curves and their projections
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing shift-equivalence of polynomials using quantum machines
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Static and dynamic evaluation of QoS properties
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Propagating distributions up directed acyclic graphs
Neural Computation
Implementing a fully polynomial time approximation scheme for all terminal network reliability
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Testable algorithms for self-avoiding walks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximating Probabilistic Inference in Bayesian Belief Networks
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Self-Testing/Correcting Protocols (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Towards ambitious approximation algorithms in stubborn set optimization
Fundamenta Informaticae - Concurrency specification and programming
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
Combinatorics, Probability and Computing
SVM-based generalized multiple-instance learning via approximate box counting
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Approximate Counting and Quantum Computation
Combinatorics, Probability and Computing
Uniform random sampling of traces in very large models
Proceedings of the 1st international workshop on Random testing
Compression of samplable sources
Computational Complexity
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Query efficiency in probabilistic XML models
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A genetic algorithm for joint replenishment based on the exact inventory cost
Computers and Operations Research
The Most Reliable Subgraph Problem
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Conditioning probabilistic databases
Proceedings of the VLDB Endowment
Modeling and querying probabilistic XML data
ACM SIGMOD Record
On Query Algebras for Probabilistic Databases
ACM SIGMOD Record
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Approximating the number of frequent sets in dense data
Knowledge and Information Systems
Probabilistic Verification and Approximation
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
GRN model of probabilistic databases: construction, transition and querying
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient traffic loss evaluation for transport backbone networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of the ACM (JACM)
Modeling and querying probabilistic RDFS data sets with correlated triples
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Direct local pattern sampling by efficient two-step random procedures
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
SPARQL query answering with RDFS reasoning on correlated probabilistic data
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Optimal Monte Carlo estimation of belief network inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Bounded rational search for on-the-fly model checking of LTL properties
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Approximating the statistics of various properties in randomly weighted graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Transaction databases, frequent itemsets, and their condensed representations
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
An efficient Monte-Carlo algorithm for pricing combinatorial prediction markets for tournaments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Tests for Permutation Functions
Finite Fields and Their Applications
Towards Ambitious Approximation Algorithms in Stubborn Set Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
A randomized approximation algorithm for parameterized 3-D matching counting problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Demonstrating ProApproX 2.0: a predictive query engine for probabilistic XML
Proceedings of the 21st ACM international conference on Information and knowledge management
A top-k filter for logic-based similarity conditions on probabilistic databases
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Information Processing Letters
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |