Authors: Cohen, E Datar, M Fujiwara, S Gionis, A Indyk, P Motwani, R Ullman, JD Yang, C

Citation: E. Cohen et al., Finding interesting associations without support pruning, IEEE KNOWL, 13(1), 2001, pp. 64-78

Authors: Bartal, Y Charikar, M Indyk, P

Citation: Y. Bartal et al., On page migration and other relaxed task systems, THEOR COMP, 268(1), 2001, pp. 43-66

Authors: Indyk, P

Citation: P. Indyk, A small approximately min-wise independent family of hash functions, J ALGORITHM, 38(1), 2001, pp. 84-90

Authors: Amir, A Efrat, A Indyk, P Samet, H

Citation: A. Amir et al., Efficient regular data structures and algorithms for dilation, location, and proximity problems, ALGORITHMIC, 30(2), 2001, pp. 164-187

Authors: Aingworth, D Chekuri, C Indyk, P Motwani, R

Citation: D. Aingworth et al., Fast estimation of diameter and shortest paths (without matrix multiplication), SIAM J COMP, 28(4), 1999, pp. 1167-1181