Andrea S. LaPaugh

27 papers A* 8A 3C 1Misc 1Journal 10Unranked 2
YearRankTypeTitle / Venue / Authors
2013 — conf
Enabling Author-Centric Ranking of Web Content.
WebDB
Muneeb Ali, Andrea S. LaPaugh
2005 J jnl
Estimating the maximum.
J. Algorithms
Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich
2003 A conf
Content Distribution for Publish/Subscribe Services.
Middleware
Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh
2003 — conf
Subscription-Enhanced Content Delivery.
WCW
Mao Chen, Jaswinder Pal Singh, Andrea S. LaPaugh
2002 A conf
Categorizing information objects from user access patterns.
CIKM
Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh
2002 A* conf
Predicting category accesses for a user in a structured information space.
SIGIR
Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh
1999 — ch.
VLSI Layout Algorithms.
Algorithms and Theory of Computation Handbook
Andrea S. LaPaugh
1998 J jnl
Finding All Minimal Shapes in a Routing Channel.
Algorithmica
Liang-Fang Chao, Andrea S. LaPaugh
1997 — ch.
Case Study in Algorithms: VLSI Layout.
The Computer Science and Engineering Handbook
Andrea S. LaPaugh
1997 J jnl
Rotation scheduling: a loop pipelining algorithm.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha
1996 J jnl
Layout Algorithms for VLSI deisgn.
ACM Comput. Surv.
Andrea S. LaPaugh
1994 A* conf
Minimizing Channel Density by Lateral Shifting of Components.
SODA
David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter
1993 J jnl
Recontamination Does Not Help to Search a Graph.
J. ACM
Andrea S. LaPaugh
1993 A* conf
Rotation Scheduling: A Loop Pipelining Algorithm.
DAC
Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha
1992 J jnl
How to Store a Triangular Matrix.
IEEE Trans. Computers
Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg
1991 A* conf
CLOVER: A Timing Constraints Verification System.
DAC
Dimitris Doukas, Andrea S. LaPaugh
1991 J jnl
Editors' Introduction.
Algorithmica
Andrea S. LaPaugh, Frank Thomson Leighton
1990 C conf
Issues in synthesis of board-level systems.
RSP
Andrea S. LaPaugh, Wayne H. Wolf
1985 J jnl
Scheduling File Transfers.
SIAM J. Comput.
Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
1984 J jnl
The even-path problem for graphs and digraphs.
Networks
Andrea S. LaPaugh, Christos H. Papadimitriou
1983 Misc conf
Optimal choice of intermediate latching to maximize throughput in VLSI circuits.
ICASSP
Peter R. Cappello, Andrea S. LaPaugh, Kenneth Steiglitz
1983 A* conf
Scheduling File Transfers in a Distributed Network.
PODC
Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
1983 A conf
Total Fault Testing Using the Bipartite Transformation.
ITC
Andrea S. LaPaugh, Richard J. Lipton
1983 A* conf
Total stuct-at-fault testing by circuit transformation.
DAC
Andrea S. LaPaugh, Richard J. Lipton
1980 A* conf
A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract)
FOCS
Andrea S. LaPaugh
1980 J jnl
The Subgraph Homeomorphism Problem.
J. Comput. Syst. Sci.
Andrea S. LaPaugh, Ronald L. Rivest
1978 A* conf
The Subgraph Homeomorphism Problem
STOC
Andrea S. LaPaugh, Ronald L. Rivest