|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 8 keywords
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich |
Estimating the maximum.  |
J. Algorithms  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh |
Content Distribution for Publish/Subscribe Services.  |
Middleware  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh |
Predicting category accesses for a user in a structured information space.  |
SIGIR  |
2002 |
DBLP DOI BibTeX RDF |
access history, category access, category structure, prediction, Markov model, temporal analysis |
| 1 | Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh |
Categorizing information objects from user access patterns.  |
CIKM  |
2002 |
DBLP DOI BibTeX RDF |
category structure, user accesses, classification, multimedia, prediction, dynamic object |
| 1 | Liang-Fang Chao, Andrea S. LaPaugh |
Finding All Minimal Shapes in a Routing Channel.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea S. LaPaugh |
Case Study in Algorithms: VLSI Layout.  |
The Computer Science and Engineering Handbook  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Andrea S. LaPaugh |
Layout Algorithms for VLSI deisgn.  |
ACM Comput. Surv.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter |
Minimizing Channel Density by Lateral Shifting of Components.  |
SODA  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea S. LaPaugh |
Recontamination Does Not Help to Search a Graph.  |
J. ACM  |
1993 |
DBLP DOI BibTeX RDF |
pursuit and evasion, NP-completeness, graph searching |
| 1 | Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha |
Rotation Scheduling: A Loop Pipelining Algorithm.  |
DAC  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg |
How to Store a Triangular Matrix.  |
IEEE Trans. Computers  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea S. LaPaugh, Frank Thomson Leighton |
Editors' Introduction.  |
Algorithmica  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Doukas, Andrea S. LaPaugh |
CLOVER: A Timing Constraints Verification System.  |
DAC  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh |
Scheduling File Transfers.  |
SIAM J. Comput.  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea S. LaPaugh, Richard J. Lipton |
Total Fault Testing Using the Bipartite Transformation.  |
ITC  |
1983 |
DBLP BibTeX RDF |
|
| 1 | Andrea S. LaPaugh, Richard J. Lipton |
Total stuct-at-fault testing by circuit transformation.  |
DAC  |
1983 |
DBLP BibTeX RDF |
|
| 1 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh |
Scheduling File Transfers in a Distributed Network.  |
PODC  |
1983 |
DBLP BibTeX RDF |
|
| 1 | Andrea S. LaPaugh, Ronald L. Rivest |
The Subgraph Homeomorphism Problem.  |
J. Comput. Syst. Sci.  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea S. LaPaugh |
A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract)  |
FOCS  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea S. LaPaugh, Ronald L. Rivest |
The Subgraph Homeomorphism Problem  |
STOC  |
1978 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|