Computing the width of a three-dimensional point set: an experimental study
Journal of Experimental Algorithmics (JEA)
Algorithms and Complexity for Tetrahedralization Detections
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Property Testing in Computational Geometry
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Constructing convex 3-polytopes from two triangulations of a polygon
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Detecting tetrahedralizations of a set of line segments
Journal of Algorithms
An efficient local approach to convexity testing of piecewise-linear hypersurfaces
Computational Geometry: Theory and Applications
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Computer Science Review
Cauchy's theorem and edge lengths of convex polyhedra
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |