Computer Science May 2002

<!DOCTYPE html> <html lang="en"> <head> <title>Computer Science May 2002</title> <meta name="viewport" content="width=device-width, initial-scale=1"> <link rel="apple-touch-icon" sizes="180x180" href="/static/browse/0.3.4/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="/static/browse/0.3.4/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="/static/browse/0.3.4/images/icons/favicon-16x16.png"> <link rel="manifest" href="/static/browse/0.3.4/images/icons/site.webmanifest"> <link rel="mask-icon" href="/static/browse/0.3.4/images/icons/safari-pinned-tab.svg" color="#5bbad5"> <meta name="msapplication-TileColor" content="#da532c"> <meta name="theme-color" content="#ffffff"> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/arXiv.css?v=20241206" /> <link rel="stylesheet" type="text/css" media="print" href="/static/browse/0.3.4/css/arXiv-print.css?v=20200611" /> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/browse_search.css" /> <script language="javascript" src="/static/browse/0.3.4/js/accordion.js" /></script> <script src="/static/browse/0.3.4/js/mathjaxToggle.min.js" type="text/javascript"></script> <script type="text/javascript" language="javascript">mathjaxToggle();</script> </head> <body class="with-cu-identity"> <div class="flex-wrap-footer"> <header> <a href="#content" class="is-sr-only">Skip to main content</a>  <div class="columns is-vcentered is-hidden-mobile" id="cu-identity"> <div class="column" id="cu-logo"> <a href="https://www.cornell.edu/"><img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University" /></a> </div><div class="column" id="support-ack"> <span id="support-ack-url">We gratefully acknowledge support from the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors.</span> <a href="https://info.arxiv.org/about/donate.html" class="btn-header-donate">Donate</a> </div> </div> <div id="header" class="is-hidden-mobile"> <a aria-hidden="true" tabindex="-1" href="/IgnoreMe"></a> <div class="header-breadcrumbs"> <a href="/"><img src="/static/browse/0.3.4/images/arxiv-logo-one-color-white.svg" alt="arxiv logo" style="height:40px;"/></a> <span>></span> <a href="/list/cs/recent">cs</a> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div> <div class="mobile-header"> <div class="columns is-mobile"> <div class="column logo-arxiv"><a href="https://arxiv.org/"><img src="/static/browse/0.3.4/images/arxiv-logomark-small-white.svg" alt="arXiv logo" style="height:60px;" /></a></div> <div class="column logo-cornell"><a href="https://www.cornell.edu/"> <picture> <source media="(min-width: 501px)" srcset="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg 400w" sizes="400w" /> <source srcset="/static/browse/0.3.4/images/icons/cu/cornell_seal_simple_black.svg 2x" /> <img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University Logo" /> </picture> </a></div> <div class="column nav" id="toggle-container" role="menubar"> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-white"><title>open search</title><path d="M505 442.7L405.3 343c-4.5-4.5-10.6-7-17-7H372c27.6-35.3 44-79.7 44-128C416 93.1 322.9 0 208 0S0 93.1 0 208s93.1 208 208 208c48.3 0 92.7-16.4 128-44v16.3c0 6.4 2.5 12.5 7 17l99.7 99.7c9.4 9.4 24.6 9.4 33.9 0l28.3-28.3c9.4-9.4 9.4-24.6.1-34zM208 336c-70.7 0-128-57.2-128-128 0-70.7 57.2-128 128-128 70.7 0 128 57.2 128 128 0 70.7-57.2 128-128 128z"/></svg></button> <div class="mobile-toggle-block toggle-target"> <form class="mobile-search-form" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <input class="input" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <input type="hidden" name="source" value="header"> <input type="hidden" name="searchtype" value="all"> <button class="button">GO</button> </div> </form> </div> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-white" role="menu"><title>open navigation menu</title><path d="M16 132h416c8.837 0 16-7.163 16-16V76c0-8.837-7.163-16-16-16H16C7.163 60 0 67.163 0 76v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16z"/ ></svg></button> <div class="mobile-toggle-block toggle-target"> <nav class="mobile-menu" aria-labelledby="mobilemenulabel"> <h2 id="mobilemenulabel">quick links</h2> <ul> <li><a href="https://arxiv.org/login">Login</a></li> <li><a href="https://info.arxiv.org/help">Help Pages</a></li> <li><a href="https://info.arxiv.org/about">About</a></li> </ul> </nav> </div> </div> </div> </div> </header> <main> <div id="content"> <div id='content-inner'> <div id='dlpage'> <h1>Computer Science</h1> <h2>Authors and titles for May 2002 </h2> <div class='paging'>Total of 95 entries : <span>1-50</span> <a href=/list/cs/2002-05?skip=50&show=50>51-95</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs/2002-05?skip=0&show=25 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <a href=/list/cs/2002-05?skip=0&show=2000 rel="nofollow"> all</a> </div> <dl id='articles'> <dt> <a name='item1'>[1]</a> <a href ="/abs/cs/0205001" title="Abstract" id="cs/0205001"> arXiv:cs/0205001 </a> [<a href="/pdf/cs/0205001" title="Download PDF" id="pdf-cs/0205001" aria-labelledby="pdf-cs/0205001">pdf</a>, <a href="/format/cs/0205001" title="Other formats" id="oth-cs/0205001" aria-labelledby="oth-cs/0205001">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Calculus for End-to-end Statistical Service Guarantees </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Burchard,+A">A. Burchard</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Liebeherr,+J">J. Liebeherr</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Patek,+S+D">S. D. Patek</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 21 pages, 2 figures. Revisions in Theorem 5 and Section 4 </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Transactions on Information Theory 52:4105-4114 (2006) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Networking and Internet Architecture (cs.NI)</span> </div> </div> </dd> <dt> <a name='item2'>[2]</a> <a href ="/abs/cs/0205002" title="Abstract" id="cs/0205002"> arXiv:cs/0205002 </a> [<a href="/pdf/cs/0205002" title="Download PDF" id="pdf-cs/0205002" aria-labelledby="pdf-cs/0205002">pdf</a>, <a href="/format/cs/0205002" title="Other formats" id="oth-cs/0205002" aria-labelledby="oth-cs/0205002">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Polynomial Description of the Rijndael Advanced Encryption Standard </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Rosenthal,+J">Joachim Rosenthal</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 12 pages, LaTeX </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Cryptography and Security (cs.CR)</span>; Commutative Algebra (math.AC); Rings and Algebras (math.RA) </div> </div> </dd> <dt> <a name='item3'>[3]</a> <a href ="/abs/cs/0205003" title="Abstract" id="cs/0205003"> arXiv:cs/0205003 </a> [<a href="/pdf/cs/0205003" title="Download PDF" id="pdf-cs/0205003" aria-labelledby="pdf-cs/0205003">pdf</a>, <a href="/format/cs/0205003" title="Other formats" id="oth-cs/0205003" aria-labelledby="oth-cs/0205003">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The prospects for mathematical logic in the twenty-first century </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Buss,+S+R">Samuel R. Buss</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kechris,+A+S">Alexander S. Kechris</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pillay,+A">Anand Pillay</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shore,+R+A">Richard A. Shore</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Association for Symbolic Logic </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Bulletin of Symbolic Logic 7 (2001) 169-196 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Logic in Computer Science (cs.LO)</span> </div> </div> </dd> <dt> <a name='item4'>[4]</a> <a href ="/abs/cs/0205004" title="Abstract" id="cs/0205004"> arXiv:cs/0205004 </a> [<a href="/pdf/cs/0205004" title="Download PDF" id="pdf-cs/0205004" aria-labelledby="pdf-cs/0205004">pdf</a>, <a href="/format/cs/0205004" title="Other formats" id="oth-cs/0205004" aria-labelledby="oth-cs/0205004">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Weaves: A Novel Direct Code Execution Interface for Parallel High Performance Scientific Codes </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Varadarajan,+S">Srinidhi Varadarajan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mukherjee,+J">Joy Mukherjee</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ramakrishnan,+N">Naren Ramakrishnan</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Distributed, Parallel, and Cluster Computing (cs.DC)</span>; Performance (cs.PF) </div> </div> </dd> <dt> <a name='item5'>[5]</a> <a href ="/abs/cs/0205005" title="Abstract" id="cs/0205005"> arXiv:cs/0205005 </a> [<a href="/pdf/cs/0205005" title="Download PDF" id="pdf-cs/0205005" aria-labelledby="pdf-cs/0205005">pdf</a>, <a href="/format/cs/0205005" title="Other formats" id="oth-cs/0205005" aria-labelledby="oth-cs/0205005">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hearn,+R+A">Robert A. Hearn</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Demaine,+E+D">Erik D. Demaine</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 19 pages, 16 figures. Version 4 adds token formulation and minor corrections. To appear in Theoretical Computer Science </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Complexity (cs.CC)</span>; Computer Science and Game Theory (cs.GT) </div> </div> </dd> <dt> <a name='item6'>[6]</a> <a href ="/abs/cs/0205006" title="Abstract" id="cs/0205006"> arXiv:cs/0205006 </a> [<a href="/pdf/cs/0205006" title="Download PDF" id="pdf-cs/0205006" aria-labelledby="pdf-cs/0205006">pdf</a>, <a href="/format/cs/0205006" title="Other formats" id="oth-cs/0205006" aria-labelledby="oth-cs/0205006">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Unsupervised discovery of morphologically related words based on orthographic and semantic similarity </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Baroni,+M">Marco Baroni</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Matiasek,+J">Johannes Matiasek</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Trost,+H">Harald Trost</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 10 pages, to appear in the Proceedings of the Morphology/Phonology Learning Workshop of ACL-02 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation and Language (cs.CL)</span> </div> </div> </dd> <dt> <a name='item7'>[7]</a> <a href ="/abs/cs/0205007" title="Abstract" id="cs/0205007"> arXiv:cs/0205007 </a> [<a href="/pdf/cs/0205007" title="Download PDF" id="pdf-cs/0205007" aria-labelledby="pdf-cs/0205007">pdf</a>, <a href="/format/cs/0205007" title="Other formats" id="oth-cs/0205007" aria-labelledby="oth-cs/0205007">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On-Line Paging against Adversarially Biased Random Inputs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Conference version appeared in SODA '98 as "Bounding the Diffuse Adversary" </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> J. Algorithms 37(1) pp 218-235 (2000) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Complexity (cs.CC) </div> </div> </dd> <dt> <a name='item8'>[8]</a> <a href ="/abs/cs/0205008" title="Abstract" id="cs/0205008"> arXiv:cs/0205008 </a> [<a href="/pdf/cs/0205008" title="Download PDF" id="pdf-cs/0205008" aria-labelledby="pdf-cs/0205008">pdf</a>, <a href="/format/cs/0205008" title="Other formats" id="oth-cs/0205008" aria-labelledby="oth-cs/0205008">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Improved Bicriteria Existence Theorems for Scheduling </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Aslam,+J">Javed Aslam</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rasala,+A">April Rasala</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Stein,+C">Cliff Stein</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N">Neal Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> ACM-SIAM Symposium on Discrete Algorithms, pp. 846-847 (1999) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Complexity (cs.CC) </div> </div> </dd> <dt> <a name='item9'>[9]</a> <a href ="/abs/cs/0205009" title="Abstract" id="cs/0205009"> arXiv:cs/0205009 </a> [<a href="/pdf/cs/0205009" title="Download PDF" id="pdf-cs/0205009" aria-labelledby="pdf-cs/0205009">pdf</a>, <a href="/format/cs/0205009" title="Other formats" id="oth-cs/0205009" aria-labelledby="oth-cs/0205009">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ando,+R+K">Rie Kubota Ando</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lee,+L">Lillian Lee</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 22 pages. To appear in Natural Language Engineering </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Natural Language Engineering 9 (2), pp. 127--149, 2003 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation and Language (cs.CL)</span> </div> </div> </dd> <dt> <a name='item10'>[10]</a> <a href ="/abs/cs/0205010" title="Abstract" id="cs/0205010"> arXiv:cs/0205010 </a> [<a href="/pdf/cs/0205010" title="Download PDF" id="pdf-cs/0205010" aria-labelledby="pdf-cs/0205010">pdf</a>, <a href="/format/cs/0205010" title="Other formats" id="oth-cs/0205010" aria-labelledby="oth-cs/0205010">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Approximate Data Structures with Applications </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Matias,+Y">Yossi Matias</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vitter,+J">Jeff Vitter</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N">Neal Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> ACM-SIAM Symposium on Discrete Algorithms, pp. 187-194 (1994) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Complexity (cs.CC) </div> </div> </dd> <dt> <a name='item11'>[11]</a> <a href ="/abs/cs/0205011" title="Abstract" id="cs/0205011"> arXiv:cs/0205011 </a> [<a href="/pdf/cs/0205011" title="Download PDF" id="pdf-cs/0205011" aria-labelledby="pdf-cs/0205011">pdf</a>, <a href="/format/cs/0205011" title="Other formats" id="oth-cs/0205011" aria-labelledby="oth-cs/0205011">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On Strongly Connected Digraphs with Bounded Cycle Length </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Khuller,+S">Samir Khuller</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Raghavachari,+B">Balaji Raghavachari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N">Neal Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Discrete Applied Mathematics 69(3):281-289 (1996) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Complexity (cs.CC) </div> </div> </dd> <dt> <a name='item12'>[12]</a> <a href ="/abs/cs/0205012" title="Abstract" id="cs/0205012"> arXiv:cs/0205012 </a> [<a href="/pdf/cs/0205012" title="Download PDF" id="pdf-cs/0205012" aria-labelledby="pdf-cs/0205012">pdf</a>, <a href="/format/cs/0205012" title="Other formats" id="oth-cs/0205012" aria-labelledby="oth-cs/0205012">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Polynomial-Time Approximation Scheme for Data Broadcast </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kenyon,+C">Claire Kenyon</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Schabanel,+N">Nicolas Schabanel</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N">Neal Young</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Complexity (cs.CC) </div> </div> </dd> <dt> <a name='item13'>[13]</a> <a href ="/abs/cs/0205013" title="Abstract" id="cs/0205013"> arXiv:cs/0205013 </a> [<a href="/pdf/cs/0205013" title="Download PDF" id="pdf-cs/0205013" aria-labelledby="pdf-cs/0205013">pdf</a>, <a href="/format/cs/0205013" title="Other formats" id="oth-cs/0205013" aria-labelledby="oth-cs/0205013">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Computing stable models: worst-case performance estimates </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lonc,+Z">Zbigniew Lonc</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Truszczynski,+M">Miroslaw Truszczynski</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Paper published in the Proceedings of the International Conference on Logic Programming, ICLP-2002 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Logic in Computer Science (cs.LO)</span>; Artificial Intelligence (cs.AI) </div> </div> </dd> <dt> <a name='item14'>[14]</a> <a href ="/abs/cs/0205014" title="Abstract" id="cs/0205014"> arXiv:cs/0205014 </a> [<a href="/pdf/cs/0205014" title="Download PDF" id="pdf-cs/0205014" aria-labelledby="pdf-cs/0205014">pdf</a>, <a href="/format/cs/0205014" title="Other formats" id="oth-cs/0205014" aria-labelledby="oth-cs/0205014">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Ultimate approximations in nonmonotonic knowledge representation systems </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Denecker,+M">Marc Denecker</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Marek,+V+W">Victor W. Marek</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Truszczynski,+M">Miroslaw Truszczynski</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> This paper was published in Principles of Knowledge Representation and Reasoning, Proceedings of the Eighth International Conference (KR2002) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Artificial Intelligence (cs.AI)</span> </div> </div> </dd> <dt> <a name='item15'>[15]</a> <a href ="/abs/cs/0205015" title="Abstract" id="cs/0205015"> arXiv:cs/0205015 </a> [<a href="/pdf/cs/0205015" title="Download PDF" id="pdf-cs/0205015" aria-labelledby="pdf-cs/0205015">pdf</a>, <a href="/format/cs/0205015" title="Other formats" id="oth-cs/0205015" aria-labelledby="oth-cs/0205015">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Instabilities of Robot Motion </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Farber,+M">Michael Farber</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 26 pages, 5 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Robotics (cs.RO)</span>; Computational Geometry (cs.CG); Algebraic Topology (math.AT) </div> </div> </dd> <dt> <a name='item16'>[16]</a> <a href ="/abs/cs/0205016" title="Abstract" id="cs/0205016"> arXiv:cs/0205016 </a> [<a href="/pdf/cs/0205016" title="Download PDF" id="pdf-cs/0205016" aria-labelledby="pdf-cs/0205016">pdf</a>, <a href="/format/cs/0205016" title="Other formats" id="oth-cs/0205016" aria-labelledby="oth-cs/0205016">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> From Alife Agents to a Kingdom of N Queens </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Han,+J">Jing Han</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Liu,+J">Jiming Liu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Cai,+Q">Qingsheng Cai</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 13 pages, 9 figures, in 1999 international conference of Intelligent Agent Technology. Nominated for the best paper award </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> in Jiming Liu and Ning Zhong (Eds.), Intelligent Agent Technology: Systems, Methodologies, and Tools, page 110-120, The World Scientific Publishing Co. Pte, Ltd., Nov. 1999 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Artificial Intelligence (cs.AI)</span>; Data Structures and Algorithms (cs.DS); Multiagent Systems (cs.MA) </div> </div> </dd> <dt> <a name='item17'>[17]</a> <a href ="/abs/cs/0205017" title="Abstract" id="cs/0205017"> arXiv:cs/0205017 </a> [<a href="/pdf/cs/0205017" title="Download PDF" id="pdf-cs/0205017" aria-labelledby="pdf-cs/0205017">pdf</a>, <a href="/format/cs/0205017" title="Other formats" id="oth-cs/0205017" aria-labelledby="oth-cs/0205017">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Ellogon: A New Text Engineering Platform </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Petasis,+G">Georgios Petasis</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Karkaletsis,+V">Vangelis Karkaletsis</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Paliouras,+G">Georgios Paliouras</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Androutsopoulos,+I">Ion Androutsopoulos</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Spyropoulos,+C+D">Constantine D. Spyropoulos</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 7 pages, 9 figures. Will be presented to the Third International Conference on Language Resources and Evaluation - LREC 2002 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation and Language (cs.CL)</span> </div> </div> </dd> <dt> <a name='item18'>[18]</a> <a href ="/abs/cs/0205018" title="Abstract" id="cs/0205018"> arXiv:cs/0205018 </a> [<a href="/pdf/cs/0205018" title="Download PDF" id="pdf-cs/0205018" aria-labelledby="pdf-cs/0205018">pdf</a>, <a href="/format/cs/0205018" title="Other formats" id="oth-cs/0205018" aria-labelledby="oth-cs/0205018">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Typed Generic Traversal With Term Rewriting Strategies </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Laemmel,+R">Ralf Laemmel</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 85 pages, submitted for publication to the Journal of Logic and Algebraic Programming </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Programming Languages (cs.PL)</span> </div> </div> </dd> <dt> <a name='item19'>[19]</a> <a href ="/abs/cs/0205019" title="Abstract" id="cs/0205019"> arXiv:cs/0205019 </a> [<a href="/pdf/cs/0205019" title="Download PDF" id="pdf-cs/0205019" aria-labelledby="pdf-cs/0205019">pdf</a>, <a href="/format/cs/0205019" title="Other formats" id="oth-cs/0205019" aria-labelledby="oth-cs/0205019">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Distance function wavelets - Part I: Helmholtz and convection-diffusion transforms and series </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chen,+W">W. Chen</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Welcome any comments to wenc@simula.no </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Engineering, Finance, and Science (cs.CE)</span>; Numerical Analysis (math.NA) </div> </div> </dd> <dt> <a name='item20'>[20]</a> <a href ="/abs/cs/0205020" title="Abstract" id="cs/0205020"> arXiv:cs/0205020 </a> [<a href="/pdf/cs/0205020" title="Download PDF" id="pdf-cs/0205020" aria-labelledby="pdf-cs/0205020">pdf</a>, <a href="/format/cs/0205020" title="Other formats" id="oth-cs/0205020" aria-labelledby="oth-cs/0205020">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A quasi-RBF technique for numerical discretization of PDE's </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chen,+W">W. Chen</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Comments to wenc@simula.no </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Engineering, Finance, and Science (cs.CE)</span>; Computational Geometry (cs.CG) </div> </div> </dd> <dt> <a name='item21'>[21]</a> <a href ="/abs/cs/0205021" title="Abstract" id="cs/0205021"> arXiv:cs/0205021 </a> [<a href="/pdf/cs/0205021" title="Download PDF" id="pdf-cs/0205021" aria-labelledby="pdf-cs/0205021">pdf</a>, <a href="/format/cs/0205021" title="Other formats" id="oth-cs/0205021" aria-labelledby="oth-cs/0205021">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> An Overview of a Grid Architecture for Scientific Computing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=A.Waananen">A.Waananen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=M.Ellert">M.Ellert</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=A.Konstantinov">A.Konstantinov</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=B.Konya">B.Konya</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=O.Smirnova">O.Smirnova</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Distributed, Parallel, and Cluster Computing (cs.DC)</span> </div> </div> </dd> <dt> <a name='item22'>[22]</a> <a href ="/abs/cs/0205022" title="Abstract" id="cs/0205022"> arXiv:cs/0205022 </a> [<a href="/pdf/cs/0205022" title="Download PDF" id="pdf-cs/0205022" aria-labelledby="pdf-cs/0205022">pdf</a>, <a href="/format/cs/0205022" title="Other formats" id="oth-cs/0205022" aria-labelledby="oth-cs/0205022">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Traits of the Personable </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ramakrishnan,+N">Naren Ramakrishnan</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Artificial Intelligence (cs.AI)</span>; Information Retrieval (cs.IR) </div> </div> </dd> <dt> <a name='item23'>[23]</a> <a href ="/abs/cs/0205023" title="Abstract" id="cs/0205023"> arXiv:cs/0205023 </a> [<a href="/pdf/cs/0205023" title="Download PDF" id="pdf-cs/0205023" aria-labelledby="pdf-cs/0205023">pdf</a>, <a href="/format/cs/0205023" title="Other formats" id="oth-cs/0205023" aria-labelledby="oth-cs/0205023">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Performance evaluation of the GridFTP within the NorduGrid project </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=M.Ellert">M.Ellert</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=A.Konstantinov">A.Konstantinov</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=B.Konya">B.Konya</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=O.Smirnova">O.Smirnova</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=A.Waananen">A.Waananen</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Distributed, Parallel, and Cluster Computing (cs.DC)</span> </div> </div> </dd> <dt> <a name='item24'>[24]</a> <a href ="/abs/cs/0205024" title="Abstract" id="cs/0205024"> arXiv:cs/0205024 </a> [<a href="/pdf/cs/0205024" title="Download PDF" id="pdf-cs/0205024" aria-labelledby="pdf-cs/0205024">pdf</a>, <a href="/format/cs/0205024" title="Other formats" id="oth-cs/0205024" aria-labelledby="oth-cs/0205024">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A (non)static 0-order statistical model and its implementation for compressing virtually uncompressible data </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Vitchev,+E">Evgueniy Vitchev</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 7 pages, 1 figure </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item25'>[25]</a> <a href ="/abs/cs/0205025" title="Abstract" id="cs/0205025"> arXiv:cs/0205025 </a> [<a href="/pdf/cs/0205025" title="Download PDF" id="pdf-cs/0205025" aria-labelledby="pdf-cs/0205025">pdf</a>, <a href="/format/cs/0205025" title="Other formats" id="oth-cs/0205025" aria-labelledby="oth-cs/0205025">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Bootstrapping Structure into Language: Alignment-Based Learning </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=van+Zaanen,+M+M">Menno M. van Zaanen</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 148 pages </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Machine Learning (cs.LG)</span>; Computation and Language (cs.CL) </div> </div> </dd> <dt> <a name='item26'>[26]</a> <a href ="/abs/cs/0205026" title="Abstract" id="cs/0205026"> arXiv:cs/0205026 </a> [<a href="/pdf/cs/0205026" title="Download PDF" id="pdf-cs/0205026" aria-labelledby="pdf-cs/0205026">pdf</a>, <a href="/format/cs/0205026" title="Other formats" id="oth-cs/0205026" aria-labelledby="oth-cs/0205026">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Monads for natural language semantics </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Shan,+C">Chung-chieh Shan</a> (Harvard University)</div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 14 pages </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Proceedings of the 2001 European Summer School in Logic, Language and Information student session, ed. Kristina Striegnitz, 285-298 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation and Language (cs.CL)</span>; Programming Languages (cs.PL) </div> </div> </dd> <dt> <a name='item27'>[27]</a> <a href ="/abs/cs/0205027" title="Abstract" id="cs/0205027"> arXiv:cs/0205027 </a> [<a href="/pdf/cs/0205027" title="Download PDF" id="pdf-cs/0205027" aria-labelledby="pdf-cs/0205027">pdf</a>, <a href="/format/cs/0205027" title="Other formats" id="oth-cs/0205027" aria-labelledby="oth-cs/0205027">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A variable-free dynamic semantics </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Shan,+C">Chung-chieh Shan</a> (Harvard University)</div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 6 pages </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Proceedings of the 13th Amsterdam Colloquium, ed. Robert van Rooy and Martin Stokhof, 204-209 (2001) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation and Language (cs.CL)</span> </div> </div> </dd> <dt> <a name='item28'>[28]</a> <a href ="/abs/cs/0205028" title="Abstract" id="cs/0205028"> arXiv:cs/0205028 </a> [<a href="/pdf/cs/0205028" title="Download PDF" id="pdf-cs/0205028" aria-labelledby="pdf-cs/0205028">pdf</a>, <a href="/format/cs/0205028" title="Other formats" id="oth-cs/0205028" aria-labelledby="oth-cs/0205028">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> NLTK: The Natural Language Toolkit </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Loper,+E">Edward Loper</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Bird,+S">Steven Bird</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 8 pages, 1 figure, Proceedings of the ACL Workshop on Effective Tools and Methodologies for Teaching Natural Language Processing and Computational Linguistics, Philadelphia, July 2002, Association for Computational Linguistics </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation and Language (cs.CL)</span> </div> </div> </dd> <dt> <a name='item29'>[29]</a> <a href ="/abs/cs/0205029" title="Abstract" id="cs/0205029"> arXiv:cs/0205029 </a> [<a href="/pdf/cs/0205029" title="Download PDF" id="pdf-cs/0205029" aria-labelledby="pdf-cs/0205029">pdf</a>, <a href="/format/cs/0205029" title="Other formats" id="oth-cs/0205029" aria-labelledby="oth-cs/0205029">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Codebook Generation Algorithm for Document Image Compression </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Zhang,+Q">Qin Zhang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Danskin,+J">John Danskin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N">Neal Young</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item30'>[30]</a> <a href ="/abs/cs/0205030" title="Abstract" id="cs/0205030"> arXiv:cs/0205030 </a> [<a href="/pdf/cs/0205030" title="Download PDF" id="pdf-cs/0205030" aria-labelledby="pdf-cs/0205030">pdf</a>, <a href="/format/cs/0205030" title="Other formats" id="oth-cs/0205030" aria-labelledby="oth-cs/0205030">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Approximation Algorithms for Covering/Packing Integer Programs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kolliopoulos,+S+G">Stavros G. Kolliopoulos</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Preliminary version appeared in IEEE Symposium on Foundations of Computer Science (2001). To appear in Journal of Computer and System Sciences </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Journal of Computer and System Sciences 71(4):495-505(2005) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item31'>[31]</a> <a href ="/abs/cs/0205031" title="Abstract" id="cs/0205031"> arXiv:cs/0205031 </a> [<a href="/pdf/cs/0205031" title="Download PDF" id="pdf-cs/0205031" aria-labelledby="pdf-cs/0205031">pdf</a>, <a href="/format/cs/0205031" title="Other formats" id="oth-cs/0205031" aria-labelledby="oth-cs/0205031">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Lecture Notes on Evasiveness of Graph Properties </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lovasz,+L">Laszlo Lovasz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Tech. Rep. CS-TR-317-91, Computer Science Dept., Princeton University </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Complexity (cs.CC)</span> </div> </div> </dd> <dt> <a name='item32'>[32]</a> <a href ="/abs/cs/0205032" title="Abstract" id="cs/0205032"> arXiv:cs/0205032 </a> [<a href="/pdf/cs/0205032" title="Download PDF" id="pdf-cs/0205032" aria-labelledby="pdf-cs/0205032">pdf</a>, <a href="/format/cs/0205032" title="Other formats" id="oth-cs/0205032" aria-labelledby="oth-cs/0205032">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On-Line End-to-End Congestion Control </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Garg,+N">Naveen Garg</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Proceedings IEEE Symp. Foundations of Computer Science, 2002 </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> The 43rd Annual IEEE Symposium on Foundations of Computer Science, 303-310 (2002) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Complexity (cs.CC); Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item33'>[33]</a> <a href ="/abs/cs/0205033" title="Abstract" id="cs/0205033"> arXiv:cs/0205033 </a> [<a href="/pdf/cs/0205033" title="Download PDF" id="pdf-cs/0205033" aria-labelledby="pdf-cs/0205033">pdf</a>, <a href="/format/cs/0205033" title="Other formats" id="oth-cs/0205033" aria-labelledby="oth-cs/0205033">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On-Line File Caching </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> ACM-SIAM Symposium on Discrete Algorithms (1998) </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Algorithmica 33:371-383 (2002) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Complexity (cs.CC); Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item34'>[34]</a> <a href ="/abs/cs/0205034" title="Abstract" id="cs/0205034"> arXiv:cs/0205034 </a> [<a href="/pdf/cs/0205034" title="Download PDF" id="pdf-cs/0205034" aria-labelledby="pdf-cs/0205034">pdf</a>, <a href="/format/cs/0205034" title="Other formats" id="oth-cs/0205034" aria-labelledby="oth-cs/0205034">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Data-Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lupton,+R">Robert Lupton</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Maley,+M">Miller Maley</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N">Neal Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> proceedings version appeared in ACM-SIAM Symposium on Discrete Algorithms (1998) </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Journal of Algorithms 27(2):339-356 (1998) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Engineering, Finance, and Science (cs.CE) </div> </div> </dd> <dt> <a name='item35'>[35]</a> <a href ="/abs/cs/0205035" title="Abstract" id="cs/0205035"> arXiv:cs/0205035 </a> [<a href="/pdf/cs/0205035" title="Download PDF" id="pdf-cs/0205035" aria-labelledby="pdf-cs/0205035">pdf</a>, <a href="/format/cs/0205035" title="Other formats" id="oth-cs/0205035" aria-labelledby="oth-cs/0205035">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lipton,+R">Richard Lipton</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> ACM Symposium on Theory of Computing (1994) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Complexity (cs.CC)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item36'>[36]</a> <a href ="/abs/cs/0205036" title="Abstract" id="cs/0205036"> arXiv:cs/0205036 </a> [<a href="/pdf/cs/0205036" title="Download PDF" id="pdf-cs/0205036" aria-labelledby="pdf-cs/0205036">pdf</a>, <a href="/format/cs/0205036" title="Other formats" id="oth-cs/0205036" aria-labelledby="oth-cs/0205036">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Randomized Rounding without Solving the Linear Program </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> ACM-SIAM Symposium on Discrete Algorithms (1995) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item37'>[37]</a> <a href ="/abs/cs/0205037" title="Abstract" id="cs/0205037"> arXiv:cs/0205037 </a> [<a href="/pdf/cs/0205037" title="Download PDF" id="pdf-cs/0205037" aria-labelledby="pdf-cs/0205037">pdf</a>, <a href="/format/cs/0205037" title="Other formats" id="oth-cs/0205037" aria-labelledby="oth-cs/0205037">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Khuller,+S">Samir Khuller</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vishkin,+U">Uzi Vishkin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N">Neal Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> conference version appeared in IPCO'93 </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Journal of Algorithms 17(2):280-289 (1994) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Distributed, Parallel, and Cluster Computing (cs.DC) </div> </div> </dd> <dt> <a name='item38'>[38]</a> <a href ="/abs/cs/0205038" title="Abstract" id="cs/0205038"> arXiv:cs/0205038 </a> [<a href="/pdf/cs/0205038" title="Download PDF" id="pdf-cs/0205038" aria-labelledby="pdf-cs/0205038">pdf</a>, <a href="/format/cs/0205038" title="Other formats" id="oth-cs/0205038" aria-labelledby="oth-cs/0205038">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Competitive Paging Algorithms </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Fiat,+A">Amos Fiat</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Karp,+R">Richard Karp</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Luby,+M">Mike Luby</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=McGeoch,+L">Lyle McGeoch</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sleator,+D">Daniel Sleator</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Journal of Algorithms 12:685-699 (1991) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item39'>[39]</a> <a href ="/abs/cs/0205039" title="Abstract" id="cs/0205039"> arXiv:cs/0205039 </a> [<a href="/pdf/cs/0205039" title="Download PDF" id="pdf-cs/0205039" aria-labelledby="pdf-cs/0205039">pdf</a>, <a href="/format/cs/0205039" title="Other formats" id="oth-cs/0205039" aria-labelledby="oth-cs/0205039">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Sequential and Parallel Algorithms for Mixed Packing and Covering </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item40'>[40]</a> <a href ="/abs/cs/0205040" title="Abstract" id="cs/0205040"> arXiv:cs/0205040 </a> [<a href="/pdf/cs/0205040" title="Download PDF" id="pdf-cs/0205040" aria-labelledby="pdf-cs/0205040">pdf</a>, <a href="/format/cs/0205040" title="Other formats" id="oth-cs/0205040" aria-labelledby="oth-cs/0205040">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Approximating the Minimum Equivalent Digraph </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Khuller,+S">Samir Khuller</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Raghavachari,+B">Balaji Raghavachari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> conference version in ACM-SIAM Symposium on Discrete Algorithms (1994) </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> SIAM J. Computing 24(4):859-872 (1995) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item41'>[41]</a> <a href ="/abs/cs/0205041" title="Abstract" id="cs/0205041"> arXiv:cs/0205041 </a> [<a href="/pdf/cs/0205041" title="Download PDF" id="pdf-cs/0205041" aria-labelledby="pdf-cs/0205041">pdf</a>, <a href="/format/cs/0205041" title="Other formats" id="oth-cs/0205041" aria-labelledby="oth-cs/0205041">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Faster Parametric Shortest Path and Minimum Balance Algorithms </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N">Neal Young</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tarjan,+R">Robert Tarjan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Orlin,+J">James Orlin</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Networks 21(2):205-221 (1991) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item42'>[42]</a> <a href ="/abs/cs/0205042" title="Abstract" id="cs/0205042"> arXiv:cs/0205042 </a> [<a href="/pdf/cs/0205042" title="Download PDF" id="pdf-cs/0205042" aria-labelledby="pdf-cs/0205042">pdf</a>, <a href="/format/cs/0205042" title="Other formats" id="oth-cs/0205042" aria-labelledby="oth-cs/0205042">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Orienting Graphs to Optimize Reachability </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hakimi,+S+L">S. L. Hakimi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Schmeichel,+E">E. Schmeichel</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Information Processing Letters 63:229-235 (1997) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item43'>[43]</a> <a href ="/abs/cs/0205043" title="Abstract" id="cs/0205043"> arXiv:cs/0205043 </a> [<a href="/pdf/cs/0205043" title="Download PDF" id="pdf-cs/0205043" aria-labelledby="pdf-cs/0205043">pdf</a>, <a href="/format/cs/0205043" title="Other formats" id="oth-cs/0205043" aria-labelledby="oth-cs/0205043">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Low-Degree Spanning Trees of Small Weight </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Khuller,+S">Samir Khuller</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Raghavachari,+B">Balaji Raghavachari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> conference version in Symposium on Theory of Computing (1994) </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> SIAM J. Computing 25(2):355-368 (1996) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item44'>[44]</a> <a href ="/abs/cs/0205044" title="Abstract" id="cs/0205044"> arXiv:cs/0205044 </a> [<a href="/pdf/cs/0205044" title="Download PDF" id="pdf-cs/0205044" aria-labelledby="pdf-cs/0205044">pdf</a>, <a href="/format/cs/0205044" title="Other formats" id="oth-cs/0205044" aria-labelledby="oth-cs/0205044">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The K-Server Dual and Loose Competitiveness for Paging </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> conference version: "On-Line Caching as Cache Size Varies", SODA (1991) </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Algorithmica 11(6):525-541 (1994) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item45'>[45]</a> <a href ="/abs/cs/0205045" title="Abstract" id="cs/0205045"> arXiv:cs/0205045 </a> [<a href="/pdf/cs/0205045" title="Download PDF" id="pdf-cs/0205045" aria-labelledby="pdf-cs/0205045">pdf</a>, <a href="/format/cs/0205045" title="Other formats" id="oth-cs/0205045" aria-labelledby="oth-cs/0205045">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Balancing Minimum Spanning and Shortest Path Trees </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Khuller,+S">Samir Khuller</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Raghavachari,+B">Balaji Raghavachari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> conference version: ACM-SIAM Symposium on Discrete Algorithms (1993) </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Algorithmica 14(4):305-322 (1995) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item46'>[46]</a> <a href ="/abs/cs/0205046" title="Abstract" id="cs/0205046"> arXiv:cs/0205046 </a> [<a href="/pdf/cs/0205046" title="Download PDF" id="pdf-cs/0205046" aria-labelledby="pdf-cs/0205046">pdf</a>, <a href="/format/cs/0205046" title="Other formats" id="oth-cs/0205046" aria-labelledby="oth-cs/0205046">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Klein,+P">Phil Klein</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> LNCS 1610 (IPCO): 320-327 (1999); SIAM Journal on Computing 44(4):1154-1172(2015) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Complexity (cs.CC) </div> </div> </dd> <dt> <a name='item47'>[47]</a> <a href ="/abs/cs/0205047" title="Abstract" id="cs/0205047"> arXiv:cs/0205047 </a> [<a href="/pdf/cs/0205047" title="Download PDF" id="pdf-cs/0205047" aria-labelledby="pdf-cs/0205047">pdf</a>, <a href="/format/cs/0205047" title="Other formats" id="oth-cs/0205047" aria-labelledby="oth-cs/0205047">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> K-Medians, Facility Location, and the Chernoff-Wald Bound </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> ACM-SIAM Symposium on Discrete Algorithms (2000) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item48'>[48]</a> <a href ="/abs/cs/0205048" title="Abstract" id="cs/0205048"> arXiv:cs/0205048 </a> [<a href="/pdf/cs/0205048" title="Download PDF" id="pdf-cs/0205048" aria-labelledby="pdf-cs/0205048">pdf</a>, <a href="/format/cs/0205048" title="Other formats" id="oth-cs/0205048" aria-labelledby="oth-cs/0205048">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Golin,+M">Mordecai Golin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mathieu,+C">Claire Mathieu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> SIAM Journal on Computing 41(3):684-713(2012) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item49'>[49]</a> <a href ="/abs/cs/0205049" title="Abstract" id="cs/0205049"> arXiv:cs/0205049 </a> [<a href="/pdf/cs/0205049" title="Download PDF" id="pdf-cs/0205049" aria-labelledby="pdf-cs/0205049">pdf</a>, <a href="/format/cs/0205049" title="Other formats" id="oth-cs/0205049" aria-labelledby="oth-cs/0205049">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Prefix Codes: Equiprobable Words, Unequal Letter Costs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Golin,+M">Mordecai Golin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> proceedings version in ICALP (1994) </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> SIAM J. Computing 25(6):1281-1304 (1996) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span> </div> </div> </dd> <dt> <a name='item50'>[50]</a> <a href ="/abs/cs/0205050" title="Abstract" id="cs/0205050"> arXiv:cs/0205050 </a> [<a href="/pdf/cs/0205050" title="Download PDF" id="pdf-cs/0205050" aria-labelledby="pdf-cs/0205050">pdf</a>, <a href="/format/cs/0205050" title="Other formats" id="oth-cs/0205050" aria-labelledby="oth-cs/0205050">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Fekete,+S">S. Fekete</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Khuller,+S">S. Khuller</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Klemmstein,+M">M. Klemmstein</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Raghavachari,+B">B. Raghavachari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Young,+N+E">Neal E. Young</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Journal of Algorithms 24(2):310-324 (1997) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> </dl> <div class='paging'>Total of 95 entries : <span>1-50</span> <a href=/list/cs/2002-05?skip=50&show=50>51-95</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs/2002-05?skip=0&show=25 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <a href=/list/cs/2002-05?skip=0&show=2000 rel="nofollow"> all</a> </div> </div> </div> </div> </main> <footer style="clear: both;"> <div class="columns is-desktop" role="navigation" aria-label="Secondary" style="margin: -0.75em -0.75em 0.75em -0.75em">  <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>   </div> </footer> </div> <script src="/static/base/1.0.1/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Computer Science May 2002