| 2005 | ||
|---|---|---|
| j9 | Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich: Estimating the maximum. J. Algorithms 54(1): 105-114 (2005) | |
| 2003 | ||
| c11 | Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh: Content Distribution for Publish/Subscribe Services. Middleware 2003: 83-102 | |
| 2002 | ||
| c10 | Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh: Categorizing information objects from user access patterns. CIKM 2002: 365-372 | |
| c9 | Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh: Predicting category accesses for a user in a structured information space. SIGIR 2002: 65-72 | |
| 1998 | ||
| j8 | Liang-Fang Chao, Andrea S. LaPaugh: Finding All Minimal Shapes in a Routing Channel. Algorithmica 21(2): 211-244 (1998) | |
| 1997 | ||
| j7 | Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha: Rotation scheduling: a loop pipelining algorithm. IEEE Trans. on CAD of Integrated Circuits and Systems 16(3): 229-239 (1997) | |
| p1 | Andrea S. LaPaugh: Case Study in Algorithms: VLSI Layout. The Computer Science and Engineering Handbook 1997: 355-378 | |
| 1996 | ||
| j6 | ||
| 1994 | ||
| c8 | David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter: Minimizing Channel Density by Lateral Shifting of Components. SODA 1994: 122-131 | |
| 1993 | ||
| j5 | ||
| c7 | Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha: Rotation Scheduling: A Loop Pipelining Algorithm. DAC 1993: 566-572 | |
| 1992 | ||
| j4 | Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg: How to Store a Triangular Matrix. IEEE Trans. Computers 41(7): 896-899 (1992) | |
| 1991 | ||
| j3 | ||
| c6 | Dimitris Doukas, Andrea S. LaPaugh: CLOVER: A Timing Constraints Verification System. DAC 1991: 662-667 | |
| 1985 | ||
| j2 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh: Scheduling File Transfers. SIAM J. Comput. 14(3): 744-780 (1985) | |
| 1983 | ||
| c5 | Andrea S. LaPaugh, Richard J. Lipton: Total stuct-at-fault testing by circuit transformation. DAC 1983: 713-716 | |
| c4 | Andrea S. LaPaugh, Richard J. Lipton: Total Fault Testing Using the Bipartite Transformation. ITC 1983: 428-434 | |
| c3 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh: Scheduling File Transfers in a Distributed Network. PODC 1983: 254-266 | |
| 1980 | ||
| j1 | Andrea S. LaPaugh, Ronald L. Rivest: The Subgraph Homeomorphism Problem. J. Comput. Syst. Sci. 20(2): 133-149 (1980) | |
| c2 | Andrea S. LaPaugh: A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract). FOCS 1980: 282-293 | |
| 1978 | ||
| c1 | ||
| 1 | Liang-Fang Chao | |
| 2 | Mao Chen (Monica Chen) | |
| 3 | Edward G. Coffman Jr. | |
| 4 | Dimitris Doukas | |
| 5 | Faith Ellen (Faith Ellen Fich, Faith E. Fich) | |
| 6 | M. R. Garey (Michael R. Garey) | |
| 7 | Ben Gum | |
| 8 | David S. Johnson | |
| 9 | Frank Thomson Leighton (Tom Leighton) | |
| 10 | Richard J. Lipton | |
| 11 | Ron Y. Pinter | |
| 12 | Ronald L. Rivest | |
| 13 | Jonathan S. Sandberg | |
| 14 | Edwin Hsing-Mean Sha | |
| 15 | Jaswinder Pal Singh |
Colors in the list of coauthors
Last update Wed May 22 16:46:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page