CINXE.COM
Data Structures and Algorithms Mar 2025
<!DOCTYPE html> <html lang="en"> <head> <title>Data Structures and Algorithms Mar 2025</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> <!-- start desktop header --> <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.DS/recent">cs.DS</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><!-- /end desktop header --> <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><!-- /end mobile-header --> </header> <main> <div id="content"> <div id='content-inner'> <div id='dlpage'> <h1>Data Structures and Algorithms</h1> <h2>Authors and titles for March 2025 </h2> <div class='paging'>Total of 120 entries : <span>1-50</span> <a href=/list/cs.DS/current?skip=50&show=50>51-100</a> <a href=/list/cs.DS/current?skip=100&show=50>101-120</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs.DS/current?skip=0&show=25 rel="nofollow"> fewer</a> | <a href=/list/cs.DS/current?skip=0&show=100 rel="nofollow"> more</a> | <a href=/list/cs.DS/current?skip=0&show=2000 rel="nofollow"> all</a> </div> <dl id='articles'> <dt> <a name='item1'>[1]</a> <a href ="/abs/2503.00263" title="Abstract" id="2503.00263"> arXiv:2503.00263 </a> [<a href="/pdf/2503.00263" title="Download PDF" id="pdf-2503.00263" aria-labelledby="pdf-2503.00263">pdf</a>, <a href="https://arxiv.org/html/2503.00263v1" title="View HTML" id="html-2503.00263" aria-labelledby="html-2503.00263" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.00263" title="Other formats" id="oth-2503.00263" aria-labelledby="oth-2503.00263">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ghanbari,+B">Babak Ghanbari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=%C5%A0%C3%A1mal,+R">Robert 艩谩mal</a></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); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item2'>[2]</a> <a href ="/abs/2503.00281" title="Abstract" id="2503.00281"> arXiv:2503.00281 </a> [<a href="/pdf/2503.00281" title="Download PDF" id="pdf-2503.00281" aria-labelledby="pdf-2503.00281">pdf</a>, <a href="https://arxiv.org/html/2503.00281v1" title="View HTML" id="html-2503.00281" aria-labelledby="html-2503.00281" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.00281" title="Other formats" id="oth-2503.00281" aria-labelledby="oth-2503.00281">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> An FPT Constant-Factor Approximation Algorithm for Correlation Clustering </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Zhou,+J">Jianqi Zhou</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhang,+Z">Zhongyi Zhang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Guo,+J">Jiong Guo</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Accepted by COCOON 2024 </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='item3'>[3]</a> <a href ="/abs/2503.00712" title="Abstract" id="2503.00712"> arXiv:2503.00712 </a> [<a href="/pdf/2503.00712" title="Download PDF" id="pdf-2503.00712" aria-labelledby="pdf-2503.00712">pdf</a>, <a href="https://arxiv.org/html/2503.00712v1" title="View HTML" id="html-2503.00712" aria-labelledby="html-2503.00712" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.00712" title="Other formats" id="oth-2503.00712" aria-labelledby="oth-2503.00712">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Streaming Algorithms for Network Design </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chekuri,+C">Chandra Chekuri</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Jain,+R">Rhea Jain</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mahabadi,+S">Sepideh Mahabadi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vakilian,+A">Ali Vakilian</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='item4'>[4]</a> <a href ="/abs/2503.01147" title="Abstract" id="2503.01147"> arXiv:2503.01147 </a> [<a href="/pdf/2503.01147" title="Download PDF" id="pdf-2503.01147" aria-labelledby="pdf-2503.01147">pdf</a>, <a href="https://arxiv.org/html/2503.01147v1" title="View HTML" id="html-2503.01147" aria-labelledby="html-2503.01147" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.01147" title="Other formats" id="oth-2503.01147" aria-labelledby="oth-2503.01147">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A framework for boosting matching approximation: parallel, distributed, and dynamic </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Mitrovi%C4%87,+S">Slobodan Mitrovi膰</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sheu,+W">Wen-Horng Sheu</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='item5'>[5]</a> <a href ="/abs/2503.01388" title="Abstract" id="2503.01388"> arXiv:2503.01388 </a> [<a href="/pdf/2503.01388" title="Download PDF" id="pdf-2503.01388" aria-labelledby="pdf-2503.01388">pdf</a>, <a href="https://arxiv.org/html/2503.01388v1" title="View HTML" id="html-2503.01388" aria-labelledby="html-2503.01388" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.01388" title="Other formats" id="oth-2503.01388" aria-labelledby="oth-2503.01388">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Faster ED-String Matching with $k$ Mismatches </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Gawrychowski,+P">Pawe艂 Gawrychowski</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=G%C3%B3rkiewicz,+A">Adam G贸rkiewicz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Marciniak,+P">Pola Marciniak</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pissis,+S+P">Solon P. Pissis</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pokorski,+K">Karol Pokorski</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='item6'>[6]</a> <a href ="/abs/2503.01445" title="Abstract" id="2503.01445"> arXiv:2503.01445 </a> [<a href="/pdf/2503.01445" title="Download PDF" id="pdf-2503.01445" aria-labelledby="pdf-2503.01445">pdf</a>, <a href="https://arxiv.org/html/2503.01445v1" title="View HTML" id="html-2503.01445" aria-labelledby="html-2503.01445" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.01445" title="Other formats" id="oth-2503.01445" aria-labelledby="oth-2503.01445">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Binary $k$-Center with Missing Entries: Structure Leads to Tractability </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Soheil,+F">Farehe Soheil</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Simonov,+K">Kirill Simonov</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Friedrich,+T">Tobias Friedrich</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='item7'>[7]</a> <a href ="/abs/2503.01662" title="Abstract" id="2503.01662"> arXiv:2503.01662 </a> [<a href="/pdf/2503.01662" title="Download PDF" id="pdf-2503.01662" aria-labelledby="pdf-2503.01662">pdf</a>, <a href="https://arxiv.org/html/2503.01662v2" title="View HTML" id="html-2503.01662" aria-labelledby="html-2503.01662" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.01662" title="Other formats" id="oth-2503.01662" aria-labelledby="oth-2503.01662">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Scanning HTML at Tens of Gigabytes per Second on ARM Processors </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lemire,+D">Daniel Lemire</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Hardware Architecture (cs.AR) </div> </div> </dd> <dt> <a name='item8'>[8]</a> <a href ="/abs/2503.01766" title="Abstract" id="2503.01766"> arXiv:2503.01766 </a> [<a href="/pdf/2503.01766" title="Download PDF" id="pdf-2503.01766" aria-labelledby="pdf-2503.01766">pdf</a>, <a href="https://arxiv.org/html/2503.01766v1" title="View HTML" id="html-2503.01766" aria-labelledby="html-2503.01766" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.01766" title="Other formats" id="oth-2503.01766" aria-labelledby="oth-2503.01766">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Optimal Differentially Private Sampling of Unbounded Gaussians </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Iverson,+V">Valentio Iverson</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kamath,+G">Gautam Kamath</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mouzakis,+A">Argyris Mouzakis</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 47 pages </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Cryptography and Security (cs.CR); Information Theory (cs.IT); Machine Learning (cs.LG); Machine Learning (stat.ML) </div> </div> </dd> <dt> <a name='item9'>[9]</a> <a href ="/abs/2503.02319" title="Abstract" id="2503.02319"> arXiv:2503.02319 </a> [<a href="/pdf/2503.02319" title="Download PDF" id="pdf-2503.02319" aria-labelledby="pdf-2503.02319">pdf</a>, <a href="https://arxiv.org/html/2503.02319v1" title="View HTML" id="html-2503.02319" aria-labelledby="html-2503.02319" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.02319" title="Other formats" id="oth-2503.02319" aria-labelledby="oth-2503.02319">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Yang,+P">Puhan Yang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Li,+G">Guchan Li</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 9 pages, 7 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Geometry (cs.CG); Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item10'>[10]</a> <a href ="/abs/2503.02415" title="Abstract" id="2503.02415"> arXiv:2503.02415 </a> [<a href="/pdf/2503.02415" title="Download PDF" id="pdf-2503.02415" aria-labelledby="pdf-2503.02415">pdf</a>, <a href="https://arxiv.org/html/2503.02415v1" title="View HTML" id="html-2503.02415" aria-labelledby="html-2503.02415" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.02415" title="Other formats" id="oth-2503.02415" aria-labelledby="oth-2503.02415">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the sensitivity of CDAWG-grammars </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Fujimaru,+H">Hiroto Fujimaru</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Inenaga,+S">Shunsuke Inenaga</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='item11'>[11]</a> <a href ="/abs/2503.03079" title="Abstract" id="2503.03079"> arXiv:2503.03079 </a> [<a href="/pdf/2503.03079" title="Download PDF" id="pdf-2503.03079" aria-labelledby="pdf-2503.03079">pdf</a>, <a href="https://arxiv.org/html/2503.03079v1" title="View HTML" id="html-2503.03079" aria-labelledby="html-2503.03079" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.03079" title="Other formats" id="oth-2503.03079" aria-labelledby="oth-2503.03079">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Herold,+M+G">Martin G. Herold</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Nanongkai,+D">Danupon Nanongkai</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Spoerhase,+J">Joachim Spoerhase</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Varma,+N">Nithin Varma</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wu,+Z">Zihang Wu</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> to be published in SoCG2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Geometry (cs.CG) </div> </div> </dd> <dt> <a name='item12'>[12]</a> <a href ="/abs/2503.03488" title="Abstract" id="2503.03488"> arXiv:2503.03488 </a> [<a href="/pdf/2503.03488" title="Download PDF" id="pdf-2503.03488" aria-labelledby="pdf-2503.03488">pdf</a>, <a href="https://arxiv.org/html/2503.03488v1" title="View HTML" id="html-2503.03488" aria-labelledby="html-2503.03488" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.03488" title="Other formats" id="oth-2503.03488" aria-labelledby="oth-2503.03488">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Duyster,+A">Anouk Duyster</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kociumaka,+T">Tomasz Kociumaka</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> A preliminary version of this work was presented at SPIRE 2024 </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='item13'>[13]</a> <a href ="/abs/2503.03568" title="Abstract" id="2503.03568"> arXiv:2503.03568 </a> [<a href="/pdf/2503.03568" title="Download PDF" id="pdf-2503.03568" aria-labelledby="pdf-2503.03568">pdf</a>, <a href="https://arxiv.org/html/2503.03568v1" title="View HTML" id="html-2503.03568" aria-labelledby="html-2503.03568" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.03568" title="Other formats" id="oth-2503.03568" aria-labelledby="oth-2503.03568">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Novel Complexity Results for Temporal Separators with Deadlines </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Dondi,+R">Riccardo Dondi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lafond,+M">Manuel Lafond</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='item14'>[14]</a> <a href ="/abs/2503.03642" title="Abstract" id="2503.03642"> arXiv:2503.03642 </a> [<a href="/pdf/2503.03642" title="Download PDF" id="pdf-2503.03642" aria-labelledby="pdf-2503.03642">pdf</a>, <a href="https://arxiv.org/html/2503.03642v1" title="View HTML" id="html-2503.03642" aria-labelledby="html-2503.03642" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.03642" title="Other formats" id="oth-2503.03642" aria-labelledby="oth-2503.03642">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Improved FPT Approximation Algorithms for TSP </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Zhao,+J">Jingyang Zhao</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sheng,+Z">Zimo Sheng</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Xiao,+M">Mingyu Xiao</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='item15'>[15]</a> <a href ="/abs/2503.03923" title="Abstract" id="2503.03923"> arXiv:2503.03923 </a> [<a href="/pdf/2503.03923" title="Download PDF" id="pdf-2503.03923" aria-labelledby="pdf-2503.03923">pdf</a>, <a href="https://arxiv.org/html/2503.03923v1" title="View HTML" id="html-2503.03923" aria-labelledby="html-2503.03923" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.03923" title="Other formats" id="oth-2503.03923" aria-labelledby="oth-2503.03923">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Improved Robust Estimation for Erd艖s-R茅nyi Graphs: The Sparse Regime and Optimal Breakdown Point </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chen,+H">Hongjie Chen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ding,+J">Jingqiu Ding</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Hua,+Y">Yiding Hua</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tiegel,+S">Stefan Tiegel</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Machine Learning (stat.ML) </div> </div> </dd> <dt> <a name='item16'>[16]</a> <a href ="/abs/2503.04146" title="Abstract" id="2503.04146"> arXiv:2503.04146 </a> [<a href="/pdf/2503.04146" title="Download PDF" id="pdf-2503.04146" aria-labelledby="pdf-2503.04146">pdf</a>, <a href="/format/2503.04146" title="Other formats" id="oth-2503.04146" aria-labelledby="oth-2503.04146">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Image Computation for Quantum Transition Systems </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hong,+X">Xin Hong</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gao,+D">Dingchao Gao</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Li,+S">Sanjiang Li</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ying,+S">Shenggang Ying</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ying,+M">Mingsheng Ying</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Emerging Technologies (cs.ET); Quantum Physics (quant-ph) </div> </div> </dd> <dt> <a name='item17'>[17]</a> <a href ="/abs/2503.04196" title="Abstract" id="2503.04196"> arXiv:2503.04196 </a> [<a href="/pdf/2503.04196" title="Download PDF" id="pdf-2503.04196" aria-labelledby="pdf-2503.04196">pdf</a>, <a href="https://arxiv.org/html/2503.04196v1" title="View HTML" id="html-2503.04196" aria-labelledby="html-2503.04196" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04196" title="Other formats" id="oth-2503.04196" aria-labelledby="oth-2503.04196">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Peng,+B">Bo Peng</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tang,+Z+G">Zhihao Gavin Tang</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computer Science and Game Theory (cs.GT) </div> </div> </dd> <dt> <a name='item18'>[18]</a> <a href ="/abs/2503.04419" title="Abstract" id="2503.04419"> arXiv:2503.04419 </a> [<a href="/pdf/2503.04419" title="Download PDF" id="pdf-2503.04419" aria-labelledby="pdf-2503.04419">pdf</a>, <a href="https://arxiv.org/html/2503.04419v1" title="View HTML" id="html-2503.04419" aria-labelledby="html-2503.04419" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04419" title="Other formats" id="oth-2503.04419" aria-labelledby="oth-2503.04419">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Cost-Distance Steiner Trees for Timing-Constrained Global Routing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Held,+S">Stephan Held</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Perner,+E">Edgar Perner</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='item19'>[19]</a> <a href ="/abs/2503.04511" title="Abstract" id="2503.04511"> arXiv:2503.04511 </a> [<a href="/pdf/2503.04511" title="Download PDF" id="pdf-2503.04511" aria-labelledby="pdf-2503.04511">pdf</a>, <a href="https://arxiv.org/html/2503.04511v1" title="View HTML" id="html-2503.04511" aria-labelledby="html-2503.04511" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04511" title="Other formats" id="oth-2503.04511" aria-labelledby="oth-2503.04511">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Source-Oblivious Broadcast </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Fraigniaud,+P">Pierre Fraigniaud</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Harutyunyan,+H+A">Hovhannes A. Harutyunyan</a></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='item20'>[20]</a> <a href ="/abs/2503.04633" title="Abstract" id="2503.04633"> arXiv:2503.04633 </a> [<a href="/pdf/2503.04633" title="Download PDF" id="pdf-2503.04633" aria-labelledby="pdf-2503.04633">pdf</a>, <a href="https://arxiv.org/html/2503.04633v1" title="View HTML" id="html-2503.04633" aria-labelledby="html-2503.04633" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04633" title="Other formats" id="oth-2503.04633" aria-labelledby="oth-2503.04633">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Quickly Avoiding a Random Catastrophe </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ashur,+S">Stav Ashur</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Har-Peled,+S">Sariel Har-Peled</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='item21'>[21]</a> <a href ="/abs/2503.04986" title="Abstract" id="2503.04986"> arXiv:2503.04986 </a> [<a href="/pdf/2503.04986" title="Download PDF" id="pdf-2503.04986" aria-labelledby="pdf-2503.04986">pdf</a>, <a href="https://arxiv.org/html/2503.04986v1" title="View HTML" id="html-2503.04986" aria-labelledby="html-2503.04986" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04986" title="Other formats" id="oth-2503.04986" aria-labelledby="oth-2503.04986">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Efficient Algorithms for Verifying Kruskal Rank in Sparse Linear Regression and Related Applications </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Zhou,+F">Fengqin Zhou</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Machine Learning (cs.LG) </div> </div> </dd> <dt> <a name='item22'>[22]</a> <a href ="/abs/2503.05004" title="Abstract" id="2503.05004"> arXiv:2503.05004 </a> [<a href="/pdf/2503.05004" title="Download PDF" id="pdf-2503.05004" aria-labelledby="pdf-2503.05004">pdf</a>, <a href="https://arxiv.org/html/2503.05004v1" title="View HTML" id="html-2503.05004" aria-labelledby="html-2503.05004" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05004" title="Other formats" id="oth-2503.05004" aria-labelledby="oth-2503.05004">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Faster Global Minimum Cut with Predictions </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Moseley,+B">Benjamin Moseley</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Niaparast,+H">Helia Niaparast</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Singh,+K">Karan Singh</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='item23'>[23]</a> <a href ="/abs/2503.05173" title="Abstract" id="2503.05173"> arXiv:2503.05173 </a> [<a href="/pdf/2503.05173" title="Download PDF" id="pdf-2503.05173" aria-labelledby="pdf-2503.05173">pdf</a>, <a href="https://arxiv.org/html/2503.05173v1" title="View HTML" id="html-2503.05173" aria-labelledby="html-2503.05173" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05173" title="Other formats" id="oth-2503.05173" aria-labelledby="oth-2503.05173">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Fair Clustering in the Sliding Window Model </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Cohen-Addad,+V">Vincent Cohen-Addad</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Jiang,+S+H">Shaofeng H.-C. Jiang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yang,+Q">Qiaoyuan Yang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhang,+Y">Yubo Zhang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhou,+S">Samson Zhou</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> ICLR 2025 </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='item24'>[24]</a> <a href ="/abs/2503.05260" title="Abstract" id="2503.05260"> arXiv:2503.05260 </a> [<a href="/pdf/2503.05260" title="Download PDF" id="pdf-2503.05260" aria-labelledby="pdf-2503.05260">pdf</a>, <a href="https://arxiv.org/html/2503.05260v1" title="View HTML" id="html-2503.05260" aria-labelledby="html-2503.05260" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05260" title="Other formats" id="oth-2503.05260" aria-labelledby="oth-2503.05260">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Fair Center Clustering in Sliding Windows </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ceccarello,+M">Matteo Ceccarello</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pietracaprina,+A">Andrea Pietracaprina</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pucci,+G">Geppino Pucci</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vison%C3%A0,+F">Francesco Vison脿</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='item25'>[25]</a> <a href ="/abs/2503.05312" title="Abstract" id="2503.05312"> arXiv:2503.05312 </a> [<a href="/pdf/2503.05312" title="Download PDF" id="pdf-2503.05312" aria-labelledby="pdf-2503.05312">pdf</a>, <a href="https://arxiv.org/html/2503.05312v1" title="View HTML" id="html-2503.05312" aria-labelledby="html-2503.05312" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05312" title="Other formats" id="oth-2503.05312" aria-labelledby="oth-2503.05312">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the Parameterized Complexity of Odd Coloring </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Bhyravarapu,+S">Sriram Bhyravarapu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kumari,+S">Swati Kumari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Reddy,+I+V">I. Vinod Reddy</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Appeared in CALDAM 2025 </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='item26'>[26]</a> <a href ="/abs/2503.05467" title="Abstract" id="2503.05467"> arXiv:2503.05467 </a> [<a href="/pdf/2503.05467" title="Download PDF" id="pdf-2503.05467" aria-labelledby="pdf-2503.05467">pdf</a>, <a href="https://arxiv.org/html/2503.05467v1" title="View HTML" id="html-2503.05467" aria-labelledby="html-2503.05467" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05467" title="Other formats" id="oth-2503.05467" aria-labelledby="oth-2503.05467">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Strassen's algorithm via orbit flip graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ikenmeyer,+C">Christian Ikenmeyer</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Moosbauer,+J">Jakob Moosbauer</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='item27'>[27]</a> <a href ="/abs/2503.05589" title="Abstract" id="2503.05589"> arXiv:2503.05589 </a> [<a href="/pdf/2503.05589" title="Download PDF" id="pdf-2503.05589" aria-labelledby="pdf-2503.05589">pdf</a>, <a href="/format/2503.05589" title="Other formats" id="oth-2503.05589" aria-labelledby="oth-2503.05589">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Time-Optimal $k$-Server </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Frei,+F">Fabian Frei</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Komm,+D">Dennis Komm</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Stocker,+M">Moritz Stocker</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Whittington,+P">Philip Whittington</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='item28'>[28]</a> <a href ="/abs/2503.05596" title="Abstract" id="2503.05596"> arXiv:2503.05596 </a> [<a href="/pdf/2503.05596" title="Download PDF" id="pdf-2503.05596" aria-labelledby="pdf-2503.05596">pdf</a>, <a href="https://arxiv.org/html/2503.05596v1" title="View HTML" id="html-2503.05596" aria-labelledby="html-2503.05596" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05596" title="Other formats" id="oth-2503.05596" aria-labelledby="oth-2503.05596">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Faro,+S">Simone Faro</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pavone,+A">Arianna Pavone</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Viola,+C">Caterina Viola</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Information Retrieval (cs.IR) </div> </div> </dd> <dt> <a name='item29'>[29]</a> <a href ="/abs/2503.05934" title="Abstract" id="2503.05934"> arXiv:2503.05934 </a> [<a href="/pdf/2503.05934" title="Download PDF" id="pdf-2503.05934" aria-labelledby="pdf-2503.05934">pdf</a>, <a href="https://arxiv.org/html/2503.05934v3" title="View HTML" id="html-2503.05934" aria-labelledby="html-2503.05934" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05934" title="Other formats" id="oth-2503.05934" aria-labelledby="oth-2503.05934">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev's Sorting Networks as Base Cases </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Aly,+A+G">Anas Gamal Aly</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Jensen,+A+E">Anders E. Jensen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=ElAarag,+H">Hala ElAarag</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 漏 Anas Gamal Aly, Anders E. Jensen, and Hala ElAarag, 2025. This is the authors' version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record will be published in Proceedings of the 2025 ACM Southeast Conference (ACMSE 2025) </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='item30'>[30]</a> <a href ="/abs/2503.06266" title="Abstract" id="2503.06266"> arXiv:2503.06266 </a> [<a href="/pdf/2503.06266" title="Download PDF" id="pdf-2503.06266" aria-labelledby="pdf-2503.06266">pdf</a>, <a href="https://arxiv.org/html/2503.06266v1" title="View HTML" id="html-2503.06266" aria-labelledby="html-2503.06266" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.06266" title="Other formats" id="oth-2503.06266" aria-labelledby="oth-2503.06266">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The connectivity carcass of a vertex subset in a graph: both odd and even case </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Baswana,+S">Surender Baswana</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pandey,+A">Abhyuday Pandey</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Preliminary version of this article appeared in the proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item31'>[31]</a> <a href ="/abs/2503.06464" title="Abstract" id="2503.06464"> arXiv:2503.06464 </a> [<a href="/pdf/2503.06464" title="Download PDF" id="pdf-2503.06464" aria-labelledby="pdf-2503.06464">pdf</a>, <a href="/format/2503.06464" title="Other formats" id="oth-2503.06464" aria-labelledby="oth-2503.06464">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Detecting correlation efficiently in stochastic block models: breaking Otter's threshold by counting decorated trees </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chen,+G">Guanyi Chen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ding,+J">Jian Ding</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gong,+S">Shuyang Gong</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Li,+Z">Zhangsong Li</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Probability (math.PR); Statistics Theory (math.ST) </div> </div> </dd> <dt> <a name='item32'>[32]</a> <a href ="/abs/2503.06737" title="Abstract" id="2503.06737"> arXiv:2503.06737 </a> [<a href="/pdf/2503.06737" title="Download PDF" id="pdf-2503.06737" aria-labelledby="pdf-2503.06737">pdf</a>, <a href="https://arxiv.org/html/2503.06737v1" title="View HTML" id="html-2503.06737" aria-labelledby="html-2503.06737" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.06737" title="Other formats" id="oth-2503.06737" aria-labelledby="oth-2503.06737">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Faster and Space Efficient Indexing for Locality Sensitive Hashing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Verma,+B+D">Bhisham Dev Verma</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pratap,+R">Rameshwar Pratap</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Machine Learning (cs.LG) </div> </div> </dd> <dt> <a name='item33'>[33]</a> <a href ="/abs/2503.06970" title="Abstract" id="2503.06970"> arXiv:2503.06970 </a> [<a href="/pdf/2503.06970" title="Download PDF" id="pdf-2503.06970" aria-labelledby="pdf-2503.06970">pdf</a>, <a href="https://arxiv.org/html/2503.06970v1" title="View HTML" id="html-2503.06970" aria-labelledby="html-2503.06970" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.06970" title="Other formats" id="oth-2503.06970" aria-labelledby="oth-2503.06970">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Inverting Parameterized Burrows-Wheeler Transform </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kawanami,+S">Shogen Kawanami</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Iseri,+K">Kento Iseri</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=I,+T">Tomohiro I</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='item34'>[34]</a> <a href ="/abs/2503.06999" title="Abstract" id="2503.06999"> arXiv:2503.06999 </a> [<a href="/pdf/2503.06999" title="Download PDF" id="pdf-2503.06999" aria-labelledby="pdf-2503.06999">pdf</a>, <a href="https://arxiv.org/html/2503.06999v1" title="View HTML" id="html-2503.06999" aria-labelledby="html-2503.06999" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.06999" title="Other formats" id="oth-2503.06999" aria-labelledby="oth-2503.06999">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Encoding Schemes for Parallel In-Place Algorithms </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hutton,+C">Chase Hutton</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Melrod,+A">Adam Melrod</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 22 pages, 5 figures. Comments and suggestions are very welcome! </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='item35'>[35]</a> <a href ="/abs/2503.07061" title="Abstract" id="2503.07061"> arXiv:2503.07061 </a> [<a href="/pdf/2503.07061" title="Download PDF" id="pdf-2503.07061" aria-labelledby="pdf-2503.07061">pdf</a>, <a href="https://arxiv.org/html/2503.07061v1" title="View HTML" id="html-2503.07061" aria-labelledby="html-2503.07061" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.07061" title="Other formats" id="oth-2503.07061" aria-labelledby="oth-2503.07061">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Encoding Co-Lex Orders of Finite-State Automata in Linear Space </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Becker,+R">Ruben Becker</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Cotumaccio,+N">Nicola Cotumaccio</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kim,+S">Sung-Hwan Kim</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Prezza,+N">Nicola Prezza</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tosoni,+C">Carlo Tosoni</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Submitted to the 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025), 18 pages, 3 figures </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='item36'>[36]</a> <a href ="/abs/2503.08211" title="Abstract" id="2503.08211"> arXiv:2503.08211 </a> [<a href="/pdf/2503.08211" title="Download PDF" id="pdf-2503.08211" aria-labelledby="pdf-2503.08211">pdf</a>, <a href="https://arxiv.org/html/2503.08211v1" title="View HTML" id="html-2503.08211" aria-labelledby="html-2503.08211" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.08211" title="Other formats" id="oth-2503.08211" aria-labelledby="oth-2503.08211">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Buffered Partially-Persistent External-Memory Search Trees </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Brodal,+G+S">Gerth St酶lting Brodal</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rysgaard,+C+M">Casper Moldrup Rysgaard</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Svenning,+R">Rolf Svenning</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='item37'>[37]</a> <a href ="/abs/2503.08262" title="Abstract" id="2503.08262"> arXiv:2503.08262 </a> [<a href="/pdf/2503.08262" title="Download PDF" id="pdf-2503.08262" aria-labelledby="pdf-2503.08262">pdf</a>, <a href="https://arxiv.org/html/2503.08262v1" title="View HTML" id="html-2503.08262" aria-labelledby="html-2503.08262" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.08262" title="Other formats" id="oth-2503.08262" aria-labelledby="oth-2503.08262">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Cost-driven prunings for iterative solving of constrained routing problem with SRLG-disjoint protection </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Mosharev,+P+A">P. A. Mosharev</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lee,+C">Choon-Meng Lee</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shu,+X">Xu Shu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhang,+X">Xiaoshan Zhang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yung,+M">Man-Hong Yung</a></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='item38'>[38]</a> <a href ="/abs/2503.08828" title="Abstract" id="2503.08828"> arXiv:2503.08828 </a> [<a href="/pdf/2503.08828" title="Download PDF" id="pdf-2503.08828" aria-labelledby="pdf-2503.08828">pdf</a>, <a href="https://arxiv.org/html/2503.08828v1" title="View HTML" id="html-2503.08828" aria-labelledby="html-2503.08828" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.08828" title="Other formats" id="oth-2503.08828" aria-labelledby="oth-2503.08828">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chandrasekaran,+K">Karthekeyan Chandrasekaran</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Chekuri,+C">Chandra Chekuri</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kulkarni,+S">Shubhang Kulkarni</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='item39'>[39]</a> <a href ="/abs/2503.09468" title="Abstract" id="2503.09468"> arXiv:2503.09468 </a> [<a href="/pdf/2503.09468" title="Download PDF" id="pdf-2503.09468" aria-labelledby="pdf-2503.09468">pdf</a>, <a href="https://arxiv.org/html/2503.09468v1" title="View HTML" id="html-2503.09468" aria-labelledby="html-2503.09468" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09468" title="Other formats" id="oth-2503.09468" aria-labelledby="oth-2503.09468">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Beyond 2-approximation for k-Center in Graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Jin,+C">Ce Jin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kirkpatrick,+Y">Yael Kirkpatrick</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Williams,+V+V">Virginia Vassilevska Williams</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wein,+N">Nicole Wein</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/2503.09508" title="Abstract" id="2503.09508"> arXiv:2503.09508 </a> [<a href="/pdf/2503.09508" title="Download PDF" id="pdf-2503.09508" aria-labelledby="pdf-2503.09508">pdf</a>, <a href="https://arxiv.org/html/2503.09508v2" title="View HTML" id="html-2503.09508" aria-labelledby="html-2503.09508" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09508" title="Other formats" id="oth-2503.09508" aria-labelledby="oth-2503.09508">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Bounding the Optimal Performance of Online Randomized Primal-Dual Methods </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Xu,+P">Pan Xu</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='item41'>[41]</a> <a href ="/abs/2503.09530" title="Abstract" id="2503.09530"> arXiv:2503.09530 </a> [<a href="/pdf/2503.09530" title="Download PDF" id="pdf-2503.09530" aria-labelledby="pdf-2503.09530">pdf</a>, <a href="https://arxiv.org/html/2503.09530v1" title="View HTML" id="html-2503.09530" aria-labelledby="html-2503.09530" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09530" title="Other formats" id="oth-2503.09530" aria-labelledby="oth-2503.09530">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Revisiting Karp, Vazirani, and Vazirani (STOC 1990): A Simple Yet Rigorous Fix to the $1 - 1/e$ Upper-Bound Analysis </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Xu,+P">Pan Xu</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='item42'>[42]</a> <a href ="/abs/2503.09762" title="Abstract" id="2503.09762"> arXiv:2503.09762 </a> [<a href="/pdf/2503.09762" title="Download PDF" id="pdf-2503.09762" aria-labelledby="pdf-2503.09762">pdf</a>, <a href="https://arxiv.org/html/2503.09762v1" title="View HTML" id="html-2503.09762" aria-labelledby="html-2503.09762" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09762" title="Other formats" id="oth-2503.09762" aria-labelledby="oth-2503.09762">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Achieving constant regret for dynamic matching via state-independent policies </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kerimov,+S">S眉leyman Kerimov</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yang,+M">Mingwei Yang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yu,+S+H">Sophie H. Yu</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Optimization and Control (math.OC); Probability (math.PR) </div> </div> </dd> <dt> <a name='item43'>[43]</a> <a href ="/abs/2503.09810" title="Abstract" id="2503.09810"> arXiv:2503.09810 </a> [<a href="/pdf/2503.09810" title="Download PDF" id="pdf-2503.09810" aria-labelledby="pdf-2503.09810">pdf</a>, <a href="https://arxiv.org/html/2503.09810v1" title="View HTML" id="html-2503.09810" aria-labelledby="html-2503.09810" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09810" title="Other formats" id="oth-2503.09810" aria-labelledby="oth-2503.09810">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Eden,+T">Talya Eden</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Levi,+R">Reut Levi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ron,+D">Dana Ron</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rubinfeld,+R">Ronitt Rubinfeld</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='item44'>[44]</a> <a href ="/abs/2503.09908" title="Abstract" id="2503.09908"> arXiv:2503.09908 </a> [<a href="/pdf/2503.09908" title="Download PDF" id="pdf-2503.09908" aria-labelledby="pdf-2503.09908">pdf</a>, <a href="https://arxiv.org/html/2503.09908v1" title="View HTML" id="html-2503.09908" aria-labelledby="html-2503.09908" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09908" title="Other formats" id="oth-2503.09908" aria-labelledby="oth-2503.09908">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Parallel Batch-Dynamic Maximal Matching with Constant Work per Update </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Blelloch,+G+E">Guy E. Blelloch</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Brady,+A+C">Andrew C. Brady</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 19 pages, 2 figures </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='item45'>[45]</a> <a href ="/abs/2503.10161" title="Abstract" id="2503.10161"> arXiv:2503.10161 </a> [<a href="/pdf/2503.10161" title="Download PDF" id="pdf-2503.10161" aria-labelledby="pdf-2503.10161">pdf</a>, <a href="/format/2503.10161" title="Other formats" id="oth-2503.10161" aria-labelledby="oth-2503.10161">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hermann,+S">Stefan Hermann</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='item46'>[46]</a> <a href ="/abs/2503.10447" title="Abstract" id="2503.10447"> arXiv:2503.10447 </a> [<a href="/pdf/2503.10447" title="Download PDF" id="pdf-2503.10447" aria-labelledby="pdf-2503.10447">pdf</a>, <a href="https://arxiv.org/html/2503.10447v1" title="View HTML" id="html-2503.10447" aria-labelledby="html-2503.10447" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.10447" title="Other formats" id="oth-2503.10447" aria-labelledby="oth-2503.10447">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Bai,+T">Tian Bai</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 19 pages, 4 figures </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='item47'>[47]</a> <a href ="/abs/2503.10780" title="Abstract" id="2503.10780"> arXiv:2503.10780 </a> [<a href="/pdf/2503.10780" title="Download PDF" id="pdf-2503.10780" aria-labelledby="pdf-2503.10780">pdf</a>, <a href="https://arxiv.org/html/2503.10780v1" title="View HTML" id="html-2503.10780" aria-labelledby="html-2503.10780" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.10780" title="Other formats" id="oth-2503.10780" aria-labelledby="oth-2503.10780">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Shook,+J+M">James M. Shook</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Beichl,+I">Isabel Beichl</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 12 pages, 12 figures </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); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item48'>[48]</a> <a href ="/abs/2503.10972" title="Abstract" id="2503.10972"> arXiv:2503.10972 </a> [<a href="/pdf/2503.10972" title="Download PDF" id="pdf-2503.10972" aria-labelledby="pdf-2503.10972">pdf</a>, <a href="/format/2503.10972" title="Other formats" id="oth-2503.10972" aria-labelledby="oth-2503.10972">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Cohen-Addad,+V">Vincent Cohen-Addad</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Grandoni,+F">Fabrizio Grandoni</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lee,+E">Euiwoong Lee</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Schwiegelshohn,+C">Chris Schwiegelshohn</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Svensson,+O">Ola Svensson</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='item49'>[49]</a> <a href ="/abs/2503.11099" title="Abstract" id="2503.11099"> arXiv:2503.11099 </a> [<a href="/pdf/2503.11099" title="Download PDF" id="pdf-2503.11099" aria-labelledby="pdf-2503.11099">pdf</a>, <a href="/format/2503.11099" title="Other formats" id="oth-2503.11099" aria-labelledby="oth-2503.11099">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Approximating the Total Variation Distance between Gaussians </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Bhattacharyya,+A">Arnab Bhattacharyya</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Feng,+W">Weiming Feng</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Piyush">Piyush Srivastava</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Accepted by AISTATS 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Machine Learning (cs.LG); Probability (math.PR) </div> </div> </dd> <dt> <a name='item50'>[50]</a> <a href ="/abs/2503.11107" title="Abstract" id="2503.11107"> arXiv:2503.11107 </a> [<a href="/pdf/2503.11107" title="Download PDF" id="pdf-2503.11107" aria-labelledby="pdf-2503.11107">pdf</a>, <a href="https://arxiv.org/html/2503.11107v1" title="View HTML" id="html-2503.11107" aria-labelledby="html-2503.11107" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.11107" title="Other formats" id="oth-2503.11107" aria-labelledby="oth-2503.11107">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Discrete Effort Distribution via Regrettable Greedy Algorithm </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Cao,+S">Song Cao</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhu,+T">Taikun Zhu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Jin,+K">Kai Jin</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> </dl> <div class='paging'>Total of 120 entries : <span>1-50</span> <a href=/list/cs.DS/current?skip=50&show=50>51-100</a> <a href=/list/cs.DS/current?skip=100&show=50>101-120</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs.DS/current?skip=0&show=25 rel="nofollow"> fewer</a> | <a href=/list/cs.DS/current?skip=0&show=100 rel="nofollow"> more</a> | <a href=/list/cs.DS/current?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"> <!-- Macro-Column 1 --> <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> <!-- End Macro-Column 1 --> <!-- Macro-Column 2 --> <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> <!-- end MetaColumn 2 --> <!-- End Macro-Column 2 --> </div> </footer> </div> <script src="/static/base/1.0.1/js/member_acknowledgement.js"></script> </body> </html>