Search the dblp DataBase
Andrea S. LaPaugh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Andrea S. LaPaugh, Ronald L. Rivest
The Subgraph Homeomorphism Problem [Citation Graph (1, 0)][DBLP]
STOC, 1978, pp:40-50 [Conf] - Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
Scheduling File Transfers. [Citation Graph (1, 0)][DBLP]
SIAM J. Comput., 1985, v:14, n:4, pp:743-780 [Journal] - Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh
Categorizing information objects from user access patterns. [Citation Graph (0, 0)][DBLP]
CIKM, 2002, pp:365-372 [Conf] - Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha
Rotation Scheduling: A Loop Pipelining Algorithm. [Citation Graph (0, 0)][DBLP]
DAC, 1993, pp:566-572 [Conf] - Dimitris Doukas, Andrea S. LaPaugh
CLOVER: A Timing Constraints Verification System. [Citation Graph (0, 0)][DBLP]
DAC, 1991, pp:662-667 [Conf] - Andrea S. LaPaugh
A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1980, pp:282-293 [Conf] - Andrea S. LaPaugh, Richard J. Lipton
Total Fault Testing Using the Bipartite Transformation. [Citation Graph (0, 0)][DBLP]
ITC, 1983, pp:428-434 [Conf] - Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh
Content Distribution for Publish/Subscribe Services. [Citation Graph (0, 0)][DBLP]
Middleware, 2003, pp:83-102 [Conf] - Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
Scheduling File Transfers in a Distributed Network. [Citation Graph (0, 0)][DBLP]
PODC, 1983, pp:254-266 [Conf] - Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh
Predicting category accesses for a user in a structured information space. [Citation Graph (0, 0)][DBLP]
SIGIR, 2002, pp:65-72 [Conf] - David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter
Minimizing Channel Density by Lateral Shifting of Components. [Citation Graph (0, 0)][DBLP]
SODA, 1994, pp:122-131 [Conf] - Liang-Fang Chao, Andrea S. LaPaugh
Finding All Minimal Shapes in a Routing Channel. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1998, v:21, n:2, pp:211-244 [Journal] - Andrea S. LaPaugh, Frank Thomson Leighton
Editors' Introduction. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1991, v:6, n:1, pp:1-3 [Journal] - Andrea S. LaPaugh
Layout Algorithms for VLSI deisgn. [Citation Graph (0, 0)][DBLP]
ACM Comput. Surv., 1996, v:28, n:1, pp:59-61 [Journal] - Andrea S. LaPaugh
Recontamination Does Not Help to Search a Graph. [Citation Graph (0, 0)][DBLP]
J. ACM, 1993, v:40, n:2, pp:224-245 [Journal] - Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich
Estimating the maximum. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2005, v:54, n:1, pp:105-114 [Journal] - Andrea S. LaPaugh, Ronald L. Rivest
The Subgraph Homeomorphism Problem. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1980, v:20, n:2, pp:133-149 [Journal] - Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg
How to Store a Triangular Matrix. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1992, v:41, n:7, pp:896-899 [Journal] - Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha
Rotation scheduling: a loop pipelining algorithm. [Citation Graph (0, 0)][DBLP]
IEEE Trans. on CAD of Integrated Circuits and Systems, 1997, v:16, n:3, pp:229-239 [Journal]
Search in 0.025secs, Finished in 0.026secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002