| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Andrea S. LaPaugh 17 Mao Chen , Andrea S. LaPaugh, Jaswinder Pal Singh : Categorizing information objects from user access patterns. CIKM 2002 : 365-372 16 Mao Chen , Andrea S. LaPaugh, Jaswinder Pal Singh : Predicting category accesses for a user in a structured information space. SIGIR 2002 : 65-72 15 Liang-Fang Chao , Andrea S. LaPaugh: Finding All Minimal Shapes in a Routing Channel. Algorithmica 21 (2): 211-244 (1998) 14 Andrea S. LaPaugh: Case Study in Algorithms: VLSI Layout. The Computer Science and Engineering Handbook 1997 : 355-378 13 Andrea S. LaPaugh: Layout Algorithms for VLSI deisgn. ACM Computing Surveys 28 (1): 59-61 (1996) 12 David S. Johnson , Andrea S. LaPaugh, Ron Y. Pinter : Minimizing Channel Density by Lateral Shifting of Components. SODA 1994 : 122-131 11 Liang-Fang Chao , Andrea S. LaPaugh, Edwin Hsing-Mean Sha : Rotation Scheduling: A Loop Pipelining Algorithm. DAC 1993 : 566-572 10 Andrea S. LaPaugh: Recontamination Does Not Help to Search a Graph. JACM 40 (2): 224-245 (1993) 9 Andrea S. LaPaugh, Richard J. Lipton , Jonathan S. Sandberg : How to Store a Triangular Matrix. IEEE Transactions on Computers 41 (7): 896-899 (1992) 8 Dimitris Doukas , Andrea S. LaPaugh: CLOVER: A Timing Constraints Verification System. DAC 1991 : 662-667 7 Andrea S. LaPaugh, Frank Thomson Leighton : Editors' Introduction. Algorithmica 6 (1): 1-3 (1991) 6 Edward G. Coffman Jr. , M. R. Garey , David S. Johnson , Andrea S. LaPaugh: Scheduling File Transfers. SIAM J. Comput. 14 (4): 743-780 (1985) 5 Andrea S. LaPaugh, Richard J. Lipton : Total Fault Testing Using the Bipartite Transformation. ITC 1983 : 428-434 4 Edward G. Coffman Jr. , M. R. Garey , David S. Johnson , Andrea S. LaPaugh: Scheduling File Transfers in a Distributed Network. PODC 1983 : 254-266 3 Andrea S. LaPaugh: A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract). FOCS 1980 : 282-293 2 Andrea S. LaPaugh, Ronald L. Rivest : The Subgraph Homeomorphism Problem. JCSS 20 (2): 133-149 (1980) 1 Andrea S. LaPaugh, Ronald L. Rivest : The Subgraph Homeomorphism Problem. STOC 1978 : 40-50  DiSC'03 © 2003 Association for Computing Machinery |
