English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays

Kempa, D., & Kociumaka, T. (2023). Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 5122-5202). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch187.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Breaking the {$O(n)$}-{B}arrier in the Construction of Compressed Suffix Arrays

Files

show Files
hide Files
:
arXiv:2106.12725.pdf (Preprint), 2MB
Name:
arXiv:2106.12725.pdf
Description:
File downloaded from arXiv at 2022-12-23 13:27
OA-Status:
Not specified
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Kempa, Dominik1, Author
Kociumaka, Tomasz2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2021-06-2320222023
 Publication Status: Published online
 Pages: 41 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: KempaSODA23
DOI: 10.1137/1.9781611977554.ch187
 Degree: -

Event

show
hide
Title: Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Florence, Italy
Start-/End Date: 2023-01-22 - 2023-01-25

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2023
Source Genre: Proceedings
 Creator(s):
Bansal, Nikhil1, Editor
Nagarajan, Viswanath1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 5122 - 5202 Identifier: ISBN: 978-1-61197-755-4