A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Counting linear extensions is #P-complete
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A polynomial time algorithm for Minkowski reconstruction
Proceedings of the eleventh annual symposium on Computational geometry
ICS '96 Proceedings of the 10th international conference on Supercomputing
Exact and approximate aggregation in constraint query languages
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximately counting Hamilton cycles in dense graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Evaluating multiple attribute items using queries
Proceedings of the 3rd ACM conference on Electronic Commerce
A Laplace transform algorithm for the volume of a convex polytope
Journal of the ACM (JACM)
Computational properties of metaquerying problems
ACM Transactions on Computational Logic (TOCL)
Finding the exact volume of a polyhedron
Advances in Engineering Software
An accurate cost model for guiding data locality transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Volume Computation for Boolean Combination of Linear Arithmetic Constraints
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Complexity of Approximating the Vertex Centroid of a Polyhedron
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
Algorithms and theory of computation handbook
A Metric for Quantifying Similarity between Timing Constraint Sets in Real-Time Systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Complexity of approximating the vertex centroid of a polyhedron
Theoretical Computer Science
Calculating probabilities of real-time test cases
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Polarity and the complexity of the shooting experiment
Discrete Optimization
Volume computation using a direct monte carlo method
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Software for exact integration of polynomials over polyhedra
Computational Geometry: Theory and Applications
Markov chains, Hamiltonian cycles and volumes of convex bodies
Journal of Global Optimization
| Hi-index | 0.00 |