@inproceedings{a66997cbc09248adbe7332a4f4d56959,
title = "String Problems in the Congested Clique Model",
abstract = "In this paper we present algorithms for several string problems in the Congested Clique model. In the Congested Clique model, n nodes (computers) are used to solve some problem. The input to the problem is distributed among the nodes, and the communication between the nodes is conducted in rounds. In each round, every node is allowed to send an O(log n)-bit message to every other node in the network. We consider three fundamental string problems in the Congested Clique model. First, we present an O(1) rounds algorithm for string sorting that supports strings of arbitrary length. Second, we present an O(1) rounds combinatorial pattern matching algorithm. Finally, we present an O(log log n) rounds algorithm for the computation of the suffix array and the corresponding Longest Common Prefix array of a given string.",
keywords = "Congested Clique, Pattern Matching, Sorting, String Sorting, Suffix Array",
author = "Shay Golan and Matan Kraus",
note = "Publisher Copyright: {\textcopyright} Shay Golan and Matan Kraus;; 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025 ; Conference date: 17-06-2025 Through 19-06-2025",
year = "2025",
month = jun,
day = "10",
doi = "10.4230/LIPIcs.CPM.2025.6",
language = "אנגלית",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Paola Bonizzoni and Veli Makinen",
booktitle = "36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025",
address = "גרמניה",
}