A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
The "Not-Too-Heavy Spanning Tree" Constraint
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
The minimum spanning tree constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Hi-index | 0.00 |