발행물
컨퍼런스
International Symposium on Parallel Architectures Algorithms, and Networks
,
An O(logN loglogN) time RMESH algorithm for the simple polygon visibility problem
5th ACM-SIAM Symposium on Discrete Algorithms
The subtree max gap problem with application to parallel string covering
Alphabet-independent two-dimensional pattern matching
Fast sequential and parallel dynamic programming