<?xml version="1.0"?>
<dblpperson name="Andrea S. LaPaugh" pid="l/ASLaPaugh" n="27">
<person key="homepages/l/ASLaPaugh" mdate="2024-05-01">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<note type="affiliation">Princeton University, USA</note>
<url>http://www.cs.princeton.edu/~aslp/</url>
<url>https://mathscinet.ams.org/mathscinet/MRAuthorID/108835</url>
<url>https://mathgenealogy.org/id.php?id=82106</url>
<url>https://en.wikipedia.org/wiki/Andrea_LaPaugh</url>
<url>https://www.wikidata.org/entity/Q102249102</url>
</person>
<r><inproceedings key="conf/webdb/AliL13" mdate="2020-03-12">
<author pid="84/6951">Muneeb Ali</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>Enabling Author-Centric Ranking of Web Content.</title>
<pages>31-36</pages>
<year>2013</year>
<booktitle>WebDB</booktitle>
<ee type="oa">http://webdb2013.lille.inria.fr/Paper%2043.pdf</ee>
<crossref>conf/webdb/2013</crossref>
<url>db/conf/webdb/webdb2013.html#AliL13</url>
</inproceedings>
</r>
<r><article key="journals/jal/GumLLF05" mdate="2020-06-15">
<author pid="46/6504">Ben Gum</author>
<author pid="l/RichardJLipton">Richard J. Lipton</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="f/FEFich">Faith E. Fich</author>
<title>Estimating the maximum.</title>
<pages>105-114</pages>
<year>2005</year>
<volume>54</volume>
<journal>J. Algorithms</journal>
<number>1</number>
<ee>https://doi.org/10.1016/j.jalgor.2004.04.005</ee>
<url>db/journals/jal/jal54.html#GumLLF05</url>
</article>
</r>
<r><inproceedings key="conf/middleware/ChenLS03" mdate="2019-02-07">
<author pid="c/MaoChen-1">Mao Chen 0001</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="s/JaswinderPalSingh">Jaswinder Pal Singh</author>
<title>Content Distribution for Publish/Subscribe Services.</title>
<pages>83-102</pages>
<ee>https://doi.org/10.1007/3-540-44892-6_5</ee>
<year>2003</year>
<crossref>conf/middleware/2003</crossref>
<booktitle>Middleware</booktitle>
<url>db/conf/middleware/middleware2003.html#ChenLS03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wcw/0001SL03" mdate="2019-07-05">
<author pid="c/MaoChen-1">Mao Chen 0001</author>
<author pid="s/JaswinderPalSingh">Jaswinder Pal Singh</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>Subscription-Enhanced Content Delivery.</title>
<pages>187-204</pages>
<year>2003</year>
<booktitle>WCW</booktitle>
<ee>https://doi.org/10.1007/1-4020-2258-1_13</ee>
<crossref>conf/wcw/2003</crossref>
<url>db/conf/wcw/wcw2003.html#0001SL03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/cikm/ChenLS02" mdate="2019-02-07">
<author pid="c/MaoChen-1">Mao Chen 0001</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="s/JaswinderPalSingh">Jaswinder Pal Singh</author>
<title>Categorizing information objects from user access patterns.</title>
<pages>365-372</pages>
<year>2002</year>
<crossref>conf/cikm/2002</crossref>
<booktitle>CIKM</booktitle>
<ee>https://doi.org/10.1145/584792.584852</ee>
<url>db/conf/cikm/cikm2002.html#ChenLS02</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sigir/ChenLS02" mdate="2019-02-07">
<author pid="c/MaoChen-1">Mao Chen 0001</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="s/JaswinderPalSingh">Jaswinder Pal Singh</author>
<title>Predicting category accesses for a user in a structured information space.</title>
<pages>65-72</pages>
<year>2002</year>
<crossref>conf/sigir/2002</crossref>
<booktitle>SIGIR</booktitle>
<ee>https://doi.org/10.1145/564376.564390</ee>
<url>db/conf/sigir/sigir2002.html#ChenLS02</url>
</inproceedings>
</r>
<r><incollection key="books/crc/99/LaPaugh99" mdate="2020-05-04">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>VLSI Layout Algorithms.</title>
<year>1999</year>
<booktitle>Algorithms and Theory of Computation Handbook</booktitle>
<ee>https://doi.org/10.1201/9781420049503-c24</ee>
<crossref>books/crc/99/A1999</crossref>
<url>db/books/collections/A1999.html#LaPaugh99</url>
</incollection>
</r>
<r><article key="journals/algorithmica/ChaoL98" mdate="2017-05-17">
<author pid="36/6851">Liang-Fang Chao</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>Finding All Minimal Shapes in a Routing Channel.</title>
<pages>211-244</pages>
<year>1998</year>
<volume>21</volume>
<journal>Algorithmica</journal>
<number>2</number>
<url>db/journals/algorithmica/algorithmica21.html#ChaoL98</url>
<ee>https://doi.org/10.1007/PL00009213</ee>
</article>
</r>
<r><article key="journals/tcad/ChaoLS97" mdate="2020-09-24">
<author pid="36/6851">Liang-Fang Chao</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="27/2376">Edwin Hsing-Mean Sha</author>
<title>Rotation scheduling: a loop pipelining algorithm.</title>
<pages>229-239</pages>
<year>1997</year>
<volume>16</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>3</number>
<ee>https://doi.org/10.1109/43.594829</ee>
<url>db/journals/tcad/tcad16.html#ChaoLS97</url>
</article>
</r>
<r><incollection publtype="encyclopedia" key="books/crc/tucker97/LaPaugh97" mdate="2017-07-09">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>Case Study in Algorithms: VLSI Layout.</title>
<pages>355-378</pages>
<year>1997</year>
<crossref>books/crc/tucker1997</crossref>
<booktitle>The Computer Science and Engineering Handbook</booktitle>
<url>db/books/collections/tucker97.html#LaPaugh97</url>
</incollection>
</r>
<r><article key="journals/csur/Lapaugh96" mdate="2018-11-06">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>Layout Algorithms for VLSI deisgn.</title>
<pages>59-61</pages>
<year>1996</year>
<volume>28</volume>
<journal>ACM Comput. Surv.</journal>
<number>1</number>
<url>db/journals/csur/csur28.html#Lapaugh96</url>
<ee>https://doi.org/10.1145/234313.234343</ee>
</article>
</r>
<r><inproceedings key="conf/soda/JohnsonLP94" mdate="2025-05-26">
<author pid="j/DavidSJohnson">David S. Johnson 0001</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="79/2997">Ron Y. Pinter</author>
<title>Minimizing Channel Density by Lateral Shifting of Components.</title>
<pages>122-131</pages>
<year>1994</year>
<crossref>conf/soda/1994</crossref>
<booktitle>SODA</booktitle>
<url>db/conf/soda/soda94.html#JohnsonLP94</url>
<ee>http://dl.acm.org/citation.cfm?id=314464.314486</ee>
</inproceedings>
</r>
<r><article key="journals/jacm/LaPaugh93" mdate="2025-01-19">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>Recontamination Does Not Help to Search a Graph.</title>
<pages>224-245</pages>
<year>1993</year>
<volume>40</volume>
<journal>J. ACM</journal>
<number>2</number>
<url>db/journals/jacm/jacm40.html#LaPaugh93</url>
<ee>https://doi.org/10.1145/151261.151263</ee>
<ee>https://www.wikidata.org/entity/Q130987910</ee>
</article>
</r>
<r><inproceedings key="conf/dac/ChaoLS93" mdate="2018-11-06">
<author pid="36/6851">Liang-Fang Chao</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="27/2376">Edwin Hsing-Mean Sha</author>
<title>Rotation Scheduling: A Loop Pipelining Algorithm.</title>
<pages>566-572</pages>
<year>1993</year>
<crossref>conf/dac/1993</crossref>
<booktitle>DAC</booktitle>
<ee>https://doi.org/10.1145/157485.165042</ee>
<url>db/conf/dac/dac93.html#ChaoLS93</url>
</inproceedings>
</r>
<r><article key="journals/tc/LaPaughLS92" mdate="2017-05-20">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="l/RichardJLipton">Richard J. Lipton</author>
<author pid="22/3132">Jonathan S. Sandberg</author>
<title>How to Store a Triangular Matrix.</title>
<pages>896-899</pages>
<year>1992</year>
<volume>41</volume>
<journal>IEEE Trans. Computers</journal>
<number>7</number>
<url>db/journals/tc/tc41.html#LaPaughLS92</url>
<ee>https://doi.org/10.1109/12.256446</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/12.256446</ee>
</article>
</r>
<r><article key="journals/algorithmica/LaPaughL91" mdate="2017-05-17">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="l/FrankThomsonLeighton">Frank Thomson Leighton</author>
<title>Editors' Introduction.</title>
<pages>1-3</pages>
<year>1991</year>
<volume>6</volume>
<journal>Algorithmica</journal>
<number>1</number>
<url>db/journals/algorithmica/algorithmica6.html#LaPaughL91</url>
<ee>https://doi.org/10.1007/BF01759031</ee>
</article>
</r>
<r><inproceedings key="conf/dac/DoukasL91" mdate="2018-11-06">
<author pid="11/5250">Dimitris Doukas</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>CLOVER: A Timing Constraints Verification System.</title>
<pages>662-667</pages>
<year>1991</year>
<crossref>conf/dac/1991</crossref>
<booktitle>DAC</booktitle>
<ee>https://doi.org/10.1145/127601.127747</ee>
<url>db/conf/dac/dac91.html#DoukasL91</url>
</inproceedings>
</r>
<r><inproceedings key="conf/rsp/LaPaughW90" mdate="2023-03-23">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="376/6566">Wayne H. Wolf</author>
<title>Issues in synthesis of board-level systems.</title>
<pages>157</pages>
<year>1990</year>
<booktitle>RSP</booktitle>
<ee>https://doi.org/10.1109/IWRSP.1990.144050</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IWRSP.1990.144050</ee>
<crossref>conf/rsp/1990</crossref>
<url>db/conf/rsp/rsp1990.html#LaPaughW90</url>
</inproceedings>
</r>
<r><article key="journals/siamcomp/CoffmanGJL85" mdate="2025-05-26">
<author pid="c/EdwardGCoffmanJr">Edward G. Coffman Jr.</author>
<author pid="g/MRGarey">M. R. Garey</author>
<author pid="j/DavidSJohnson">David S. Johnson 0001</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>Scheduling File Transfers.</title>
<pages>744-780</pages>
<year>1985</year>
<volume>14</volume>
<journal>SIAM J. Comput.</journal>
<number>3</number>
<url>db/journals/siamcomp/siamcomp14.html#CoffmanGJL85</url>
<ee>https://doi.org/10.1137/0214054</ee>
</article>
</r>
<r><article key="journals/networks/LapaughP84" mdate="2017-05-28">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="p/CHPapadimitriou">Christos H. Papadimitriou</author>
<title>The even-path problem for graphs and digraphs.</title>
<pages>507-513</pages>
<year>1984</year>
<volume>14</volume>
<journal>Networks</journal>
<number>4</number>
<ee>https://doi.org/10.1002/net.3230140403</ee>
<url>db/journals/networks/networks14.html#LapaughP84</url>
</article>
</r>
<r><inproceedings key="conf/dac/LaPaughL83" mdate="2012-03-01">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="l/RichardJLipton">Richard J. Lipton</author>
<title>Total stuct-at-fault testing by circuit transformation.</title>
<pages>713-716</pages>
<year>1983</year>
<booktitle>DAC</booktitle>
<ee>http://dl.acm.org/citation.cfm?id=800748</ee>
<crossref>conf/dac/1983</crossref>
<url>db/conf/dac/dac1983.html#LaPaughL83</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icassp/CappelloLS83" mdate="2017-05-19">
<author pid="49/4644">Peter R. Cappello</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="s/KennethSteiglitz">Kenneth Steiglitz</author>
<title>Optimal choice of intermediate latching to maximize throughput in VLSI circuits.</title>
<pages>935-938</pages>
<year>1983</year>
<booktitle>ICASSP</booktitle>
<ee>https://doi.org/10.1109/ICASSP.1983.1172150</ee>
<crossref>conf/icassp/1983</crossref>
<url>db/conf/icassp/icassp1983.html#CappelloLS83</url>
</inproceedings>
</r>
<r><inproceedings key="conf/itc/LaPaughL83" mdate="2002-11-05">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="l/RichardJLipton">Richard J. Lipton</author>
<title>Total Fault Testing Using the Bipartite Transformation.</title>
<pages>428-434</pages>
<year>1983</year>
<crossref>conf/itc/1983</crossref>
<booktitle>ITC</booktitle>
<url>db/conf/itc/itc1983.html#LaPaughL83</url>
</inproceedings>
</r>
<r><inproceedings key="conf/podc/CoffmanGJL83" mdate="2025-05-26">
<author pid="c/EdwardGCoffmanJr">Edward G. Coffman Jr.</author>
<author pid="g/MRGarey">M. R. Garey</author>
<author pid="j/DavidSJohnson">David S. Johnson 0001</author>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<title>Scheduling File Transfers in a Distributed Network.</title>
<pages>254-266</pages>
<year>1983</year>
<crossref>conf/podc/1983</crossref>
<booktitle>PODC</booktitle>
<url>db/conf/podc/podc83.html#CoffmanGJL83</url>
<ee>https://doi.org/10.1145/800221.806726</ee>
<ee>https://www.wikidata.org/entity/Q130995356</ee>
</inproceedings>
</r>
<r><article key="journals/jcss/LapaughR80" mdate="2021-02-16">
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="r/RonaldLRivest">Ronald L. Rivest</author>
<title>The Subgraph Homeomorphism Problem.</title>
<pages>133-149</pages>
<year>1980</year>
<volume>20</volume>
<journal>J. Comput. Syst. Sci.</journal>
<number>2</number>
<url>db/journals/jcss/jcss20.html#LapaughR80</url>
<ee type="oa">https://doi.org/10.1016/0022-0000(80)90057-4</ee>
<ee>https://www.wikidata.org/entity/Q56235097</ee>
</article>
</r>
<r><inproceedings key="conf/focs/LaPaugh80" mdate="2023-03-23">
<title>A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract)</title>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<pages>282-293</pages>
<crossref>conf/focs/FOCS21</crossref>
<year>1980</year>
<booktitle>FOCS</booktitle>
<url>db/conf/focs/focs80.html#LaPaugh80</url>
<ee>https://doi.org/10.1109/SFCS.1980.7</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/SFCS.1980.7</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/LapaughR78" mdate="2018-11-06">
<title>The Subgraph Homeomorphism Problem</title>
<author pid="l/ASLaPaugh">Andrea S. LaPaugh</author>
<author pid="r/RonaldLRivest">Ronald L. Rivest</author>
<pages>40-50</pages>
<crossref>conf/stoc/STOC10</crossref>
<year>1978</year>
<booktitle>STOC</booktitle>
<url>db/conf/stoc/stoc78.html#LapaughR78</url>
<ee>https://doi.org/10.1145/800133.804330</ee>
</inproceedings>
</r>
<coauthors n="20" nc="2">
<co c="-1"><na f="a/Ali:Muneeb" pid="84/6951">Muneeb Ali</na></co>
<co c="0"><na f="c/Cappello:Peter_R=" pid="49/4644">Peter R. Cappello</na></co>
<co c="0"><na f="c/Chao:Liang=Fang" pid="36/6851">Liang-Fang Chao</na></co>
<co c="1"><na f="c/Chen_0001:Mao" pid="c/MaoChen-1">Mao Chen 0001</na></co>
<co c="0"><na f="c/Coffman_Jr=:Edward_G=" pid="c/EdwardGCoffmanJr">Edward G. Coffman Jr.</na></co>
<co c="-1"><na f="d/Doukas:Dimitris" pid="11/5250">Dimitris Doukas</na></co>
<co c="0" n="2"><na f="e/Ellen:Faith" pid="f/FEFich">Faith Ellen</na><na>Faith E. Fich</na></co>
<co c="0"><na f="g/Garey:M=_R=" pid="g/MRGarey">M. R. Garey</na></co>
<co c="0"><na f="g/Gum:Ben" pid="46/6504">Ben Gum</na></co>
<co c="0"><na f="j/Johnson_0001:David_S=" pid="j/DavidSJohnson">David S. Johnson 0001</na></co>
<co c="0"><na f="l/Leighton:Frank_Thomson" pid="l/FrankThomsonLeighton">Frank Thomson Leighton</na></co>
<co c="0"><na f="l/Lipton:Richard_J=" pid="l/RichardJLipton">Richard J. Lipton</na></co>
<co c="0"><na f="p/Papadimitriou:Christos_H=" pid="p/CHPapadimitriou">Christos H. Papadimitriou</na></co>
<co c="0"><na f="p/Pinter:Ron_Y=" pid="79/2997">Ron Y. Pinter</na></co>
<co c="0"><na f="r/Rivest:Ronald_L=" pid="r/RonaldLRivest">Ronald L. Rivest</na></co>
<co c="0"><na f="s/Sandberg:Jonathan_S=" pid="22/3132">Jonathan S. Sandberg</na></co>
<co c="0" n="2"><na f="s/Sha:Edwin_H==M=" pid="27/2376">Edwin H.-M. Sha</na><na>Edwin Hsing-Mean Sha</na></co>
<co c="1"><na f="s/Singh:Jaswinder_Pal" pid="s/JaswinderPalSingh">Jaswinder Pal Singh</na></co>
<co c="0"><na f="s/Steiglitz:Kenneth" pid="s/KennethSteiglitz">Kenneth Steiglitz</na></co>
<co c="-1" n="2"><na f="w/Wolf:Marilyn" pid="376/6566">Marilyn Wolf</na><na>Wayne H. Wolf</na></co>
</coauthors>
</dblpperson>

