Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Forest matching is a fundamental step in solving various problems defined on terms such as term matching. We describe the first optimal speedup parallel algorithm for solving the forest matching problem. Our algorithm runs in time O(log n) using n log n processors on a CRCW PRAM, given a forest of n nodes as input. We use this algorithm to design the first optimal speedup parallel algorithm for solving the term matching problem. We also extend these algorithms to run on the weaker CREW PRAM with optimal speedup as well. This will involve a simple randomization scheme for simulating concurrent writes through a use of hashing. © 1992.
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Lixi Zhou, Jiaqing Chen, et al.
VLDB
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010