default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea S. LaPaugh
Person information
- affiliation: Princeton University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c15]Muneeb Ali, Andrea S. LaPaugh:
Enabling Author-Centric Ranking of Web Content. WebDB 2013: 31-36
2000 – 2009
- 2005
- [j10]Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich:
Estimating the maximum. J. Algorithms 54(1): 105-114 (2005) - 2003
- [c14]Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh:
Content Distribution for Publish/Subscribe Services. Middleware 2003: 83-102 - [c13]Mao Chen, Jaswinder Pal Singh, Andrea S. LaPaugh:
Subscription-Enhanced Content Delivery. WCW 2003: 187-204 - 2002
- [c12]Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh:
Categorizing information objects from user access patterns. CIKM 2002: 365-372 - [c11]Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh:
Predicting category accesses for a user in a structured information space. SIGIR 2002: 65-72
1990 – 1999
- 1999
- [p1]Andrea S. LaPaugh:
VLSI Layout Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j9]Liang-Fang Chao, Andrea S. LaPaugh:
Finding All Minimal Shapes in a Routing Channel. Algorithmica 21(2): 211-244 (1998) - 1997
- [j8]Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha:
Rotation scheduling: a loop pipelining algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(3): 229-239 (1997) - [r1]Andrea S. LaPaugh:
Case Study in Algorithms: VLSI Layout. The Computer Science and Engineering Handbook 1997: 355-378 - 1996
- [j7]Andrea S. LaPaugh:
Layout Algorithms for VLSI deisgn. ACM Comput. Surv. 28(1): 59-61 (1996) - 1994
- [c10]David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter:
Minimizing Channel Density by Lateral Shifting of Components. SODA 1994: 122-131 - 1993
- [j6]Andrea S. LaPaugh:
Recontamination Does Not Help to Search a Graph. J. ACM 40(2): 224-245 (1993) - [c9]Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha:
Rotation Scheduling: A Loop Pipelining Algorithm. DAC 1993: 566-572 - 1992
- [j5]Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg:
How to Store a Triangular Matrix. IEEE Trans. Computers 41(7): 896-899 (1992) - 1991
- [j4]Andrea S. LaPaugh, Frank Thomson Leighton:
Editors' Introduction. Algorithmica 6(1): 1-3 (1991) - [c8]Dimitris Doukas, Andrea S. LaPaugh:
CLOVER: A Timing Constraints Verification System. DAC 1991: 662-667 - 1990
- [c7]Andrea S. LaPaugh, Wayne H. Wolf:
Issues in synthesis of board-level systems. RSP 1990: 157
1980 – 1989
- 1985
- [j3]Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh:
Scheduling File Transfers. SIAM J. Comput. 14(3): 744-780 (1985) - 1984
- [j2]Andrea S. LaPaugh, Christos H. Papadimitriou:
The even-path problem for graphs and digraphs. Networks 14(4): 507-513 (1984) - 1983
- [c6]Andrea S. LaPaugh, Richard J. Lipton:
Total stuct-at-fault testing by circuit transformation. DAC 1983: 713-716 - [c5]Peter R. Cappello, Andrea S. LaPaugh, Kenneth Steiglitz:
Optimal choice of intermediate latching to maximize throughput in VLSI circuits. ICASSP 1983: 935-938 - [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
1970 – 1979
- 1978
- [c1]Andrea S. LaPaugh, Ronald L. Rivest:
The Subgraph Homeomorphism Problem. STOC 1978: 40-50
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
