with Mao Chen and J.P. Singh, Content
Publish/Subscribe Services, Proceedings
International Middleware Conference, Markus Endler and
Schmidt, Eds., Springer, 2003.
with Mao Chen and J.P.Singh, Predicting
a User in a Structured Information Space, Proceedings of the 25th Annual International
SIGIR Conference on Research and
Development in Information Retrieval, ACM, August 2002.
with L-F. Chao,
Minimal Shapes in a Routing Channel, Algorithmica,
21 (1998) pp. 211-244.
with Liang-Fang Chao and Edwin Hsing-Mean Sha, Rotation
Loop Pipelining Algorithm, IEEE Transactions on
Design, Vol. 16, No. 3 (March 1997) pp. 229-239.
with D. Doukas, Clover:
A Timing Constraints Verification System, Proc. of the 28th ACM/IEEE Design Automation Conference,
1991, pp. 662-667.
with C. L. Berman, D. J. Hathaway, and L. Trevillyan, Efficient
for Timing Correction, International
on Circuits and
Systems May 1990.
with P. Cappello and K. Steiglitz, Optimal
of Intermediate Latching to Maximize Throughput in VLSI Circuits,
IEEE Transactions on Acoustics,
Speech, and Signal Processing, Vol. ASSP-32, No.1 (Feb.
with R. Lipton, Total
Fault Testing by Circuit Transformation, Proc. of the Twentieth Design
Conference, IEEE, June 1983, pp. 713-716.
A Polynomial Time Algorithm for Optimal Routing Around a
Rectangle, Proc. Twenty-First
Annual Symposium on
Foundations of Computer Science, IEEE,
October 1980, pp. 282-293.
Not Help to Search a Graph,
Journal of the ACM, Vol. 40, No. 2 (April 1993) pp.
with R.J. Lipton and J.S. Sandberg, How
Store a Triangular Matrix, IEEE
Trans. on Computers, Vol. 41, No. 7 (July1992), pp.
with E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, Scheduling File Transfers, SIAM Journal for Computing, Vol. 14, No. 3 (1985) pp744-780.
with C. Papadimitriou, The Even Path Problem for Graphs and Digraphs, Networks, Vol. 14, No 4. (1984) pp. 507-513.
with R. Rivest, The Subgraph Homeomorphism Problem, Journal of Computer and System
Vol. 20, No. 2 (April 1980) pp. 133-149.