Andrea S. LaPaugh

Selected Publications

Chapters in books:

VLSI Layout Algorithms, in CRC Algorithms and Theory of Computation Handbook (second edition), Volume 2: Special Topics and Techniques,
Mikhail Atallah and Marina Blanton, editors-in-chief, (CRC Press, Boca Raton, Fl.), 2010.

with R. Y. Pinter, Channel Routing for Integrated Circuits (a survey), in Annual Review of Computer Science, Vol. 4, Joseph Traub editor, (Annual Reviews, Inc., Palo Alto, Ca.) 1990.

Research papers:

Information discovery

with Mao Chen and J.P. Singh, Content Distribution for Publish/Subscribe Services, Proceedings of ACM/IFIP/USENIX International Middleware Conference, Markus Endler and Douglas Schmidt, Eds., Springer, 2003.

with Mao Chen and J.P.Singh,  Predicting Category Accesses for a User in a Structured Information Space, Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM, August 2002.

Computer-Aided Design (CAD) of Digital Systems

with L-F. Chao,  Finding All Minimal Shapes in a Routing Channel, Algorithmica, 21 (1998) pp. 211-244.

with Liang-Fang Chao and Edwin Hsing-Mean Sha, Rotation Scheduling: A Loop Pipelining Algorithm, IEEE Transactions on Computer-Aided Design, Vol. 16, No. 3 (March 1997) pp. 229-239.

with D. S. Johnson and R. Y. Pinter, Minimizing Channel Density by Lateral Shifting of Components, Proceedings of the Symposium on Discrete Algorithms ACM, Jan. 1994, pp. 122-131.

with D. Doukas, Clover: A Timing Constraints Verification System, Proc. of the 28th ACM/IEEE Design Automation Conference, June 1991, pp. 662-667.

with C. L. Berman, D. J. Hathaway, and L. Trevillyan, Efficient Techniques for Timing Correction, International Symposium on Circuits and Systems May 1990.

with P. Cappello and K. Steiglitz, Optimal Choice of Intermediate Latching to Maximize Throughput in VLSI Circuits, IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. ASSP-32, No.1 (Feb. 1984) pp. 28-33.

with R. Lipton, Total Stuck-at Fault Testing by Circuit Transformation, Proc. of the Twentieth Design Automation 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.

Algorithm Foundations

Recontamination Does Not Help to Search a Graph, Journal of the ACM, Vol. 40, No. 2 (April 1993) pp. 224-245.

with R.J. Lipton and J.S. Sandberg, How to Store a Triangular Matrix, IEEE Trans. on Computers, Vol. 41, No. 7 (July1992), pp. 896-899.

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 Sciences, Vol. 20, No. 2 (April 1980) pp. 133-149.