Data Structures and Algorithms

<?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en"> <head> <title>Data Structures and Algorithms </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=20240822" /> <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.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> <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>Data Structures and Algorithms</h1> <h2>Authors and titles for recent submissions</h2> <ul> <li> <a href="/list/cs.DS/recent?skip=0&show=50"> Fri, 22 Nov 2024 </a> </li><li> <a href="/list/cs.DS/recent?skip=12&show=50"> Thu, 21 Nov 2024 </a> </li><li> <a href="/list/cs.DS/recent?skip=19&show=50"> Wed, 20 Nov 2024 </a> </li><li> <a href="/list/cs.DS/recent?skip=33&show=50"> Tue, 19 Nov 2024 </a> </li><li> <a href="/list/cs.DS/recent?skip=59&show=50"> Mon, 18 Nov 2024 </a> </li></ul> <p>See today's <a id="new-cs.DS" aria-labelledby="new-cs.DS" href="/list/cs.DS/new">new</a> changes</p> <div class='paging'>Total of 63 entries : <span>1-50</span> <a href=/list/cs.DS/recent?skip=50&show=50>51-63</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs.DS/recent?skip=0&show=25 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <a href=/list/cs.DS/recent?skip=0&show=2000 rel="nofollow"> all</a> </div> <dl id='articles'> <h3>Fri, 22 Nov 2024 (showing 12 of 12 entries )</h3> <dt> <a name='item1'>[1]</a> <a href ="/abs/2411.14387" title="Abstract" id="2411.14387"> arXiv:2411.14387 </a> [<a href="/pdf/2411.14387" title="Download PDF" id="pdf-2411.14387" aria-labelledby="pdf-2411.14387">pdf</a>, <a href="/format/2411.14387" title="Other formats" id="oth-2411.14387" aria-labelledby="oth-2411.14387">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Hardness Amplification for Dynamic Binary Search Trees </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Jiang,+S">Shunhua Jiang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lecomte,+V">Victor Lecomte</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Weinstein,+O">Omri Weinstein</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yingchareonthawornchai,+S">Sorrachai Yingchareonthawornchai</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='item2'>[2]</a> <a href ="/abs/2411.14344" title="Abstract" id="2411.14344"> arXiv:2411.14344 </a> [<a href="/pdf/2411.14344" title="Download PDF" id="pdf-2411.14344" aria-labelledby="pdf-2411.14344">pdf</a>, <a href="https://arxiv.org/html/2411.14344v1" title="View HTML" id="html-2411.14344" aria-labelledby="html-2411.14344" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.14344" title="Other formats" id="oth-2411.14344" aria-labelledby="oth-2411.14344">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Overcomplete Tensor Decomposition via Koszul-Young Flattenings </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kothari,+P+K">Pravesh K. Kothari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Moitra,+A">Ankur Moitra</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wein,+A+S">Alexander S. Wein</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 42 pages </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='item3'>[3]</a> <a href ="/abs/2411.14305" title="Abstract" id="2411.14305"> arXiv:2411.14305 </a> [<a href="/pdf/2411.14305" title="Download PDF" id="pdf-2411.14305" aria-labelledby="pdf-2411.14305">pdf</a>, <a href="https://arxiv.org/html/2411.14305v1" title="View HTML" id="html-2411.14305" aria-labelledby="html-2411.14305" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.14305" title="Other formats" id="oth-2411.14305" aria-labelledby="oth-2411.14305">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares </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=Narayanan,+D">Deepak Narayanan Sridharan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Steurer,+D">David Steurer</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Accepted at SODA 2025, 47 pages </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); Machine Learning (stat.ML) </div> </div> </dd> <dt> <a name='item4'>[4]</a> <a href ="/abs/2411.14006" title="Abstract" id="2411.14006"> arXiv:2411.14006 </a> [<a href="/pdf/2411.14006" title="Download PDF" id="pdf-2411.14006" aria-labelledby="pdf-2411.14006">pdf</a>, <a href="https://arxiv.org/html/2411.14006v1" title="View HTML" id="html-2411.14006" aria-labelledby="html-2411.14006" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.14006" title="Other formats" id="oth-2411.14006" aria-labelledby="oth-2411.14006">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ganbarov,+A">Ali Ganbarov</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yuan,+J">Jicheng Yuan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Le-Tuan,+A">Anh Le-Tuan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Hauswirth,+M">Manfred Hauswirth</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Le-Phuoc,+D">Danh Le-Phuoc</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); Computer Vision and Pattern Recognition (cs.CV); Distributed, Parallel, and Cluster Computing (cs.DC); Performance (cs.PF) </div> </div> </dd> <dt> <a name='item5'>[5]</a> <a href ="/abs/2411.13817" title="Abstract" id="2411.13817"> arXiv:2411.13817 </a> [<a href="/pdf/2411.13817" title="Download PDF" id="pdf-2411.13817" aria-labelledby="pdf-2411.13817">pdf</a>, <a href="https://arxiv.org/html/2411.13817v1" title="View HTML" id="html-2411.13817" aria-labelledby="html-2411.13817" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.13817" title="Other formats" id="oth-2411.13817" aria-labelledby="oth-2411.13817">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Zhao,+Z">Zhuowei Zhao</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gan,+J">Junhao Gan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ruan,+B">Boyu Ruan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Bao,+Z">Zhifeng Bao</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Qi,+J">Jianzhong Qi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+S">Sibo Wang</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/2411.13728" title="Abstract" id="2411.13728"> arXiv:2411.13728 </a> [<a href="/pdf/2411.13728" title="Download PDF" id="pdf-2411.13728" aria-labelledby="pdf-2411.13728">pdf</a>, <a href="https://arxiv.org/html/2411.13728v1" title="View HTML" id="html-2411.13728" aria-labelledby="html-2411.13728" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.13728" title="Other formats" id="oth-2411.13728" aria-labelledby="oth-2411.13728">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Distributed Distance Sensitivity Oracles </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Manoharan,+V">Vignesh Manoharan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ramachandran,+V">Vijaya Ramachandran</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/2411.13708" title="Abstract" id="2411.13708"> arXiv:2411.13708 </a> [<a href="/pdf/2411.13708" title="Download PDF" id="pdf-2411.13708" aria-labelledby="pdf-2411.13708">pdf</a>, <a href="https://arxiv.org/html/2411.13708v1" title="View HTML" id="html-2411.13708" aria-labelledby="html-2411.13708" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.13708" title="Other formats" id="oth-2411.13708" aria-labelledby="oth-2411.13708">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs" </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Krawczyk,+T">Tomasz Krawczyk</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Comment on doi:<a href="https://doi.org/10.1137/S0097539793260726" data-doi="10.1137/S0097539793260726" class="link-https link-external" rel="external noopener nofollow">https://doi.org/10.1137/S0097539793260726</a> </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='item8'>[8]</a> <a href ="/abs/2411.14431" title="Abstract" id="2411.14431"> arXiv:2411.14431 </a> (cross-list from cs.CC) [<a href="/pdf/2411.14431" title="Download PDF" id="pdf-2411.14431" aria-labelledby="pdf-2411.14431">pdf</a>, <a href="https://arxiv.org/html/2411.14431v1" title="View HTML" id="html-2411.14431" aria-labelledby="html-2411.14431" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.14431" title="Other formats" id="oth-2411.14431" aria-labelledby="oth-2411.14431">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On Optimal Testing of Linearity </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Arora,+V">Vipul Arora</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kelman,+E">Esty Kelman</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Meir,+U">Uri Meir</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear at SOSA 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Complexity (cs.CC)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item9'>[9]</a> <a href ="/abs/2411.14349" title="Abstract" id="2411.14349"> arXiv:2411.14349 </a> (cross-list from cs.LG) [<a href="/pdf/2411.14349" title="Download PDF" id="pdf-2411.14349" aria-labelledby="pdf-2411.14349">pdf</a>, <a href="https://arxiv.org/html/2411.14349v1" title="View HTML" id="html-2411.14349" aria-labelledby="html-2411.14349" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.14349" title="Other formats" id="oth-2411.14349" aria-labelledby="oth-2411.14349">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Guo,+A">Anxin Guo</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vijayaraghavan,+A">Aravindan Vijayaraghavan</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Machine Learning (cs.LG)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item10'>[10]</a> <a href ="/abs/2411.14336" title="Abstract" id="2411.14336"> arXiv:2411.14336 </a> (cross-list from math.PR) [<a href="/pdf/2411.14336" title="Download PDF" id="pdf-2411.14336" aria-labelledby="pdf-2411.14336">pdf</a>, <a href="https://arxiv.org/html/2411.14336v1" title="View HTML" id="html-2411.14336" aria-labelledby="html-2411.14336" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.14336" title="Other formats" id="oth-2411.14336" aria-labelledby="oth-2411.14336">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Finding the root in random nearest neighbor trees </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Brandenberger,+A">Anna Brandenberger</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Marcussen,+C">Cassandra Marcussen</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Mossel,+E">Elchanan Mossel</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Sudan,+M">Madhu Sudan</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 22 pages, 7 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Probability (math.PR)</span>; Data Structures and Algorithms (cs.DS); Social and Information Networks (cs.SI) </div> </div> </dd> <dt> <a name='item11'>[11]</a> <a href ="/abs/2411.13682" title="Abstract" id="2411.13682"> arXiv:2411.13682 </a> (cross-list from cs.LG) [<a href="/pdf/2411.13682" title="Download PDF" id="pdf-2411.13682" aria-labelledby="pdf-2411.13682">pdf</a>, <a href="https://arxiv.org/html/2411.13682v1" title="View HTML" id="html-2411.13682" aria-labelledby="html-2411.13682" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.13682" title="Other formats" id="oth-2411.13682" aria-labelledby="oth-2411.13682">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Differentially Private Learning Beyond the Classical Dimensionality Regime </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Dwork,+C">Cynthia Dwork</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tankala,+P">Pranay Tankala</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhang,+L">Linjun Zhang</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Machine Learning (cs.LG)</span>; Cryptography and Security (cs.CR); Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item12'>[12]</a> <a href ="/abs/2411.13601" title="Abstract" id="2411.13601"> arXiv:2411.13601 </a> (cross-list from stat.CO) [<a href="/pdf/2411.13601" title="Download PDF" id="pdf-2411.13601" aria-labelledby="pdf-2411.13601">pdf</a>, <a href="/format/2411.13601" title="Other formats" id="oth-2411.13601" aria-labelledby="oth-2411.13601">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Error Analysis of Sum-Product Algorithms under Stochastic Rounding </div> <div class='list-authors'><a href="https://arxiv.org/search/stat?searchtype=author&query=de+Oliveira+Castro,+P">Pablo de Oliveira Castro</a> (LI-PaRAD, UVSQ), <a href="https://arxiv.org/search/stat?searchtype=author&query=Arar,+E+E">El-Mehdi El Arar</a> (IRISA, UR), <a href="https://arxiv.org/search/stat?searchtype=author&query=Petit,+E">Eric Petit</a>, <a href="https://arxiv.org/search/stat?searchtype=author&query=Sohier,+D">Devan Sohier</a> (LI-PaRAD, UVSQ)</div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computation (stat.CO)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> </dl> <dl id='articles'> <h3>Thu, 21 Nov 2024 (showing 7 of 7 entries )</h3> <dt> <a name='item13'>[13]</a> <a href ="/abs/2411.13462" title="Abstract" id="2411.13462"> arXiv:2411.13462 </a> [<a href="/pdf/2411.13462" title="Download PDF" id="pdf-2411.13462" aria-labelledby="pdf-2411.13462">pdf</a>, <a href="https://arxiv.org/html/2411.13462v1" title="View HTML" id="html-2411.13462" aria-labelledby="html-2411.13462" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.13462" title="Other formats" id="oth-2411.13462" aria-labelledby="oth-2411.13462">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Sampling and Integration of Logconcave Functions by Algorithmic Diffusion </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kook,+Y">Yunbum Kook</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vempala,+S+S">Santosh S. Vempala</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 60 pages, 1 figure </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); Statistics Theory (math.ST); Machine Learning (stat.ML) </div> </div> </dd> <dt> <a name='item14'>[14]</a> <a href ="/abs/2411.13374" title="Abstract" id="2411.13374"> arXiv:2411.13374 </a> [<a href="/pdf/2411.13374" title="Download PDF" id="pdf-2411.13374" aria-labelledby="pdf-2411.13374">pdf</a>, <a href="/format/2411.13374" title="Other formats" id="oth-2411.13374" aria-labelledby="oth-2411.13374">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Krawczyk,+T">Tomasz Krawczyk</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 84 pages </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/2411.12976" title="Abstract" id="2411.12976"> arXiv:2411.12976 </a> [<a href="/pdf/2411.12976" title="Download PDF" id="pdf-2411.12976" aria-labelledby="pdf-2411.12976">pdf</a>, <a href="https://arxiv.org/html/2411.12976v1" title="View HTML" id="html-2411.12976" aria-labelledby="html-2411.12976" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12976" title="Other formats" id="oth-2411.12976" aria-labelledby="oth-2411.12976">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hwang,+S">Samuel Hwang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Singer,+N+G">Noah G. Singer</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Velusamy,+S">Santhoshini Velusamy</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 17 pages, 7 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='item16'>[16]</a> <a href ="/abs/2411.13513" title="Abstract" id="2411.13513"> arXiv:2411.13513 </a> (cross-list from cs.GT) [<a href="/pdf/2411.13513" title="Download PDF" id="pdf-2411.13513" aria-labelledby="pdf-2411.13513">pdf</a>, <a href="https://arxiv.org/html/2411.13513v1" title="View HTML" id="html-2411.13513" aria-labelledby="html-2411.13513" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.13513" title="Other formats" id="oth-2411.13513" aria-labelledby="oth-2411.13513">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Procurement Auctions via Approximately Optimal Submodular Optimization </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Deng,+Y">Yuan Deng</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Karbasi,+A">Amin Karbasi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mirrokni,+V">Vahab Mirrokni</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Leme,+R+P">Renato Paes Leme</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Velegkas,+G">Grigoris Velegkas</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zuo,+S">Song Zuo</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computer Science and Game Theory (cs.GT)</span>; Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG) </div> </div> </dd> <dt> <a name='item17'>[17]</a> <a href ="/abs/2411.13171" title="Abstract" id="2411.13171"> arXiv:2411.13171 </a> (cross-list from cs.CG) [<a href="/pdf/2411.13171" title="Download PDF" id="pdf-2411.13171" aria-labelledby="pdf-2411.13171">pdf</a>, <a href="/format/2411.13171" title="Other formats" id="oth-2411.13171" aria-labelledby="oth-2411.13171">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Parameterized Geometric Graph Modification with Disk Scaling </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Fomin,+F+V">Fedor V. Fomin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Golovach,+P+A">Petr A. Golovach</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Inamdar,+T">Tanmay Inamdar</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Saurabh,+S">Saket Saurabh</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zehavi,+M">Meirav Zehavi</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear in ITCS 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Geometry (cs.CG)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item18'>[18]</a> <a href ="/abs/2411.13141" title="Abstract" id="2411.13141"> arXiv:2411.13141 </a> (cross-list from cs.CC) [<a href="/pdf/2411.13141" title="Download PDF" id="pdf-2411.13141" aria-labelledby="pdf-2411.13141">pdf</a>, <a href="https://arxiv.org/html/2411.13141v1" title="View HTML" id="html-2411.13141" aria-labelledby="html-2411.13141" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.13141" title="Other formats" id="oth-2411.13141" aria-labelledby="oth-2411.13141">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> (Independent) Roman Domination Parameterized by Distance to Cluster </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ashok,+P">Pradeesha Ashok</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Das,+G+K">Gautam K. Das</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pandey,+A">Arti Pandey</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Paul,+K">Kaustav Paul</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Paul,+S">Subhabrata Paul</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> arXiv admin note: text overlap with <a href="https://arxiv.org/abs/2405.10556" data-arxiv-id="2405.10556" class="link-https">arXiv:2405.10556</a> by other authors </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Complexity (cs.CC)</span>; Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item19'>[19]</a> <a href ="/abs/2411.13083" title="Abstract" id="2411.13083"> arXiv:2411.13083 </a> (cross-list from cs.LG) [<a href="/pdf/2411.13083" title="Download PDF" id="pdf-2411.13083" aria-labelledby="pdf-2411.13083">pdf</a>, <a href="https://arxiv.org/html/2411.13083v1" title="View HTML" id="html-2411.13083" aria-labelledby="html-2411.13083" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.13083" title="Other formats" id="oth-2411.13083" aria-labelledby="oth-2411.13083">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Omnipredicting Single-Index Models with Multi-Index Models </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hu,+L">Lunjia Hu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tian,+K">Kevin Tian</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yang,+C">Chutong Yang</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Machine Learning (cs.LG)</span>; Data Structures and Algorithms (cs.DS); Optimization and Control (math.OC); Machine Learning (stat.ML) </div> </div> </dd> </dl> <dl id='articles'> <h3>Wed, 20 Nov 2024 (showing 14 of 14 entries )</h3> <dt> <a name='item20'>[20]</a> <a href ="/abs/2411.12694" title="Abstract" id="2411.12694"> arXiv:2411.12694 </a> [<a href="/pdf/2411.12694" title="Download PDF" id="pdf-2411.12694" aria-labelledby="pdf-2411.12694">pdf</a>, <a href="https://arxiv.org/html/2411.12694v2" title="View HTML" id="html-2411.12694" aria-labelledby="html-2411.12694" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12694" title="Other formats" id="oth-2411.12694" aria-labelledby="oth-2411.12694">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Local Density and its Distributed Approximation </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Christiansen,+A+B">Aleksander Bj酶rn Christiansen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=van+der+Hoog,+I">Ivor van der Hoog</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rotenberg,+E">Eva Rotenberg</a></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='item21'>[21]</a> <a href ="/abs/2411.12439" title="Abstract" id="2411.12439"> arXiv:2411.12439 </a> [<a href="/pdf/2411.12439" title="Download PDF" id="pdf-2411.12439" aria-labelledby="pdf-2411.12439">pdf</a>, <a href="https://arxiv.org/html/2411.12439v1" title="View HTML" id="html-2411.12439" aria-labelledby="html-2411.12439" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12439" title="Other formats" id="oth-2411.12439" aria-labelledby="oth-2411.12439">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Diaz-Dominguez,+D">Diego Diaz-Dominguez</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='item22'>[22]</a> <a href ="/abs/2411.12438" title="Abstract" id="2411.12438"> arXiv:2411.12438 </a> [<a href="/pdf/2411.12438" title="Download PDF" id="pdf-2411.12438" aria-labelledby="pdf-2411.12438">pdf</a>, <a href="/format/2411.12438" title="Other formats" id="oth-2411.12438" aria-labelledby="oth-2411.12438">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Anderson,+P">Prashanti Anderson</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Bafna,+M">Mitali Bafna</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Buhai,+R">Rares-Darius Buhai</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kothari,+P+K">Pravesh K. Kothari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Steurer,+D">David Steurer</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 64 pages </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); Machine Learning (stat.ML) </div> </div> </dd> <dt> <a name='item23'>[23]</a> <a href ="/abs/2411.12365" title="Abstract" id="2411.12365"> arXiv:2411.12365 </a> [<a href="/pdf/2411.12365" title="Download PDF" id="pdf-2411.12365" aria-labelledby="pdf-2411.12365">pdf</a>, <a href="/format/2411.12365" title="Other formats" id="oth-2411.12365" aria-labelledby="oth-2411.12365">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Becht,+M">Matthias Becht</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lehmann,+H">Hans-Peter Lehmann</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sanders,+P">Peter Sanders</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='item24'>[24]</a> <a href ="/abs/2411.12241" title="Abstract" id="2411.12241"> arXiv:2411.12241 </a> [<a href="/pdf/2411.12241" title="Download PDF" id="pdf-2411.12241" aria-labelledby="pdf-2411.12241">pdf</a>, <a href="https://arxiv.org/html/2411.12241v1" title="View HTML" id="html-2411.12241" aria-labelledby="html-2411.12241" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12241" title="Other formats" id="oth-2411.12241" aria-labelledby="oth-2411.12241">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Osterkamp,+E+M">Eric M. Osterkamp</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=K%C3%B6ppl,+D">Dominik K枚ppl</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/2411.12160" title="Abstract" id="2411.12160"> arXiv:2411.12160 </a> [<a href="/pdf/2411.12160" title="Download PDF" id="pdf-2411.12160" aria-labelledby="pdf-2411.12160">pdf</a>, <a href="https://arxiv.org/html/2411.12160v1" title="View HTML" id="html-2411.12160" aria-labelledby="html-2411.12160" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12160" title="Other formats" id="oth-2411.12160" aria-labelledby="oth-2411.12160">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Space-Efficient Online Computation of String Net Occurrences </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Mieno,+T">Takuya Mieno</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='item26'>[26]</a> <a href ="/abs/2411.12099" title="Abstract" id="2411.12099"> arXiv:2411.12099 </a> [<a href="/pdf/2411.12099" title="Download PDF" id="pdf-2411.12099" aria-labelledby="pdf-2411.12099">pdf</a>, <a href="https://arxiv.org/html/2411.12099v2" title="View HTML" id="html-2411.12099" aria-labelledby="html-2411.12099" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12099" title="Other formats" id="oth-2411.12099" aria-labelledby="oth-2411.12099">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Sorted Consecutive Occurrence Queries in Substrings </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Akram,+W">Waseem Akram</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mieno,+T">Takuya Mieno</a></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='item27'>[27]</a> <a href ="/abs/2411.12069" title="Abstract" id="2411.12069"> arXiv:2411.12069 </a> [<a href="/pdf/2411.12069" title="Download PDF" id="pdf-2411.12069" aria-labelledby="pdf-2411.12069">pdf</a>, <a href="https://arxiv.org/html/2411.12069v1" title="View HTML" id="html-2411.12069" aria-labelledby="html-2411.12069" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12069" title="Other formats" id="oth-2411.12069" aria-labelledby="oth-2411.12069">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Matroid Secretary via Labeling Schemes </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=B%C3%A9rczi,+K">Krist贸f B茅rczi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Livanos,+V">Vasilis Livanos</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Soto,+J">Jos茅 Soto</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Verdugo,+V">Victor Verdugo</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 35 pages, 3 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='item28'>[28]</a> <a href ="/abs/2411.12035" title="Abstract" id="2411.12035"> arXiv:2411.12035 </a> [<a href="/pdf/2411.12035" title="Download PDF" id="pdf-2411.12035" aria-labelledby="pdf-2411.12035">pdf</a>, <a href="https://arxiv.org/html/2411.12035v1" title="View HTML" id="html-2411.12035" aria-labelledby="html-2411.12035" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12035" title="Other formats" id="oth-2411.12035" aria-labelledby="oth-2411.12035">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Parsing Millions of DNS Records per Second </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Koekkoek,+J">Jeroen Koekkoek</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lemire,+D">Daniel Lemire</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> software at <a href="https://github.com/NLnetLabs/simdzone" rel="external noopener nofollow" class="link-external link-https">this https URL</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='item29'>[29]</a> <a href ="/abs/2411.12730" title="Abstract" id="2411.12730"> arXiv:2411.12730 </a> (cross-list from quant-ph) [<a href="/pdf/2411.12730" title="Download PDF" id="pdf-2411.12730" aria-labelledby="pdf-2411.12730">pdf</a>, <a href="/format/2411.12730" title="Other formats" id="oth-2411.12730" aria-labelledby="oth-2411.12730">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Testing classical properties from quantum data </div> <div class='list-authors'><a href="https://arxiv.org/search/quant-ph?searchtype=author&query=Caro,+M+C">Matthias C. Caro</a>, <a href="https://arxiv.org/search/quant-ph?searchtype=author&query=Naik,+P">Preksha Naik</a>, <a href="https://arxiv.org/search/quant-ph?searchtype=author&query=Slote,+J">Joseph Slote</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 38 + 14 pages, 2 tables, 2 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Quantum Physics (quant-ph)</span>; Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG) </div> </div> </dd> <dt> <a name='item30'>[30]</a> <a href ="/abs/2411.12700" title="Abstract" id="2411.12700"> arXiv:2411.12700 </a> (cross-list from cs.LG) [<a href="/pdf/2411.12700" title="Download PDF" id="pdf-2411.12700" aria-labelledby="pdf-2411.12700">pdf</a>, <a href="/format/2411.12700" title="Other formats" id="oth-2411.12700" aria-labelledby="oth-2411.12700">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Learning multivariate Gaussians with imperfect advice </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=Choo,+D">Davin Choo</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=John,+P+G">Philips George John</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gouleakis,+T">Themis Gouleakis</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Machine Learning (cs.LG)</span>; Data Structures and Algorithms (cs.DS); Information Theory (cs.IT); Machine Learning (stat.ML) </div> </div> </dd> <dt> <a name='item31'>[31]</a> <a href ="/abs/2411.12696" title="Abstract" id="2411.12696"> arXiv:2411.12696 </a> (cross-list from cs.GT) [<a href="/pdf/2411.12696" title="Download PDF" id="pdf-2411.12696" aria-labelledby="pdf-2411.12696">pdf</a>, <a href="https://arxiv.org/html/2411.12696v1" title="View HTML" id="html-2411.12696" aria-labelledby="html-2411.12696" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12696" title="Other formats" id="oth-2411.12696" aria-labelledby="oth-2411.12696">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Weighted Envy Freeness With Limited Subsidies </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Elmalem,+N+K">Noga Klein Elmalem</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gonen,+R">Rica Gonen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Segal-Halevi,+E">Erel Segal-Halevi</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 45 pages, 1 table </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computer Science and Game Theory (cs.GT)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item32'>[32]</a> <a href ="/abs/2411.12582" title="Abstract" id="2411.12582"> arXiv:2411.12582 </a> (cross-list from math.CO) [<a href="/pdf/2411.12582" title="Download PDF" id="pdf-2411.12582" aria-labelledby="pdf-2411.12582">pdf</a>, <a href="https://arxiv.org/html/2411.12582v2" title="View HTML" id="html-2411.12582" aria-labelledby="html-2411.12582" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12582" title="Other formats" id="oth-2411.12582" aria-labelledby="oth-2411.12582">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Reconfiguration Using Generalized Token Jumping </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=K%C5%99i%C5%A1%C5%A5an,+J+M">Jan Maty谩拧 K艡i拧钮an</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Svoboda,+J">Jakub Svoboda</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear at WALCOM 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item33'>[33]</a> <a href ="/abs/2411.12360" title="Abstract" id="2411.12360"> arXiv:2411.12360 </a> (cross-list from cs.CR) [<a href="/pdf/2411.12360" title="Download PDF" id="pdf-2411.12360" aria-labelledby="pdf-2411.12360">pdf</a>, <a href="https://arxiv.org/html/2411.12360v1" title="View HTML" id="html-2411.12360" aria-labelledby="html-2411.12360" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.12360" title="Other formats" id="oth-2411.12360" aria-labelledby="oth-2411.12360">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> An Affine Equivalence Algorithm for S-boxes based on Matrix Invariants </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hu,+X">Xincheng Hu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zeng,+X">Xiao Zeng</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Liu,+Z">Zhaoqiang Liu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yang,+G">Guowu Yang</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Cryptography and Security (cs.CR)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> </dl> <dl id='articles'> <h3>Tue, 19 Nov 2024 (showing first 17 of 26 entries )</h3> <dt> <a name='item34'>[34]</a> <a href ="/abs/2411.11781" title="Abstract" id="2411.11781"> arXiv:2411.11781 </a> [<a href="/pdf/2411.11781" title="Download PDF" id="pdf-2411.11781" aria-labelledby="pdf-2411.11781">pdf</a>, <a href="https://arxiv.org/html/2411.11781v1" title="View HTML" id="html-2411.11781" aria-labelledby="html-2411.11781" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11781" title="Other formats" id="oth-2411.11781" aria-labelledby="oth-2411.11781">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Towards Scalable and Practical Batch-Dynamic Connectivity </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=De+Man,+Q">Quinten De Man</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Dhulipala,+L">Laxman Dhulipala</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Karczmarz,+A">Adam Karczmarz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=%C5%81%C4%85cki,+J">Jakub 艁膮cki</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shun,+J">Julian Shun</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+Z">Zhongqi Wang</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> This is a preliminary version of a paper that will appear at VLDB'25 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Databases (cs.DB); Distributed, Parallel, and Cluster Computing (cs.DC) </div> </div> </dd> <dt> <a name='item35'>[35]</a> <a href ="/abs/2411.11741" title="Abstract" id="2411.11741"> arXiv:2411.11741 </a> [<a href="/pdf/2411.11741" title="Download PDF" id="pdf-2411.11741" aria-labelledby="pdf-2411.11741">pdf</a>, <a href="https://arxiv.org/html/2411.11741v2" title="View HTML" id="html-2411.11741" aria-labelledby="html-2411.11741" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11741" title="Other formats" id="oth-2411.11741" aria-labelledby="oth-2411.11741">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Alon,+N">Noga Alon</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gravin,+N">Nick Gravin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pollner,+T">Tristan Pollner</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rubinstein,+A">Aviad Rubinstein</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+H">Hongao Wang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Weinberg,+S+M">S. Matthew Weinberg</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhang,+Q">Qianfan Zhang</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear in ITCS 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Probability (math.PR) </div> </div> </dd> <dt> <a name='item36'>[36]</a> <a href ="/abs/2411.11544" title="Abstract" id="2411.11544"> arXiv:2411.11544 </a> [<a href="/pdf/2411.11544" title="Download PDF" id="pdf-2411.11544" aria-labelledby="pdf-2411.11544">pdf</a>, <a href="https://arxiv.org/html/2411.11544v1" title="View HTML" id="html-2411.11544" aria-labelledby="html-2411.11544" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11544" title="Other formats" id="oth-2411.11544" aria-labelledby="oth-2411.11544">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Complexity Landscape of Dynamic Distributed Subgraph Finding </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chang,+Y">Yi-Jun Chang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Chen,+L">Lyuting Chen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Chen,+Y">Yanyu Chen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mishra,+G">Gopinath Mishra</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yang,+M">Mingyang Yang</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 37 Pages </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/2411.11426" title="Abstract" id="2411.11426"> arXiv:2411.11426 </a> [<a href="/pdf/2411.11426" title="Download PDF" id="pdf-2411.11426" aria-labelledby="pdf-2411.11426">pdf</a>, <a href="https://arxiv.org/html/2411.11426v1" title="View HTML" id="html-2411.11426" aria-labelledby="html-2411.11426" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11426" title="Other formats" id="oth-2411.11426" aria-labelledby="oth-2411.11426">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> SpiderDAN: Matching Augmentation in Demand-Aware Networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Figiel,+A">Aleksander Figiel</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Melnyk,+D">Darya Melnyk</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Nichterlein,+A">Andr茅 Nichterlein</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pourdamghani,+A">Arash Pourdamghani</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Schmid,+S">Stefan Schmid</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> This paper has been accepted to SIAM Symposium on Algorithm Engineering and Experiments (ALENEX25) </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/2411.11277" title="Abstract" id="2411.11277"> arXiv:2411.11277 </a> [<a href="/pdf/2411.11277" title="Download PDF" id="pdf-2411.11277" aria-labelledby="pdf-2411.11277">pdf</a>, <a href="https://arxiv.org/html/2411.11277v1" title="View HTML" id="html-2411.11277" aria-labelledby="html-2411.11277" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11277" title="Other formats" id="oth-2411.11277" aria-labelledby="oth-2411.11277">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Massively Parallel Maximum Coverage Revisited </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Bui,+T">Thai Bui</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vu,+H+T">Hoa T. Vu</a></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='item39'>[39]</a> <a href ="/abs/2411.11136" title="Abstract" id="2411.11136"> arXiv:2411.11136 </a> [<a href="/pdf/2411.11136" title="Download PDF" id="pdf-2411.11136" aria-labelledby="pdf-2411.11136">pdf</a>, <a href="https://arxiv.org/html/2411.11136v1" title="View HTML" id="html-2411.11136" aria-labelledby="html-2411.11136" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11136" title="Other formats" id="oth-2411.11136" aria-labelledby="oth-2411.11136">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Approximation algorithms for non-sequential star packing problems </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hu,+M">Mengyuan Hu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhang,+A">An Zhang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Chen,+Y">Yong Chen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gong,+M">Mingyang Gong</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lin,+G">Guohui Lin</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Accepted for presentation in WALCOM 2025 </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='item40'>[40]</a> <a href ="/abs/2411.11054" title="Abstract" id="2411.11054"> arXiv:2411.11054 </a> [<a href="/pdf/2411.11054" title="Download PDF" id="pdf-2411.11054" aria-labelledby="pdf-2411.11054">pdf</a>, <a href="https://arxiv.org/html/2411.11054v1" title="View HTML" id="html-2411.11054" aria-labelledby="html-2411.11054" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11054" title="Other formats" id="oth-2411.11054" aria-labelledby="oth-2411.11054">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Parter,+M">Merav Parter</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tzalik,+E">Elad Tzalik</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear in SOSA 2025. 11 pages </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/2411.11051" title="Abstract" id="2411.11051"> arXiv:2411.11051 </a> [<a href="/pdf/2411.11051" title="Download PDF" id="pdf-2411.11051" aria-labelledby="pdf-2411.11051">pdf</a>, <a href="https://arxiv.org/html/2411.11051v1" title="View HTML" id="html-2411.11051" aria-labelledby="html-2411.11051" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11051" title="Other formats" id="oth-2411.11051" aria-labelledby="oth-2411.11051">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Amortized Analysis of Leftist Heaps </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Schoenmakers,+B">Berry Schoenmakers</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 13 pages, 3 figures, full version (incl. Appendix B) </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Principles of Verification: Cycling the Probabilistic Landscape, Part I, LNCS 15260, Springer 2024, pp. 73-84 </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/2411.11049" title="Abstract" id="2411.11049"> arXiv:2411.11049 </a> [<a href="/pdf/2411.11049" title="Download PDF" id="pdf-2411.11049" aria-labelledby="pdf-2411.11049">pdf</a>, <a href="https://arxiv.org/html/2411.11049v1" title="View HTML" id="html-2411.11049" aria-labelledby="html-2411.11049" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11049" title="Other formats" id="oth-2411.11049" aria-labelledby="oth-2411.11049">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Fault-Equivalent Lowest Common Ancestors </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Petruschka,+A">Asaf Petruschka</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='item43'>[43]</a> <a href ="/abs/2411.10949" title="Abstract" id="2411.10949"> arXiv:2411.10949 </a> [<a href="/pdf/2411.10949" title="Download PDF" id="pdf-2411.10949" aria-labelledby="pdf-2411.10949">pdf</a>, <a href="https://arxiv.org/html/2411.10949v1" title="View HTML" id="html-2411.10949" aria-labelledby="html-2411.10949" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.10949" title="Other formats" id="oth-2411.10949" aria-labelledby="oth-2411.10949">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Maximization of Approximately Submodular Functions </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Horel,+T">Thibaut Horel</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Singer,+Y">Yaron Singer</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 12 pages </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Advances in Neural Information Processing Systems 29, NeurIPS 2016, pp. 3045-3053 </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='item44'>[44]</a> <a href ="/abs/2411.10707" title="Abstract" id="2411.10707"> arXiv:2411.10707 </a> [<a href="/pdf/2411.10707" title="Download PDF" id="pdf-2411.10707" aria-labelledby="pdf-2411.10707">pdf</a>, <a href="https://arxiv.org/html/2411.10707v1" title="View HTML" id="html-2411.10707" aria-labelledby="html-2411.10707" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.10707" title="Other formats" id="oth-2411.10707" aria-labelledby="oth-2411.10707">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Nerem,+R+R">Robert R. Nerem</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Luo,+Z">Zhishang Luo</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rafiey,+A">Akbar Rafiey</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+Y">Yusu Wang</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) </div> </div> </dd> <dt> <a name='item45'>[45]</a> <a href ="/abs/2411.10653" title="Abstract" id="2411.10653"> arXiv:2411.10653 </a> [<a href="/pdf/2411.10653" title="Download PDF" id="pdf-2411.10653" aria-labelledby="pdf-2411.10653">pdf</a>, <a href="https://arxiv.org/html/2411.10653v1" title="View HTML" id="html-2411.10653" aria-labelledby="html-2411.10653" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.10653" title="Other formats" id="oth-2411.10653" aria-labelledby="oth-2411.10653">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Hardness Results on Characteristics for Elastic-Degenerated Strings </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=K%C3%B6ppl,+D">Dominik K枚ppl</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Olbrich,+J">Jannik Olbrich</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='item46'>[46]</a> <a href ="/abs/2411.11722" title="Abstract" id="2411.11722"> arXiv:2411.11722 </a> (cross-list from math.OC) [<a href="/pdf/2411.11722" title="Download PDF" id="pdf-2411.11722" aria-labelledby="pdf-2411.11722">pdf</a>, <a href="https://arxiv.org/html/2411.11722v1" title="View HTML" id="html-2411.11722" aria-labelledby="html-2411.11722" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11722" title="Other formats" id="oth-2411.11722" aria-labelledby="oth-2411.11722">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Solving convex QPs with structured sparsity under indicator conditions </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Bienstock,+D">Daniel Bienstock</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Chen,+T">Tongtong Chen</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Optimization and Control (math.OC)</span>; Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item47'>[47]</a> <a href ="/abs/2411.11718" title="Abstract" id="2411.11718"> arXiv:2411.11718 </a> (cross-list from cs.DC) [<a href="/pdf/2411.11718" title="Download PDF" id="pdf-2411.11718" aria-labelledby="pdf-2411.11718">pdf</a>, <a href="https://arxiv.org/html/2411.11718v1" title="View HTML" id="html-2411.11718" aria-labelledby="html-2411.11718" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11718" title="Other formats" id="oth-2411.11718" aria-labelledby="oth-2411.11718">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Distributed Maximum Flow in Planar Graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Abd-Elhaleem,+Y">Yaseen Abd-Elhaleem</a> (1), <a href="https://arxiv.org/search/cs?searchtype=author&query=Dory,+M">Michal Dory</a> (1), <a href="https://arxiv.org/search/cs?searchtype=author&query=Parter,+M">Merav Parter</a> (2), <a href="https://arxiv.org/search/cs?searchtype=author&query=Weimann,+O">Oren Weimann</a> (1) ((1) University of Haifa, (2) Weizmann Institute of Science)</div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 54 pages, a short version about this work has appeared as a brief announcement in DISC 2024 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Distributed, Parallel, and Cluster Computing (cs.DC)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item48'>[48]</a> <a href ="/abs/2411.11665" title="Abstract" id="2411.11665"> arXiv:2411.11665 </a> (cross-list from cs.DC) [<a href="/pdf/2411.11665" title="Download PDF" id="pdf-2411.11665" aria-labelledby="pdf-2411.11665">pdf</a>, <a href="https://arxiv.org/html/2411.11665v1" title="View HTML" id="html-2411.11665" aria-labelledby="html-2411.11665" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11665" title="Other formats" id="oth-2411.11665" aria-labelledby="oth-2411.11665">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Hash & Adjust: Competitive Demand-Aware Consistent Hashing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Pourdamghani,+A">Arash Pourdamghani</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Avin,+C">Chen Avin</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sama,+R">Robert Sama</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shiran,+M">Maryam Shiran</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Schmid,+S">Stefan Schmid</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> This paper has been accepted to International Conference on Principles of Distributed Systems (OPODIS 2024) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Distributed, Parallel, and Cluster Computing (cs.DC)</span>; Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item49'>[49]</a> <a href ="/abs/2411.11627" title="Abstract" id="2411.11627"> arXiv:2411.11627 </a> (cross-list from math.CO) [<a href="/pdf/2411.11627" title="Download PDF" id="pdf-2411.11627" aria-labelledby="pdf-2411.11627">pdf</a>, <a href="https://arxiv.org/html/2411.11627v1" title="View HTML" id="html-2411.11627" aria-labelledby="html-2411.11627" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11627" title="Other formats" id="oth-2411.11627" aria-labelledby="oth-2411.11627">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Hsieh,+J">Jun-Ting Hsieh</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Lin,+T">Ting-Chun Lin</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Mohanty,+S">Sidhanth Mohanty</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=O'Donnell,+R">Ryan O'Donnell</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Zhang,+R+Y">Rachel Yun Zhang</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 28 pages </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item50'>[50]</a> <a href ="/abs/2411.11516" title="Abstract" id="2411.11516"> arXiv:2411.11516 </a> (cross-list from cs.LG) [<a href="/pdf/2411.11516" title="Download PDF" id="pdf-2411.11516" aria-labelledby="pdf-2411.11516">pdf</a>, <a href="https://arxiv.org/html/2411.11516v1" title="View HTML" id="html-2411.11516" aria-labelledby="html-2411.11516" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2411.11516" title="Other formats" id="oth-2411.11516" aria-labelledby="oth-2411.11516">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Gayen,+S">Sutanu Gayen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kale,+S">Sanket Kale</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sen,+S">Sayantan Sen</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 47 pages, 16 figures, abstract shortened as per arXiv criteria </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Machine Learning (cs.LG)</span>; Data Structures and Algorithms (cs.DS); Machine Learning (stat.ML) </div> </div> </dd> </dl> <div class='paging'>Total of 63 entries : <span>1-50</span> <a href=/list/cs.DS/recent?skip=50&show=50>51-63</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs.DS/recent?skip=0&show=25 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <a href=/list/cs.DS/recent?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

Data Structures and Algorithms