Andrea S. LaPaugh

According to our database, Andrea S. LaPaugh authored at least 25 papers between 1978 and 2013.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2013

Enabling Author-Centric Ranking of Web Content.

Muneeb Ali, Andrea S. LaPaugh

Proceedings of the 16th International Workshop on the Web and Databases 2013, 2013

2005

Estimating the maximum.

Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich

J. Algorithms, 2005

2003

Subscription-Enhanced Content Delivery.

Mao Chen, Jaswinder Pal Singh, Andrea S. LaPaugh

Proceedings of the Web Content Caching and Distribution, 8th International Workshop, 2003

Content Distribution for Publish/Subscribe Services.

Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh

Proceedings of the Middleware 2003, 2003

2002

Predicting category accesses for a user in a structured information space.

Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh

Proceedings of the SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2002

Categorizing information objects from user access patterns.

Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh

Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, 2002

1999

VLSI Layout Algorithms.

Andrea S. LaPaugh

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Finding All Minimal Shapes in a Routing Channel.

Liang-Fang Chao, Andrea S. LaPaugh

Algorithmica, 1998

1997

Case Study in Algorithms: VLSI Layout.

Andrea S. LaPaugh

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Layout Algorithms for VLSI deisgn.

Andrea S. LaPaugh

ACM Comput. Surv., 1996

1994

Minimizing Channel Density by Lateral Shifting of Components.

David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Recontamination Does Not Help to Search a Graph.

Andrea S. LaPaugh

J. ACM, 1993

Rotation Scheduling: A Loop Pipelining Algorithm.

Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha

Proceedings of the 30th Design Automation Conference. Dallas, 1993

1992

How to Store a Triangular Matrix.

Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg

IEEE Trans. Computers, 1992

1991

Editors' Introduction.

Andrea S. LaPaugh, Frank Thomson Leighton

Algorithmica, 1991

CLOVER: A Timing Constraints Verification System.

Dimitris Doukas, Andrea S. LaPaugh

Proceedings of the 28th Design Automation Conference, 1991

1990

Issues in synthesis of board-level systems.

Andrea S. LaPaugh, Wayne H. Wolf

Proceedings of the First International Workshop on Rapid System Prototyping, 1990

1985

Scheduling File Transfers.

Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh

SIAM J. Comput., 1985

1984

The even-path problem for graphs and digraphs.

Andrea S. LaPaugh, Christos H. Papadimitriou

Networks, 1984

1983

Scheduling File Transfers in a Distributed Network.

Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh

Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

Total Fault Testing Using the Bipartite Transformation.

Andrea S. LaPaugh, Richard J. Lipton

Proceedings of the Proceedings International Test Conference 1983, 1983

Optimal choice of intermediate latching to maximize throughput in VLSI circuits.

Peter R. Cappello, Andrea S. LaPaugh, Kenneth Steiglitz

Proceedings of the IEEE International Conference on Acoustics, 1983

Total stuct-at-fault testing by circuit transformation.

Andrea S. LaPaugh, Richard J. Lipton

Proceedings of the 20th Design Automation Conference, 1983

1980

A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract)

Andrea S. LaPaugh

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1978

The Subgraph Homeomorphism Problem

Andrea S. LaPaugh, Ronald L. Rivest

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978