The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Theoretical analysis of a class of randomized regularization methods
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
An Efficient General-Purpose Parallel Computer
Journal of the ACM (JACM)
An efficient general purpose parallel computer
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A shortest-path algorithm with expected time O(n2 log n log* n)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Applications of the theory of random graphs to average algorithm performance analysis
ACM '79 Proceedings of the 1979 annual conference
Efficiently answering top-k typicality queries on large databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Ranking queries on uncertain data: a probabilistic threshold approach
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Query answering techniques on uncertain and probabilistic data: tutorial summary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Top-k typicality queries and efficient query answering methods on large databases
The VLDB Journal — The International Journal on Very Large Data Bases
Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
Distributed and Parallel Databases
Probabilistic path queries in road networks: traffic uncertainty aware path selection
Proceedings of the 13th International Conference on Extending Database Technology
Ranking queries on uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
SISP: a new framework for searching the informative subgraph based on PSO
Proceedings of the 20th ACM international conference on Information and knowledge management
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On differentially private frequent itemset mining
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The main purpose of this paper is to give techniques for analysing the probabilistic performance of certain kinds of algorithms, and hence to suggest some fast algorithms with provably desirable probabilistic behaviour. The particular problems we consider are: finding Hamiltonian circuits in directed graphs (DHC), finding Hamiltonian circuits in undirected graphs (UHC), and finding perfect matchings in undirected graphs (PM). We show that for each problem there is an algorithm that is extremely fast (0(n(log n)2) for DHC and UHC, and 0(nlog n) for PM), and which with probability tending to one finds a solution in randomly chosen graphs of sufficient density. These results contrast with the known NP-completeness of the first two problems [2,12] and the best worst-case upper bound known of 0(n2.5) for the last [9].