<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/themes/root/assets/xsl/rss.xsl"?>
<rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/">
  <channel>
    <title>Results for Fast Algorithm</title>
    <description>Showing 1 - 50 results of 455</description>
    <generator>Laminas_Feed_Writer 2 (https://getlaminas.org)</generator>
    <link>https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;lookfor=Fast+Algorithm&amp;type=AllFields&amp;lng=en</link>
    <opensearch:totalResults>455</opensearch:totalResults>
    <opensearch:startIndex>0</opensearch:startIndex>
    <opensearch:itemsPerPage>50</opensearch:itemsPerPage>
    <opensearch:Query role="request" searchTerms="Fast%20Algorithm" startIndex="0"/>
    <atom:link rel="first" type="application/rss+xml" title="Go to First Page" href="https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=Fast+Algorithm&amp;type=AllFields&amp;lng=en"/>
    <atom:link rel="next" type="application/rss+xml" title="Go to Next Page" href="https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=Fast+Algorithm&amp;type=AllFields&amp;lng=en&amp;page=2"/>
    <atom:link rel="last" type="application/rss+xml" title="Go to Last Page" href="https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=Fast+Algorithm&amp;type=AllFields&amp;lng=en&amp;page=10"/>
    <atom:link rel="self" type="application/rss+xml" href="https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=Fast+Algorithm&amp;type=AllFields&amp;lng=en"/>
    <item>
      <title>Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code</title>
      <pubDate>Fri, 01 Jan 2016 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1603_06757</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1603_06757</guid>
      <author>Hernando, Fernando</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Hernando, Fernando</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Similarity Sketching</title>
      <pubDate>Sun, 01 Jan 2017 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1704_04370</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1704_04370</guid>
      <author>Dahlgaard, Søren</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2017</dc:date>
      <dc:creator>Dahlgaard, Søren</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Contraction Clustering (RASTER): A Very Fast Big Data Algorithm for Sequential and Parallel Density-Based Clustering in Linear Time, Constant Memory, and a Single Pass</title>
      <pubDate>Tue, 01 Jan 2019 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1907_03620</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1907_03620</guid>
      <author>Ulm, Gregor</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Ulm, Gregor</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Fast and Adaptive Algorithm to Compute the X-ray Transform</title>
      <pubDate>Wed, 01 Jan 2020 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2006_00686</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2006_00686</guid>
      <author>Chen, Chong</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Chen, Chong</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint</title>
      <pubDate>Wed, 01 Jan 2020 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2007_05014</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2007_05014</guid>
      <author>Amanatidis, Georgios</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Amanatidis, Georgios</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithms</title>
      <pubDate>Wed, 01 Jan 2020 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2008_05171</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2008_05171</guid>
      <author>Schubert, Erich</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Schubert, Erich</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Approximate CoSimRanks via Random Projections</title>
      <pubDate>Wed, 01 Jan 2020 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2010_11880</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2010_11880</guid>
      <author>Yang, Renchi</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Yang, Renchi</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation</title>
      <pubDate>Wed, 01 Jan 2020 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2012_10026</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2012_10026</guid>
      <author>Jiang, Zite</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Jiang, Zite</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Fast-Detection and Fault-Correction Algorithm against Persistent Fault Attack</title>
      <pubDate>Fri, 01 Jan 2021 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2106_07943</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2106_07943</guid>
      <author>Cheng, Yukun</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Cheng, Yukun</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions</title>
      <pubDate>Fri, 01 Jan 2021 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2106_15596</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2106_15596</guid>
      <author>Le, Hung</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Le, Hung</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Solving Linear Programs with Fast Online Learning Algorithms</title>
      <pubDate>Fri, 01 Jan 2021 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2107_03570</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2107_03570</guid>
      <author>Gao, Wenzhi</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Gao, Wenzhi</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Noisy (Binary) Searching: Simple, Fast and Correct</title>
      <pubDate>Fri, 01 Jan 2021 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2107_05753</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2107_05753</guid>
      <author>Dereniowski, Dariusz</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Dereniowski, Dariusz</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Algorithms for Minimum Homology Basis</title>
      <pubDate>Fri, 01 Jan 2021 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2109_04567</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2109_04567</guid>
      <author>Dhar, Amritendu</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Dhar, Amritendu</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Stabilization and Variations to the Adaptive Local Iterative Filtering Algorithm: the Fast Resampled Iterative Filtering Method</title>
      <pubDate>Fri, 01 Jan 2021 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2111_02764</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2111_02764</guid>
      <author>Barbarino, Giovanni</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Barbarino, Giovanni</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds</title>
      <pubDate>Fri, 01 Jan 2021 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2111_05778</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2111_05778</guid>
      <author>Markuš, Nenad</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Markuš, Nenad</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast and explainable clustering based on sorting</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2202_01456</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2202_01456</guid>
      <author>Chen, Xinye</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Chen, Xinye</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Dynamic Low-Rank Fast Gaussian Transform</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2202_12329</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2202_12329</guid>
      <author>Huang, Baihe</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Huang, Baihe</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2204_14138</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2204_14138</guid>
      <author>Han, Wenchen</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Han, Wenchen</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2205_05211</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2205_05211</guid>
      <author>Dau, Son Hoang</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Dau, Son Hoang</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Stochastic Composite Minimization and an Accelerated Frank-Wolfe Algorithm under Parallelization</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2205_12751</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2205_12751</guid>
      <author>Dubois-Taine, Benjamin</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Dubois-Taine, Benjamin</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2206_05248</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2206_05248</guid>
      <author>Cai, Yang</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Cai, Yang</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Fast Alternating Minimization Algorithm for Coded Aperture Snapshot Spectral Imaging Based on Sparsity and Deep Image Priors</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2206_05647</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2206_05647</guid>
      <author>Zhao, Qile</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Zhao, Qile</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2206_15308</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2206_15308</guid>
      <author>Chen, Zongchen</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Chen, Zongchen</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast algorithms for least square problems with Kronecker lower subsets</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2209_05662</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2209_05662</guid>
      <author>Malik, Osman Asif</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Malik, Osman Asif</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2210_11542</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2210_11542</guid>
      <author>Song, Zhao</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Song, Zhao</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Faster $k$-means++ Algorithm</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2211_15118</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2211_15118</guid>
      <author>Liang, Jiehao</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Liang, Jiehao</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2212_00720</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2212_00720</guid>
      <author>Salvatori, Tommaso</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Salvatori, Tommaso</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Algorithm for Constrained Linear Inverse Problems</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2212_01068</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2212_01068</guid>
      <author>Sheriff, Mohammed Rayyan</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Sheriff, Mohammed Rayyan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast and exact fixed-radius neighbor search based on sorting</title>
      <pubDate>Sat, 01 Jan 2022 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2212_07679</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2212_07679</guid>
      <author>Chen, Xinye</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Chen, Xinye</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Provably Fast and Space-Efficient Parallel Biconnectivity</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2301_01356</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2301_01356</guid>
      <author>Dong, Xiaojun</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Dong, Xiaojun</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>SCOREH+: A High-Order Node Proximity Spectral Clustering on Ratios-of-Eigenvectors Algorithm for Community Detection</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2301_02885</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2301_02885</guid>
      <author>Zhu, Yanhui</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Zhu, Yanhui</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Quantum Algorithms for Trace Distance Estimation</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2301_06783</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2301_06783</guid>
      <author>Wang, Qisheng</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Wang, Qisheng</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2301_13006</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2301_13006</guid>
      <author>Li, Gen</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Li, Gen</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>MLANet: Multi-Level Attention Network with Sub-instruction for Continuous Vision-and-Language Navigation</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2303_01396</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2303_01396</guid>
      <author>He, Zongtao</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>He, Zongtao</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast algorithms for Vizing's theorem on bounded degree graphs</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2303_05408</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2303_05408</guid>
      <author>Bernshteyn, Anton</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Bernshteyn, Anton</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2305_05074</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2305_05074</guid>
      <author>Zhao, Fuheng</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Zhao, Fuheng</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2305_05826</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2305_05826</guid>
      <author>Bhattacharjee, Rajarshi</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Bhattacharjee, Rajarshi</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Structured and Fast Optimization: The Kronecker SGD Algorithm</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2305_08001</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2305_08001</guid>
      <author>Song, Zhao</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Song, Zhao</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast and Efficient Matching Algorithm with Deadline Instances</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2305_08353</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2305_08353</guid>
      <author>Song, Zhao</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Song, Zhao</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Fast Algorithm for Computing Prefix Probabilities</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_02303</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_02303</guid>
      <author>Nowak, Franz</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Nowak, Franz</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Orthogonal Extended Infomax Algorithm</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_09180</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_09180</guid>
      <author>Ille, Nicole</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Ille, Nicole</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Fast Algorithm for the Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_09202</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_09202</guid>
      <author>Nakamura, Shintaro</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Nakamura, Shintaro</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_09332</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_09332</guid>
      <author>Qin, Yilong</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Qin, Yilong</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_10506</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_10506</guid>
      <author>Cheng, Xiang</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Cheng, Xiang</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_10648</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_10648</guid>
      <author>Gravin, Nickolai</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Gravin, Nickolai</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast quantum algorithm for differential equations</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_11802</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_11802</guid>
      <author>Bagherimehrab, Mohsen</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Bagherimehrab, Mohsen</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Practical Compression of Deterministic Finite Automata</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_12771</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2306_12771</guid>
      <author>Bille, Philip</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Bille, Philip</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2308_01037</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2308_01037</guid>
      <author>Guidotti, Nicolas L.</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Guidotti, Nicolas L.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Pre-gated MoE: An Algorithm-System Co-Design for Fast and Scalable Mixture-of-Expert Inference</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2308_12066</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2308_12066</guid>
      <author>Hwang, Ranggi</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Hwang, Ranggi</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms</title>
      <pubDate>Sun, 01 Jan 2023 04:48:18 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2309_00591</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_2309_00591</guid>
      <author>Zhang, Qining</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Zhang, Qining</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
  </channel>
</rss>
