1. <code id="md54j"></code>
      <big id="md54j"><em id="md54j"></em></big>

        <code id="md54j"><nobr id="md54j"><samp id="md54j"></samp></nobr></code>
        <dfn id="md54j"><option id="md54j"><sub id="md54j"></sub></option></dfn>
        1. <th id="md54j"></th>

          Mirror operated in collaboration with local support

          Data Structures and Algorithms

          Authors and titles for recent submissions

          [ total of 37 entries: 1-25 | 26-37 ]
          [ showing 25 entries per page: fewer | more | all ]

          Thu, 21 May 2020

          [1]  arXiv:2005.10095 [pdf, ps, other]
          Title: The K-Centre Problem for Necklaces
          Subjects: Data Structures and Algorithms (cs.DS)
          [2]  arXiv:2005.10029 [pdf, ps, other]
          Title: An FPRAS and Polynomial-Time Uniform Sampler for Tree Automata
          Subjects: Data Structures and Algorithms (cs.DS)
          [3]  arXiv:2005.09796 [pdf, ps, other]
          Title: List Decodable Mean Estimation in Nearly Linear Time
          Subjects: Data Structures and Algorithms (cs.DS)
          [4]  arXiv:2005.09724 [pdf, other]
          Title: Scheduling Flows on a Switch to Optimize Response Times
          Subjects: Data Structures and Algorithms (cs.DS)

          Wed, 20 May 2020

          [5]  arXiv:2005.09599 [pdf, other]
          Title: Asymmetric scale functions for $t$-digests
          Authors: Joseph Ross
          Comments: 18 pages, 8 figured; submitted
          Subjects: Data Structures and Algorithms (cs.DS)
          [6]  arXiv:2005.09588 [pdf, ps, other]
          Title: Faster Deterministic All Pairs Shortest Paths in Congest Model
          Comments: An extended abstract of this paper will appear in the Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA) 2020
          Subjects: Data Structures and Algorithms (cs.DS); Distributed, Parallel, and Cluster Computing (cs.DC)
          [7]  arXiv:2005.09524 [pdf, other]
          Title: On repetitiveness measures of Thue-Morse words
          Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)
          [8]  arXiv:2005.09342 [pdf, other]
          Title: Linear Time Construction of Indexable Founder Block Graphs
          Subjects: Data Structures and Algorithms (cs.DS)
          [9]  arXiv:2005.09262 [pdf, ps, other]
          Title: Multiple Source Replacement Path Problem
          Comments: Accepted in PODC 2020
          Subjects: Data Structures and Algorithms (cs.DS)
          [10]  arXiv:2005.09169 [pdf, ps, other]
          Title: A reduction of the dynamic time warping distance to the longest increasing subsequence length
          Subjects: Data Structures and Algorithms (cs.DS); Databases (cs.DB)
          [11]  arXiv:2005.08959 [pdf, ps, other]
          Title: Potential gain as a centrality measure
          Comments: In Proceedings of Web Intelligence 2019 (WI19), the IEEE/WIC/ACM International Conference on Web Intelligence, pages 418--422. arXiv admin note: text overlap with arXiv:1812.08012
          Subjects: Data Structures and Algorithms (cs.DS); Social and Information Networks (cs.SI)
          [12]  arXiv:2005.08950 (cross-list from quant-ph) [pdf, ps, other]
          Title: Quantum string comparison method
          Subjects: Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS)

          Tue, 19 May 2020 (showing first 13 of 16 entries)

          [13]  arXiv:2005.08918 [pdf, ps, other]
          Title: Approximation Algorithms and Hardness for Strong Unique Games
          Comments: 67 Pages
          Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)
          [14]  arXiv:2005.08614 [pdf, other]
          Title: Semi-online Scheduling: A Survey
          Comments: 48 pages, 7 figures and 10 tables
          Subjects: Data Structures and Algorithms (cs.DS)
          [15]  arXiv:2005.08391 [pdf, other]
          Title: The Online Multi-Commodity Facility Location Problem
          Comments: A conference version of this paper was accepted at the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020)
          Subjects: Data Structures and Algorithms (cs.DS)
          [16]  arXiv:2005.08351 [pdf, other]
          Title: On Efficient Connectivity-Preserving Transformations in a Grid
          Subjects: Data Structures and Algorithms (cs.DS); Computational Geometry (cs.CG); Robotics (cs.RO)
          [17]  arXiv:2005.08301 [pdf, other]
          Title: Optimal Bounds for the $k$-cut Problem
          Comments: Final version of arXiv:1911.09165 with new and more general proofs
          Subjects: Data Structures and Algorithms (cs.DS)
          [18]  arXiv:2005.08263 [pdf, other]
          Title: Matching in Stochastically Evolving Graphs
          Comments: 12 pages, 3 figures
          Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)
          [19]  arXiv:2005.08232 [pdf, ps, other]
          Title: Weighted Adaptive Coding
          Comments: 18 pages, 8 figures, 2 Tables
          Subjects: Data Structures and Algorithms (cs.DS)
          [20]  arXiv:2005.08190 [pdf, other]
          Title: Towards Efficient Interactive Computation of Dynamic Time Warping Distance
          Subjects: Data Structures and Algorithms (cs.DS); Databases (cs.DB)
          [21]  arXiv:2005.08137 [pdf, ps, other]
          Title: Robust Algorithms for TSP and Steiner Tree
          Comments: 39 pages. An extended abstract of this paper appeared in the Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP), 2020
          Subjects: Data Structures and Algorithms (cs.DS)
          [22]  arXiv:2005.07944 [pdf, ps, other]
          Title: Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
          Comments: 17 pages
          Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Probability (math.PR)
          [23]  arXiv:2005.07859 [pdf, other]
          Title: Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
          Subjects: Data Structures and Algorithms (cs.DS); Distributed, Parallel, and Cluster Computing (cs.DC)
          [24]  arXiv:2005.08856 (cross-list from math.CO) [pdf, ps, other]
          Title: How to generate random lambda terms?
          Comments: Fixed typo in the S-combinator
          Subjects: Combinatorics (math.CO); Data Structures and Algorithms (cs.DS); Logic in Computer Science (cs.LO); Software Engineering (cs.SE)
          [25]  arXiv:2005.08584 (cross-list from cs.GT) [pdf, ps, other]
          Title: Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures
          Authors: Simon Mauras
          Comments: Accepted for publication in the 21st ACM Conference on Economics and Computation (EC'20)
          Subjects: Computer Science and Game Theory (cs.GT); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Theoretical Economics (econ.TH)
          [ total of 37 entries: 1-25 | 26-37 ]
          [ showing 25 entries per page: fewer | more | all ]
          Ϸ