Pith. sign in

REVIEW 3 major objections 5 minor 300 references

Communication-efficient parallel Bruhat decomposition

T0 review · 3 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A strip-recursive BSP algorithm computes the Bruhat decomposition of a non-singular $n\times n$ matrix with computation cost $O(n^3/p)$, communication cost $O(n^2/p^{2/3})$ for $\alpha\geq 2/3$, and synchronization cost $O(p^\alpha)$…

desk verdict The strip-recursive BSP algorithm is a plausible new result with correct-looking costs, but the correctness proof rests on an unproved lemma and the block-recursive analysis has fixable typos. read the letter →

arxiv 2608.07724 v1 pith:AYTYRPDX submitted 2026-08-07 cs.DS cs.DC

Ioanna Evtushevskaya-Konovalova , Alexander Tiskin This is my paper · ORCID
classification cs.DScs.DC MSC 68W1065F0515A23
keywords bulk-synchronousparallelBruhatdecompositionLEUbandedmatricescommunicationcostsynchronizationblock-recursivealgorithmstrip-recursive
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper develops two parallel algorithms for Bruhat decomposition in the bulk-synchronous parallel (BSP) model of computation, where processors work locally and synchronize in supersteps. Bruhat decomposition expresses a non-singular square matrix as $A = U_1 P U_2$ with two upper-triangular matrices and a unique permutation matrix $P$, generalising LU decomposition while making pivoting structure explicit. The central result is that a strip-recursive algorithm, which reduces antidiagonal strips of width $n/p^\alpha$ and eliminates with banded matrices, achieves computation cost $O(n^3/p)$, communication cost $O(n^2/p^{2/3})$ when $\alpha\geq 2/3$, and synchronization cost $O(p^\alpha)$. For $\alpha$ in $[1/2,2/3]$ this is a communication-synchronization trade-off that the paper states matches the analogous trade-off for LU decomposition and generic pairwise elimination. If correct, it shows Bruhat decomposition can be parallelised with the same communication profile as LU, without giving up the permutation structure that distinguishes it.

What carries the argument

The machinery is the antidiagonal-strip recursion. The matrix is partitioned into strips of width $n_0 = n/p^\alpha$; a strip is reduced when every row and column has at most one nonzero entry in the strip, equal to 1. Two lemmas carry the argument: multiplication of lower-banded matrices of bandwidth $m$ costs $W=O(m^2 n/p)$, $H=O(m^{4/3} n^{2/3}/p^{2/3})$, $S=O(1)$, and after reducing a strip, multiplication by lower- and upper-banded matrices of bandwidth $2m$ clears the marked rows and columns of the next strip. The recursion makes two half-strip calls per level, and the banded-matrix update between the calls is what keeps the communication cost below the cost of dense updates. The recursion depth $\alpha\log p$ is converted into the parameter $\alpha$ that tunes the communication-synchronization trade-off.

What would settle it

Construct a small matrix, say $n=4$ with a reduced strip $A\langle 1,2\rangle$ containing nonzeros in known rows and columns, build the matrices $L$ and $U$ exactly as Lemma 4 prescribes, multiply, and check whether every entry of the next strip lying in those rows and columns is zero and whether $L$ and $U$ remain within bandwidth $2m$; a single symbolic or numerical counterexample would refute the lemma and with it the algorithm's correctness.

Watch

Extended reading notes

Core claim

The central discovery is that the Bruhat decomposition $LAU = P$ can be computed in the BSP model by a recursion over antidiagonal strips that preserves the banded structure of the elimination. At each level, the first half of a strip is reduced recursively; then lower- and upper-banded matrices of bandwidth twice the strip width are used to clear the rows and columns of the adjacent strip that already contain nonzeros; then the second half is reduced recursively. The paper's cost analysis sums the recurrences to obtain $W=O(n^3/p)$, $H=O(n^2/p^{2/3})$ for $\alpha\geq 2/3$, and $S=O(p^\alpha)$, with $\alpha\in[1/2,2/3]$ controlling the trade-off between communication and synchronization. In the range $\alpha<2/3$ the communication cost is $O(n^2/p^\alpha)$; at $\alpha=2/3$ it saturates at $O(n^2/p^{2/3})$. The paper also analyzes a block-recursive algorithm with a similar structure, and presents the strip-recursive algorithm as the one with the better trade-off, matching the trade-off previously established for LU decomposition and generic pairwise elimination.

Load-bearing premise

The load-bearing premise is the unproved assertion (Lemma 4) that after a strip is reduced, multiplication by the constructed banded matrices of bandwidth $2m$ clears the corresponding rows and columns of the next strip without disturbing already reduced strips; if that assertion fails, the recursive reduction does not produce a valid Bruhat decomposition.

Editorial extensions

If this is right

  • At the endpoint $\alpha=2/3$, the strip-recursive algorithm attains $W=O(n^3/p)$, $H=O(n^2/p^{2/3})$, and $S=O(p^{2/3})$.
  • For every $\alpha$ in $[1/2,2/3]$ the computation cost remains $O(n^3/p)$, so the trade-off changes only communication and synchronization, not arithmetic work.
  • Choosing a smaller $\alpha$ reduces the number of supersteps but increases communication; choosing a larger $\alpha$ reduces communication but increases supersteps, giving a one-parameter family of parallel algorithms for one problem.
  • When the permutation matrix is anti-diagonal, the Bruhat decomposition reduces to LU, so this algorithm specialises to an LU decomposition with the same communication and synchronization costs.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper, the same antidiagonal-strip elimination could apply to the generalized LEU decomposition of singular matrices, since the LEU base case is defined for all square matrices and not only for the non-singular case treated here.
  • Beyond the paper, the banded-matrix multiplication lemma is a reusable primitive: any banded linear-algebra routine that can be staged as products of banded matrices inherits the same communication costs.
  • Beyond the paper, an implementation could treat $\alpha$ as a runtime parameter selected from hardware characteristics such as network bandwidth versus synchronization latency; the paper gives the asymptotic trade-off but not a rule for choosing $\alpha$.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies Bruhat decomposition in the BSP model, reformulated as the problem of computing matrices L, U and a subpermutation/permutation P such that LAU=P. It presents two recursive parallel algorithms. The block-recursive algorithm (Section 4) follows the standard LEU-decomposition recursion and derives recurrences for computation, communication, and synchronization costs, truncating the recursion at blocks of size n0=n/p^alpha to obtain a trade-off controlled by alpha. The strip-recursive algorithm (Section 5) partitions the matrix into antidiagonal strips, reduces strips recursively with banded elimination matrices, and claims costs W=O(n^3/p), H=O(n^2/p^(2/3)) for alpha>=2/3, and S=O(p^alpha), with alpha in [1/2,2/3]. The conclusion states that the strip-recursive trade-off matches the analogous trade-off of Tiskin for LU decomposition and generic pairwise elimination.

Significance. If the correctness of the strip-recursive construction can be established, the paper makes a substantial contribution: it provides a BSP algorithm for Bruhat decomposition with the optimal computation cost O(n^3/p), communication O(n^2/p^(2/3)), and a tunable synchronization cost O(p^alpha), matching the known trade-off for LU decomposition and generic pairwise elimination. The recurrences are explicit and parameter-free, and the comparison between the two recursion schemes is instructive. The main weakness is localized in the proof of the strip-recursive algorithm's correctness, where an essential induction invariant is asserted rather than proved.

major comments (3)
  1. [Section 5.2, Lemma 4 and Section 5.3] The correctness of the strip-recursive algorithm is not established. Lemma 4 is the only mechanism that clears the rows and columns of the next half-strip before it is reduced, but its proof consists of the sentence 'Direct computation verifies' and does not show that the constructed L and U are simultaneously valid: applying L to eliminate columns can create new entries in rows that U is supposed to eliminate, and vice versa. More importantly, the recursive scheme in Section 5.3 applies Lemma 4 to the first half-strip, then makes a recursive call on the second half-strip, but no invariant is stated or proved to the effect that this second recursive call preserves (i) the already-reduced first half-strip and (ii) the zero rows and columns created by Lemma 4. Without such an induction, the final equality \tilde L_m L'_m L_m A U_m U'_m \tilde U_m = A_final does not imply that A_final is reduced, so the central claim that the algorithm produces a valid Bruhat decomposition is unsupported.
  2. [Section 4.2, cost summary] The summary line 'Overall we have obtained the following asymptotic costs: W(n,p)=O(n^3/p^(2/3))' is inconsistent with the recurrence-dag calculation immediately above it, which yields O(n^3/p), and with the subsequent truncation analysis, which requires alpha>=1/(3-log 3) precisely so that W_leaf=O(n^3/p). The displayed exponent 2/3 in the denominator is a load-bearing misstatement of the block-recursive algorithm's computation cost; the correct bound is W=O(n^3/p).
  3. [Section 5.2, Lemma 2] The proof of the banded matrix multiplication bound is not sufficiently specified to support the claimed costs. The text says blocks are formed by partitioning strips into 'regular parallelograms' and that 'the product of each pair of blocks requires O(m^2 n) operations', but it does not state the number of blocks, how processors are assigned, or why the per-processor computation is O(m^2 n/p). The claimed communication bound H=O(m^(4/3)n^(2/3)/p^(2/3)) is asserted without a derivation of the volume of data exchanged. Since Section 5.4's recurrences and the final H(n,p)=O(n^2/p^(2/3)) rely on Lemma 2, this gap is load-bearing for the strip-recursive cost analysis.
minor comments (5)
  1. [Section 4.2, leaf definitions] The statement 'For every vertex u=(k0, lambda-j), ... w(u)=O(2^(3k0)), h(u)=O(2^(2k0))' contradicts the next displayed sums, which use 2^(3(k-k0)) and 2^(2(k-k0)); since log n0 = k-k0, the first pair should read O(2^(3(k-k0))) and O(2^(2(k-k0))).
  2. [Section 4.2, recursion dag coordinates] The sentence 'vertices at this level have coordinates of the form (k-i, i-j)' does not match the stated interpretation of the horizontal coordinate as the logarithm of the number of processors; i-j is the number of diagonal steps, not the processor coordinate. Please define the coordinate transform explicitly.
  3. [Section 4.1, step 4] The quantities p_01 and p_10 are used in the formulas for l'' and u'' without being defined; they appear to be e_01 and e_10, and should be renamed or defined.
  4. [Section 5.4, first paragraph] The text says the banded matrix products are performed 'as described in steps 2 and 4', but Section 5.3 lists only three steps; the reference should be to steps 2 and 3.
  5. [Section 5.2, Lemma 4 proof] The range for the row index r in the construction of L appears to be off by one: for a row in the next strip, the condition should be stated consistently with the definition of the strip notation A<k+m, k+2m>, and the inclusive/exclusive endpoints should be checked. The current range k+m+1-j <= r <= k+2m+1-j does not match the strip A<k+m, k+2m> under the numbering introduced in the preceding paragraph.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: cost bounds are derived from algorithm recurrences with tunable parameter alpha; self-citations are background and the strip algorithm's proof gap is not a circular step.

full rationale

The paper's central cost claims are obtained by solving recurrences that mirror the algorithm's recursive structure, not by fitting parameters to a target bound. In Section 5.4, W(m,p)=2W(m/2,p)+O(m^2 n/p), H(m,p)=2H(m/2,p)+O(m^{4/3}n^{2/3}/p^{2/3}), S(m,p)=2S(m/2,p)+O(1) with base costs from Lemma 3; solving these gives W=O(n^3/p), H=O(n^2/p^{2/3}) for alpha>=2/3 and S=O(p^alpha). The exponent alpha is a design parameter chosen via the constraints alpha_min=1/2 and alpha_max=2/3; the bounds are not imposed by construction. The block-recursive algorithm's Section 4.2 analysis similarly sums the recursion dag directly. The Bruhat-specific derivation is self-contained: Section 3.2 describes BSP matrix multiplication explicitly, Lemma 2 proves the banded matrix multiplication costs, and Lemma 4 constructs elimination matrices from the matrix entries in the standard way, so the claimed zeroing is a direct computation rather than a renamed input. Citations to Tiskin [8,9] and McColl-Tiskin [5] are background for the BSP model, matrix multiplication, and a final comparison of trade-offs; they are not load-bearing for the present algorithms' correctness or costs. The manuscript's main weakness is a proof gap, not circularity: Lemma 4 is justified by a one-line 'direct computation verifies' and Section 5.3 does not give an induction proving that later recursive eliminations preserve earlier reduced strips. That is a correctness risk, but it does not make any derived quantity equal to an input by definition, so it does not raise the circularity score.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The central claim rests on the existence of LEU decomposition (from prior work), the BSP cost model, and the banded matrix multiplication cost lemma. The only design parameter is alpha, which tunes the communication-synchronization trade-off. No new physical or mathematical entities are introduced.

free parameters (1)
  • alpha = block-recursive: alpha in [0.70, 1.59]; strip-recursive: alpha in [0.50, 0.67]
    Controls the base block/strip size n0 = n/p^alpha. The algorithm's costs and the communication-synchronization trade-off depend on it. It is chosen by the algorithm designer, not fitted to data.
assumptions (4)
  • standard math Existence of LEU decomposition for any square matrix (proved in Malaschonok [4] and cited in Section 2).
    Both algorithms reduce to computing LEU decompositions of the input matrix and submatrices; this existence result is pulled from the prior literature.
  • domain assumption BSP model parameters p, g, l and the superstep cost model (Valiant [10], Tiskin [8]), with the slackness condition n >> p.
    The analysis assumes the BSP model's superstep structure and that n is much larger than p so the stated asymptotic costs hold.
  • domain assumption Bandwidth doubling for products of banded matrices (Lemma 1) and the banded matrix multiplication costs in Lemma 2.
    These lemmas are stated with proof sketches and are used in the strip-recursive recurrence. The communication cost H=O(m^(4/3) n^(2/3)/p^(2/3)) is central to the trade-off.
  • domain assumption The analysis ignores small irregularities from imperfect matching of parameters (e.g., processor groups of size p/2 differing by 1).
    Stated in Section 1; the cost bounds assume perfect division of processors and blocks.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Communication-efficient parallel Bruhat decomposition." pith.science (2026). https://pith.science/paper/AYTYRPDX

@misc{pith2026260807724,
  author       = {Pith},
  title        = {Pith review of: Communication-efficient parallel Bruhat decomposition},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AYTYRPDX}},
  note         = {Machine review of arXiv:2608.07724}
}
read the original abstract

The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Bruhat decomposition is an important method in numerical linear algebra, generalising ordinary LU decomposition while providing a symmetric structured way of expessing pivoting. Block-recursive algorithms have been developed in the past for various numerical linear algebra problems, including Bruhat decomposition; however, expressing recursive algorithms in the BSP model still remains a challenge. In this paper, we consider the communication and synchronisation complexity of Bruhat decomposition in the BSP model. We develop a new block-recursive, communication-efficient BSP algorithm for Bruhat decomposition.

Figures

Figures reproduced from arXiv: 2608.07724 by the authors.

Figure 1
Figure 1. Block-recursive algorithm 4.1 Recursive scheme The main idea is that when processing a certain block, we can reduce it to several matrix multiplications and the computation of an LEU-decomposition on smaller blocks. Computation will be distributed among processors, and at the bottom of the recursion tree, each processor will compute the LEU-decomposition for a separate block that is sufficiently small so that the LE… view at source ↗
Figure 2
Figure 2. Recursion dag for the block-recursive algorithm From the above recurrences, we can obtain explicit expressions for W(n, p), H(n, p) and S(n, p). When analyzing algorithms, we will always omit the base of the logarithm, implying the binary logarithm. Let µ = log(m), λ = log(q) and introduce new functions: W˜ (µ, λ) = W(m, q) H˜ (µ, λ) = H(m, q) S˜(µ, λ) = S(m, q) Let k = log(n). Then the recurrences become: W˜ (µ, λ)… view at source ↗
Figure 3
Figure 3. Multiplication of lower banded matrices 5.2 Antidiagonal strips Next, we consider an algorithm based on the following recursive scheme. The matrix is partitioned into anti-diagonal strips of width n0 = n/pα. The algorithm processes these strips sequentially, from left-to-right and top-down. In lemma 3 we describe parallel algorithm for reducing in BSP model. We call a strip reduced if every row (respectively, column… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 63 canonical work pages

  1. [1]

    A. V. Tiskin, Communication-efficient parallel generic pairwise elimination, Future Generation Computer Systems (2007), 23, 179--188

    2007

  2. [2]

    G. I. Malashonok, Fast Generalized Bruhat Decomposition,

  3. [3]

    G. I. Malashonok, О быстром обобщённом разложении Брюа, Вестник ТГУ, 2012, 544--551

    2012

  4. [4]

    Strassen, V, Gaussian Eelimination is not optimal, Numerische Mathematik 13, 354–356 (1969)

    1969

  5. [5]

    Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan, Fast computation of the rank profile matrix and the generalized Bruhat decomposition, Journal of Symbolic Computation

  6. [6]

    Grigoriev Analogy of Bruhat decomposition for the closure of a cone of Chevalley group of a classical series, Soviet Mathematics Doklady, 23 (2) (1981), pp

    Dima Yu. Grigoriev Analogy of Bruhat decomposition for the closure of a cone of Chevalley group of a classical series, Soviet Mathematics Doklady, 23 (2) (1981), pp. 393-397

    1981

  7. [7]

    Znamenskij, Sergej V. , doi =. Journal of Siberian Federal University. Mathematics & Physics , month =

  8. [8]

    Papadimitriou, C H and Ullman, J D , journal =

Show all 300 references
  1. [9]

    Casse, J. , doi =. Advances in Applied Probability , number =

  2. [10]

    doi:10.1007/BF02579338 , journal =

    Ajtai, M and Koml. doi:10.1007/BF02579338 , journal =

    doi

  3. [11]

    Angel, Omer and Gorin, Vadim and Holroyd, Alexander E. , doi =. Electronic Journal of Probability , keywords =. arXiv , arxivId =:arXiv:1110.0160 , file =

    arXiv

  4. [12]

    Federico, M and Peterlongo, P and Pisanti, N and Sagot, M.-F. , doi =. Discrete Applied Mathematics , number =

  5. [13]

    and Ziv-Ukelson, Michal , doi =

    Kent, Carmel and Landau, Gad M. and Ziv-Ukelson, Michal , doi =. Journal of Computational Biology , month =

  6. [14]

    and Zeilberger, Doron , eprint =

    Ekhad, Shalosh B. and Zeilberger, Doron , eprint =

  7. [15]

    Kosolobov, Dmitry and Shur, Arseny M. , doi =. Information Processing Letters , month =

  8. [16]

    doi:10.1137/S0097539702408223 , journal =

    Kohayakawa, Y and R. doi:10.1137/S0097539702408223 , journal =

    doi

  9. [17]

    , booktitle =

    Tiskin, A. , booktitle =

  10. [18]

    ACM Computing Surveys , number =

    Estivill-Castro, V and Wood, D , doi =. ACM Computing Surveys , number =

  11. [19]

    Linear Algebra and its Applications , pages =

    Alonso, P and Cortina, R and D. Linear Algebra and its Applications , pages =

  12. [20]

    Leopold, C , publisher =

  13. [21]

    Journal of Parallel and Distributed Computing , number =

    Bozda g, D and Gebremedhin, A H and Manne, F and Boman, E G and Catalyurek, U V , doi =. Journal of Parallel and Distributed Computing , number =

  14. [22]

    Journal of the ACM , number =

    Pettie, S and Ramachandran, V , doi =. Journal of the ACM , number =

  15. [23]

    Algorithms , number =

    K. Algorithms , number =. doi:10.3390/a14020044 , file =

    doi

  16. [24]

    Journal of Computational Biology , number =

    Mar. Journal of Computational Biology , number =. doi:10.1089/cmb.2024.0544 , file =

    2024

  17. [25]

    Comet, J.-P. , doi =. Theoretical Computer Science , pages =

  18. [26]

    Trends in Genetics , number =

    Rice, P and Longden, I and Bleasby, A , doi =. Trends in Genetics , number =

  19. [27]

    Aho, A V and Hopcroft, J E and Ullman, J D , publisher =

  20. [28]

    and Buchanan-Wollaston, Vicky and Tiskin, Alexander and Beynon, Jim and Denby, Katherine and Ott, Sascha , doi =

    Baxter, Laura and Jironkin, Aleksey and Hickman, Richard and Moore, Jay and Barrington, Christopher and Krusche, Peter and Dyer, Nigel P. and Buchanan-Wollaston, Vicky and Tiskin, Alexander and Beynon, Jim and Denby, Katherine and Ott, Sascha , doi =. The Plant Cell , number =

  21. [29]

    Deng, Bangming and Du, Jie and Parshall, Brian and Wang, Jianpan , number =

  22. [30]

    Algorithmica , month =

    Cabello, Sergio , doi =. Algorithmica , month =

  23. [31]

    Li, Zhiyong and P. H. Mills and J. H. Reif , journal =

  24. [32]

    Hofmann, M and Kontoghiorghes, E J , journal =

  25. [33]

    McColl, W F , booktitle =

  26. [34]

    Dewar, Robert B. K. and Merritt, Susan M. and Sharir, Micha , doi =. Acta Informatica , number =

  27. [35]

    Chazelle, B , journal =

  28. [36]

    Journal of Computational and Applied Mathematics , number =

    Eǧecioǧlu,. Journal of Computational and Applied Mathematics , number =. doi:10.1016/0377-0427(89)90362-2 , file =

    doi

  29. [37]

    Electronic Journal of Combinatorics , number =

    Li, Tina and Oh, Suho and Richmond, Edward and Yan, Grace and You, Kimberly , doi =. Electronic Journal of Combinatorics , number =. arXiv , arxivId =:2303.03618 , file =

    arXiv

  30. [38]

    Nibhanupudi, M V and Szymanski, B K , booktitle =

  31. [39]

    doi:10.1007/s11227-021-04069-9 , file =

    The Journal of Supercomputing , month =. doi:10.1007/s11227-021-04069-9 , file =

    doi

  32. [40]

    Townsend, Alex and Trefethen, Lloyd N. , doi =. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , month =

  33. [41]

    doi:10.1007/11841036_38 , pages =

    Han, Y , booktitle =. doi:10.1007/11841036_38 , pages =

    doi

  34. [42]

    ESAIM: Probability and Statistics , month =

    Fredes, Luis and Marckert, Jean-Fran. ESAIM: Probability and Statistics , month =. doi:10.1051/ps/2020008 , file =

  35. [43]

    European Journal of Operational Research , number =

    Demange, M and Ekim, T and de Werra, D , doi =. European Journal of Operational Research , number =

  36. [44]

    doi:10.1002/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-Q , journal =

    Koml. doi:10.1002/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-Q , journal =

    doi

  37. [45]

    doi:10.1145/3472456.3472489 , file =

    Mishin, Nikita and Berezun, Daniil and Tiskin, Alexander , booktitle =. doi:10.1145/3472456.3472489 , file =

  38. [46]

    Information Processing Letters , number =

    Anderson, R J and Miller, G L , doi =. Information Processing Letters , number =

  39. [47]

    Knight, Philip A , file =

  40. [48]

    Theoretical Computer Science , pages =

    Benson, G , doi =. Theoretical Computer Science , pages =

  41. [49]

    Sakai, Y. , doi =. Theoretical Computer Science , number =

  42. [50]

    Program Systems: Theory and Applications , number =

    Znamenskij, Sergej , doi =. Program Systems: Theory and Applications , number =

  43. [51]

    doi:10.1007/978-3-540-69068-9_15 , pages =

    Clifford, R and Efremenko, K and Porat, B and Porat, E , booktitle =. doi:10.1007/978-3-540-69068-9_15 , pages =

    doi

  44. [52]

    He, D and Arslan, A N , journal =

  45. [53]

    doi:10.1016/0020-0190(79)90023-1 , journal =

    Ples. doi:10.1016/0020-0190(79)90023-1 , journal =

    doi

  46. [54]

    Bulletin of the AMS , pages =

    Aldous, David and Diaconis, Persi , doi =. Bulletin of the AMS , pages =

  47. [55]

    ACM Transactions on Algorithms , number =

    Kaplan, Haim and Mozes, Shay and Nussbaum, Yahav and Sharir, Micha , doi =. ACM Transactions on Algorithms , number =

  48. [56]

    Ning, Kang and Choi, Kwok Pui , eprint =

  49. [57]

    doi:10.1007/3-540-44968-X_27 , pages =

    Tiskin, Alexander , booktitle =. doi:10.1007/3-540-44968-X_27 , pages =

    doi

  50. [58]

    Lutz, D R and Jayasimha, D N , journal =

  51. [59]

    and Rytter, Wojciech and Wale

    Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Radoszewski, Jakub and Pissis, Solon P. and Rytter, Wojciech and Wale. arXiv , arxivId =:2208.08915 , file =

    arXiv

  52. [60]

    doi:10.1007/978-3-642-59448-9_15 , file =

    Lascoux, Alain , booktitle =. doi:10.1007/978-3-642-59448-9_15 , file =

    doi

  53. [61]

    Skiena, S S , publisher =

  54. [62]

    Roy, S and Thakur, A K and Rahman, M , journal =

  55. [63]

    Journal of Algorithms , number =

    Wu, Sun and Manber, Udi and Myers, Eugene , doi =. Journal of Algorithms , number =

  56. [64]

    Lakshmivarahan, S and Dhall, S K , publisher =

  57. [65]

    Horvitz, G and Bisseling, R H , booktitle =

  58. [66]

    Gasnikova, E. V. , doi =. Computational Mathematics and Mathematical Physics , keywords =

  59. [67]

    , file =

    Krusche, P. , file =

  60. [68]

    Journal of Statistical Mechanics: Theory and Experiment , number =

    Poghosyan, S S and Priezzhev, V B and Sch. Journal of Statistical Mechanics: Theory and Experiment , number =. doi:10.1088/1742-5468/2010/04/P04022 , file =

    2010 doi

  61. [69]

    , booktitle =

    Gawrychowski, P. , booktitle =. doi:10.1007/978-3-642-34109-0-24 , file =

    doi

  62. [70]

    doi:10.1016/S0166-218X(02)00418-3 , issn =

    Discrete Applied Mathematics , month =. doi:10.1016/S0166-218X(02)00418-3 , issn =

    doi

  63. [71]

    Sibeyn, J F , booktitle =

  64. [72]

    Information Processing Letters , number =

    Yang, I-Hsuan and Huang, Chien-Pin and Chao, Kun-Mao , doi =. Information Processing Letters , number =

  65. [73]

    doi:10.1109/IPDPS.2019.00058 , file =

    Nissim, Roy and Schwartz, Oded , booktitle =. doi:10.1109/IPDPS.2019.00058 , file =

    2019

  66. [74]

    Demmel, J W , booktitle =

  67. [75]

    Information Processing Letters , month =

    Hyyr. Information Processing Letters , month =. doi:10.1016/j.ipl.2008.05.026 , file =

    2008 doi

  68. [76]

    The Mathematical Intelligencer , number =

    Stein, S K , file =. The Mathematical Intelligencer , number =

  69. [77]

    SIAM Journal of Computing , pages =

    Rosenkrantz, D J and Stearns, R E and. SIAM Journal of Computing , pages =

  70. [78]

    Proceedings of WG , doi =

    Bil. Proceedings of WG , doi =

  71. [79]

    Algorithmica , keywords =

    Chen, Kuan Yu and Chao, Kun Mao , doi =. Algorithmica , keywords =

  72. [80]

    doi:10.1007/s00454-018-0012-2 , file =

    Discrete & Computational Geometry , month =. doi:10.1007/s00454-018-0012-2 , file =

    doi

  73. [81]

    Blum, M and Floyd, R W and Pratt, V R and Rivest, R L and Tarjan, R E , journal =

  74. [82]

    Buhler, Jeremy and Lavastida, Thomas and Lu, Kefu and Moseley, Benjamin , doi =

  75. [83]

    Proceedings of ICALP , doi =

    Gawrychowski, Pawe. Proceedings of ICALP , doi =

  76. [84]

    doi:10.4230/LIPIcs.CPM.2023.3 , file =

    Bannai, Hideo and Funakoshi, Mitsuro and Kurita, Kazuhiro and Nakashima, Yuto and Seto, Kazuhisa and Uno, Takeaki , booktitle =. doi:10.4230/LIPIcs.CPM.2023.3 , file =

    2023 doi

  77. [85]

    Information Processing Letters , pages =

    Maes, M , doi =. Information Processing Letters , pages =

  78. [86]

    Journal of Algebra , month =

    Proctor, Robert A , doi =. Journal of Algebra , month =

  79. [87]

    McColl, W. F. and Tiskin, A. , doi =. Algorithmica , number =

  80. [88]

    Williams, T L and Parsons, R J , booktitle =

  81. [89]

    Panconesi, A and Srinivasan, A , journal =

  82. [90]

    doi:10.1007/BFb0024720 , pages =

    Tiskin, Alexander , booktitle =. doi:10.1007/BFb0024720 , pages =

    doi

  83. [91]

    Har-Peled, Sariel and Kaplan, Haim and Sharir, Micha and Smorodinsky, Shakhar , eprint =

  84. [92]

    Theoretical Computer Science , month =

    Crochemore, Maxime and Epifanio, Chiara and Grossi, Roberto and Mignosi, Filippo , doi =. Theoretical Computer Science , month =

  85. [93]

    Journal of the ACM , number =

    Hirschberg, D S , doi =. Journal of the ACM , number =

  86. [94]

    Proceedings of the 55th Annual ACM Symposium on Theory of Computing , doi =

    Bhattacharya, Sudatta and Kouck. Proceedings of the 55th Annual ACM Symposium on Theory of Computing , doi =. arXiv , arxivId =:2302.04475 , file =

    arXiv

  87. [95]

    Eppstein, David and Galil, Zvi and Giancarlo, Raffaele and Italiano, Giuseppe F. , doi =. Journal of the ACM (JACM) , keywords =

  88. [96]

    doi:10.4230/LIPIcs.ICALP.2024.30 , file =

    Boneh, Itai and Golan, Shay and Mozes, Shay and Weimann, Oren , booktitle =. doi:10.4230/LIPIcs.ICALP.2024.30 , file =

    2024 doi

  89. [97]

    Ziv, G and Lempel, A , journal =

  90. [98]

    Numerische Mathematik , pages =

    Sch. Numerische Mathematik , pages =

  91. [99]

    Proceedings of Euro-Par , doi =

    Mar. Proceedings of Euro-Par , doi =

  92. [100]

    Heath, M T and Romine, C H , journal =

  93. [101]

    Reif, J H and Sen, S , journal =

  94. [102]

    and Eğecioğlu,

    Arslan, Abdullah N. and Eğecioğlu,. INFORMS Journal on Computing , number =. doi:10.1287/ijoc.1040.0097 , issn =

  95. [103]

    Maggs, B M and Matheson, L R and Tarjan, R E , booktitle =

  96. [104]

    Viennot, X , booktitle =

  97. [105]

    doi:10.1002/cpe.1453 , journal =

    Cafaro, M and. doi:10.1002/cpe.1453 , journal =

    doi

  98. [106]

    Wagner, R. A. and Fischer, M. J. , doi =. Journal of the ACM , number =

  99. [107]

    Fredman, Michael L. , doi =. SIAM Journal on Computing , month =

  100. [108]

    and Esposito, R

    DeMasi, A. and Esposito, R. and Lebowitz, J. L. and Presutti, E. , doi =. Communications in Mathematical Physics , month =

  101. [109]

    Proceedings of EuroPVM/MPI , doi =

    Alves, C E R and C. Proceedings of EuroPVM/MPI , doi =

  102. [110]

    Theoretical Computer Science , number =

    Fertin, G and Hermelin, D and Rizzi, R and Vialette, S , doi =. Theoretical Computer Science , number =

  103. [111]

    Nathanson, Melvyn B. , doi =. Linear Algebra and Its Applications , keywords =

  104. [112]

    Proceedings of SPIRE , doi =

    Hyyr. Proceedings of SPIRE , doi =

  105. [113]

    and Eğecioğlu,

    Arslan, Abdullah N. and Eğecioğlu,. Handbook of Approximation Algorithms and Metaheuristics , chapter =. doi:10.1201/9781420010749 , file =

    doi

  106. [114]

    Discrete Applied Mathematics , number =

    Klein, S T and Wiseman, Y , doi =. Discrete Applied Mathematics , number =

  107. [115]

    Debnath, Lokenath and Bhatta, Dambaru , publisher =

  108. [116]

    Annales de l'Institut Henri Poincar

    Casse, J. Annales de l'Institut Henri Poincar. doi:10.4171/AIHPD/63 , file =

    doi

  109. [117]

    doi:10.1007/b99859 , editor =

    Rytter, W , booktitle =. doi:10.1007/b99859 , editor =

    doi

  110. [118]

    Algorithmica , number =

    Apostolico, A and Guerra, C , doi =. Algorithmica , number =

  111. [119]

    Kumar, Piyush , doi =

  112. [120]

    Albert, M H and Aldred, R E L and Atkinson, M D and van Ditmarsch, H P and Handley, B D and Handley, C C and Opatrny, J , journal =

  113. [121]

    Computing , number =

    Bunke, H and Csirik, J , doi =. Computing , number =

  114. [122]

    Yamamoto, Takanori and Bannai, Hideo and Inenaga, Shunsuke and Takeda, Masayuki , doi =

  115. [123]

    Goodrich, M T , booktitle =

  116. [124]

    Information Processing Letters , month =

    Freschi, Valerio and Bogliolo, Alessandro , doi =. Information Processing Letters , month =

  117. [125]

    Advances in Mathematics , month =

    Pilaud, Vincent and Stump, Christian , doi =. Advances in Mathematics , month =

  118. [126]

    Sakai, Yoshifumi , doi =

  119. [127]

    , journal =

    Tiskin, A. , journal =

  120. [128]

    Quinn, M J , edition =

  121. [129]

    Journal of the ACM , number =

    Johnson, D B , doi =. Journal of the ACM , number =

  122. [130]

    Apostolico, A , booktitle =

  123. [131]

    , booktitle =

    Tiskin, A. , booktitle =. doi:10.1007/978-3-642-02441-2_18 , file =

    doi

  124. [132]

    Random Structures and Algorithms , keywords =

    Bisi, Elia and Cunden, Fabio Deelan and Gibbons, Shane and Romik, Dan , doi =. Random Structures and Algorithms , keywords =. arXiv , arxivId =:2005.02043 , file =

    2005

  125. [133]

    doi:10.1145/277651.277662 , pages =

    Adler, M and Dittrich, W and Juurlink, B and Kutylowski, M and Rieping, I , booktitle =. doi:10.1145/277651.277662 , pages =

  126. [134]

    Information and Computation , month =

    Pighizzini, Giovanni , doi =. Information and Computation , month =

  127. [135]

    Welch, T A , journal =

  128. [136]

    doi:10.1007/978-3-642-35261-4_23 , file =

    Sakai, Yoshifumi , booktitle =. doi:10.1007/978-3-642-35261-4_23 , file =

    doi

  129. [137]

    Mueller, C and Dalkilic, M M and Lumsdaine, A , journal =

  130. [138]

    Paterson, M , booktitle =

  131. [139]

    doi:10.1007/978-3-540-73437-6 , pages =

    Lifshits, Y , booktitle =. doi:10.1007/978-3-540-73437-6 , pages =

    doi

  132. [140]

    Zapiski nauchnykh seminarov POMI , pages =

    Tiskin , file =. Zapiski nauchnykh seminarov POMI , pages =

  133. [141]

    Journal of Discrete Algorithms , pages =

    Crochemore, M and Hancart, C and Lecroq, T , doi =. Journal of Discrete Algorithms , pages =

  134. [142]

    Bioinformatics , month =

    Mar. Bioinformatics , month =. doi:10.1093/bioinformatics/btz354 , file =

    doi

  135. [143]

    Parallel Computing , pages =

    Blanco, V and Gonz. Parallel Computing , pages =

  136. [144]

    Communications of the ACM , month =

    Navarro, Gonzalo , doi =. Communications of the ACM , month =

  137. [145]

    Steele, J. M. , doi =. The Annals of Statistics , number =

  138. [146]

    Proceedings of ALENEX , editor =

    Helman, D R and J. Proceedings of ALENEX , editor =

  139. [147]

    Deineko, V and Klinz, B and Woeginger, G , booktitle =

  140. [148]

    Theoretical Computer Science , title =

    Bae, Sang Won and Lee, Inbok , doi =. Theoretical Computer Science , title =

  141. [149]

    doi:10.1016/S0166-218X(02)00424-9 , journal =

    Gebremedhin, A H and. doi:10.1016/S0166-218X(02)00424-9 , journal =

    doi

  142. [150]

    Bansal, N and Williams, R , booktitle =

  143. [151]

    SIAM Journal on Computing , month =

    Bringmann, Karl and Grandoni, Fabrizio and Saha, Barna and Williams, Virginia Vassilevska , doi =. SIAM Journal on Computing , month =

  144. [152]

    Christofides, N , publisher =

  145. [153]

    Advances in Computing Research , pages =

    Miller, G L and Reif, J F , file =. Advances in Computing Research , pages =

  146. [154]

    doi:10.1007/978-3-030-00479-8_19 , file =

    Kociumaka, Tomasz and Radoszewski, Jakub and Rytter, Wojciech and Straszy. doi:10.1007/978-3-030-00479-8_19 , file =

    doi

  147. [155]

    Algorithmica , number =

    Wang, Lusheng and Zhang, Kaizhong , doi =. Algorithmica , number =

  148. [156]

    doi:10.1007/s100510050616 , file =

    European Physical Journal B , number =. doi:10.1007/s100510050616 , file =

    doi

  149. [157]

    Navarro, Gonzalo and Urbina, Cristian , doi =

  150. [158]

    Sellers, Peter H. , doi =. Journal of Algorithms , pages =

  151. [159]

    doi:10.1109/ICPP.2007.38 , pages =

    Lin, Chun Yuan and Huang, Chen Tai and Chung, Yeh-Ching and Tang, Chuan Yi , booktitle =. doi:10.1109/ICPP.2007.38 , pages =

    2007 doi

  152. [160]

    Algorithmica , number =

    Dehne, F and Dittrich, W and Hutchinson, D , doi =. Algorithmica , number =

  153. [161]

    and Tiskin, A

    Krusche, P. and Tiskin, A. , booktitle =

  154. [162]

    Journal of Combinatorial Theory, Series B , month =

    Glebov, Roman and Grzesik, Andrzej and Klimo. Journal of Combinatorial Theory, Series B , month =. doi:10.1016/j.jctb.2014.07.007 , file =

    2014 doi

  155. [163]

    Intel Technology Journal , number =

    Smelyanskiy, M and Skedzielewski, S and Dulong, C , doi =. Intel Technology Journal , number =

  156. [164]

    Theoretical Computer Science , month =

    Mantaci, Sabrina and Restivo, Antonio and Romana, Giuseppe and Rosone, Giovanna and Sciortino, Marinella , doi =. Theoretical Computer Science , month =

  157. [165]

    Karzanov, A , booktitle =

  158. [166]

    Lichtenstein, W and Johnsson, S L , journal =

  159. [167]

    Romik, D. , doi =. Functional Analysis and Its Applications , month =

  160. [168]

    Algorithmica , number =

    Chaudhry, G and Cormen, T H , doi =. Algorithmica , number =

  161. [169]

    doi:10.1007/b100941 , pages =

    Kosowski, A , booktitle =. doi:10.1007/b100941 , pages =

    doi

  162. [170]

    Gasnikov, A. V. and Gasnikova, E. B. and Nesterov, Yu E. and Chernov, A. V. , doi =. Computational Mathematics and Mathematical Physics , keywords =

  163. [171]

    ACM Transactions on Algorithms , number =

    Bille, Philip and Fagerberg, Rolf and G. ACM Transactions on Algorithms , number =. doi:10.1145/1644015.1644018 , file =

  164. [172]

    Discrete Mathematics , number =

    Johnson, C R and Nasserasr, S , doi =. Discrete Mathematics , number =

  165. [173]

    Advances in Applied Mathematics , month =

    Armstrong, Drew and Hersh, Patricia , doi =. Advances in Applied Mathematics , month =

  166. [174]

    , publisher =

    �������, �. , publisher =. ������, ������� � ������������������ � ����������: ����������� � �������������� �������� , year =

  167. [175]

    Discrete Mathematics , month =

    Tiskin, Alexander , doi =. Discrete Mathematics , month =

  168. [176]

    doi:10.1007/978-3-031-20643-6_20 , file =

    Gawrychowski, Pawe. doi:10.1007/978-3-031-20643-6_20 , file =

    doi

  169. [177]

    Combinatorics: Paul Erd

    Koml. Combinatorics: Paul Erd

  170. [178]

    Grigor'ev, D.Yu. , doi =. Theoretical Computer Science , number =

  171. [179]

    Information Processing Letters , pages =

    Fischetti, V A and Landau, G M and Sellers, P H and Schmidt, J P , doi =. Information Processing Letters , pages =

  172. [180]

    doi:10.1145/301250.301271 , pages =

    Zwick, U , booktitle =. doi:10.1145/301250.301271 , pages =

  173. [181]

    Grossi, R and Vitter, J S , doi =

  174. [182]

    Journal of Parallel and Distributed Computing , number =

    Bader, D A , doi =. Journal of Parallel and Distributed Computing , number =

  175. [183]

    van Nieuwpoort, R. V. and Maassen, J and Wrzesinska, G and Kielmann, T and Bal, H. E. , journal =

  176. [184]

    Numerische Mathematik , number =

    Dijkstra, E W , doi =. Numerische Mathematik , number =

  177. [185]

    Coppersmith, D and Winograd, S , booktitle =

  178. [186]

    Journal of Parallel and Distributed Computing , number =

    Huang, Yuguang and McColl, W F , doi =. Journal of Parallel and Distributed Computing , number =

  179. [187]

    Fundamenta Informaticae , number =

    Arrighi, Pablo and Schabanel, Nicolas and Theyssier, Guillaume , doi =. Fundamenta Informaticae , number =

  180. [188]

    Burdyuk, V Y and Trofimov, V N , journal =

  181. [189]

    Dixon, John D. , doi =. Discrete Mathematics , number =

  182. [190]

    and Erickson, Jeff , doi =

    Cabello, Sergio and Chambers, Erin W. and Erickson, Jeff , doi =. SIAM Journal on Computing , month =

  183. [191]

    Proceedings of 16th RP , doi =

    Kosche, Maria and Ko. Proceedings of 16th RP , doi =

  184. [192]

    Reid-Miller, M and Miller, G L and Modugno, F , booktitle =

  185. [193]

    Networks , pages =

    Gavril, F , doi =. Networks , pages =

  186. [194]

    Ellert, Jonas , doi =

  187. [195]

    Proceedings of STOC , pages =

    Mitzenmacher, Michael and Seddighin, Saeed , doi =. Proceedings of STOC , pages =

  188. [196]

    Systems and Computers in Japan , number =

    Ishimizu, T and Fujiwara, A and Inoue, M and Masuzawa, T and Fujiwara, H , doi =. Systems and Computers in Japan , number =

  189. [197]

    Seidel, R , chapter =

  190. [198]

    Fomin, F V and Kratsch, D and Novelli, J.-C. , doi =. Information Processing Letters , number =

  191. [199]

    Molecular Biology and Evolution , number =

    Putonti, C and Luo, Yi and Katili, C and Chumakov, S and Fox, G E and Graur, D and Fofanov, Y , doi =. Molecular Biology and Evolution , number =

  192. [200]

    ACM Journal of Experimental Algorithmics , pages =

    Hyyr. ACM Journal of Experimental Algorithmics , pages =. doi:10.1145/1064546.1180617 , file =

  193. [201]

    Agarwal, R C and Balle, S M and Gustavson, F G and Joshi, M and Palkar, P , journal =

  194. [202]

    PLoS ONE , month =

    Agapie, Alexandru and Andreica, Anca and Chira, Camelia and Giuclea, Marius , doi =. PLoS ONE , month =

  195. [203]

    Information Processing Letters , title =

    Arslan, A N , doi =. Information Processing Letters , title =

  196. [204]

    Basch, J and Khanna, S and Motwani, R , institution =

  197. [205]

    Gallivan, K A and Plemmons, R J and Sameh, A H , journal =

  198. [206]

    Theoretical Computer Science , month =

    Sokol, Dina and Tojeira, Justin , doi =. Theoretical Computer Science , month =

  199. [207]

    Proceedings of the National Academy of Sciences of the USA , pages =

    Maizel, J V and Lenk, R P , doi =. Proceedings of the National Academy of Sciences of the USA , pages =

  200. [208]

    Coppersmith, D and Winograd, S , journal =

  201. [209]

    and Prokop, Harald and Ramachandran, Sridhar , doi =

    Frigo, Matteo and Leiserson, Charles E. and Prokop, Harald and Ramachandran, Sridhar , doi =. ACM Transactions on Algorithms , month =

  202. [210]

    Advances in Applied Probability , number =

    Hauser, Raphael and Mart. Advances in Applied Probability , number =. doi:10.1239/aap/1158685004 , file =

  203. [211]

    Calder, Jeff and Esedoḡlu, Selim and Hero, Alfred O. , doi =. SIAM Journal on Numerical Analysis , pages =

  204. [212]

    and Rawlins, Gregory J.E

    Bradford, Phillip G. and Rawlins, Gregory J.E. and Shannon, Gregory E. , doi =. SIAM Journal on Computing , keywords =

  205. [213]

    Cha, Hojung and Lee, Dongho , journal =

  206. [214]

    Journal of Computer and System Sciences , number =

    Angluin, D and Valiant, L G , doi =. Journal of Computer and System Sciences , number =

  207. [215]

    Algorithms , month =

    K. Algorithms , month =. doi:10.3390/a14010005 , file =

    doi

  208. [216]

    Pilaud, Vincent and Stump, Christian , doi =

  209. [217]

    ACM Computing Surveys , number =

    Hall, P A V and Dowling, G R , doi =. ACM Computing Surveys , number =

  210. [218]

    Jones, N. C. and Pevzner, P. A. , isbn =

  211. [219]

    Journal of Physics A: Mathematical and Theoretical , month =

    Woelki, Marko , doi =. Journal of Physics A: Mathematical and Theoretical , month =

  212. [220]

    Bioinformatics , pages =

    Sokol, D and Benson, G and Tojeira, J , doi =. Bioinformatics , pages =

  213. [221]

    Bundschuh, R. , doi =. The European Physical Journal B , number =

  214. [222]

    Journal of Discrete Algorithms , month =

    K. Journal of Discrete Algorithms , month =. doi:10.1016/S1570-8667(03)00032-7 , issn =

    doi

  215. [223]

    Gazit, H and Miller, G L and Teng, Shang-Hua , booktitle =

  216. [224]

    Communications of the ACM , number =

    Valiant, L G , doi =. Communications of the ACM , number =

  217. [225]

    and Hakonen, H

    Bergroth, L. and Hakonen, H. and Raita, T. , booktitle =. doi:10.1109/SPIRE.2000.878178 , isbn =

    2000

  218. [226]

    Bilardi, G and Pietracaprina, A and Pucci, G and Silvestri, F , booktitle =

  219. [227]

    Papadimitriou, C H and Vazirani, U V , journal =

  220. [228]

    Theoretical Computer Science , month =

    Aronica, Salvatore and Langiu, Alessio and Marzi, Francesca and Mazzola, Salvatore and Mignosi, Filippo , doi =. Theoretical Computer Science , month =

  221. [229]

    Algorithmica , keywords =

    Bille, Philip and Cording, Patrick Hagge and G. Algorithmica , keywords =. doi:10.1007/s00453-015-0068-9 , file =

    doi

  222. [230]

    doi:10.1007/11780441_30 , pages =

    Brodal, G S and Kaligosi, K and Katriel, I and Kutz, M , booktitle =. doi:10.1007/11780441_30 , pages =

    doi

  223. [231]

    Tiskin, A , booktitle =

  224. [232]

    doi:10.1007/978-3-540-78773-0_29 , pages =

    Fernandes, C G and Ferreira, C E and Tjandraatmadja, C and Wakabayashi, Y , booktitle =. doi:10.1007/978-3-540-78773-0_29 , pages =

    doi

  225. [233]

    International Journal of Computer Mathematics , month =

    M. International Journal of Computer Mathematics , month =. doi:10.1080/00207160108805049 , issn =

    doi

  226. [234]

    Journal of Algorithms , number =

    Amir, A and Lewenstein, M and Porat, E , doi =. Journal of Algorithms , number =

  227. [235]

    doi:10.1007/3-540-61440-0 , pages =

    Bradford, P G and Reinelt, K , booktitle =. doi:10.1007/3-540-61440-0 , pages =

    doi

  228. [236]

    Munter, E A , howpublished =

  229. [237]

    Journal of Algorithms , number =

    Alon, N and Duke, R A and Lefmann, H and R. Journal of Algorithms , number =. doi:10.1006/jagm.1994.1005 , file =

    1994

  230. [238]

    doi:10.1007/11751649_18 , pages =

    Krusche, Peter and Tiskin, Alexander , booktitle =. doi:10.1007/11751649_18 , pages =

    doi

  231. [239]

    Bunch, J R and Hopcroft, J E , journal =

  232. [240]

    Discrete Applied Mathematics , month =

    Inenaga, Shunsuke and Hoshino, Hiromasa and Shinohara, Ayumi and Takeda, Masayuki and Arikawa, Setsuo and Mauri, Giancarlo and Pavesi, Giulio , doi =. Discrete Applied Mathematics , month =

  233. [241]

    Angel, Omer and Dauvergne, Duncan and Holroyd, Alexander E. and Vir. Annales de l'institut Henri Poincare (B) Probability and Statistics , keywords =. doi:10.1214/18-AIHP887 , eprint =

    doi

  234. [242]

    Proceedings of SPAA , doi =

    Alves, C E R and C. Proceedings of SPAA , doi =

  235. [243]

    SIAM Journal on Computing , pages =

    Cole, R and Hariharan, R , doi =. SIAM Journal on Computing , pages =

  236. [244]

    Griggs, J R and Simonovits, M and Thomas, G R , journal =

  237. [245]

    and Stege, U

    Barsky, M. and Stege, U. and Thomo, A. , doi =. Software: Practice and Experience , keywords =

  238. [246]

    Li, X and Lu, P and Schaeffer, J and Shillington, J and Wong, P S and Shi, H , journal =

  239. [247]

    ACM Computing Surveys , number =

    Navarro, Gonzalo , doi =. ACM Computing Surveys , number =

  240. [248]

    Shi, H and Schaeffer, J , journal =

  241. [249]

    Miller, R and Stout, Q F , journal =

  242. [250]

    Communications of the ACM , month =

    Kempa, Dominik and Kociumaka, Tomasz , doi =. Communications of the ACM , month =

  243. [251]

    Journal of Parallel and Distributed Computing , number =

    Boxer, L and Miller, R , doi =. Journal of Parallel and Distributed Computing , number =

  244. [252]

    Okasaki, Chris , isbn =

  245. [253]

    Lind, Douglas and Marcus, Brian , doi =

  246. [254]

    Campbell, D. K. G. , journal =

  247. [255]

    arXiv , arxivId =:1910.11740 , file =

    Gay, Jo. arXiv , arxivId =:1910.11740 , file =

    1910 arXiv

  248. [256]

    Gale, D , publisher =

  249. [257]

    Papadimitriou, C H , journal =

  250. [258]

    doi:10.1137/1.9781611975031.34 , file =

    Gawrychowski, Pawel and Mozes, Shay and Weimann, Oren and Wulff-Nilsen, Christian , booktitle =. doi:10.1137/1.9781611975031.34 , file =

    doi

  251. [259]

    Proceedings of the 15th ACM STOC , doi =

    Ajtai, M and Koml. Proceedings of the 15th ACM STOC , doi =

  252. [260]

    and Sadayappan, P and Johnson, R W , journal =

    Kumar, B and Huang, C.-H. and Sadayappan, P and Johnson, R W , journal =

  253. [261]

    Theoretical Computer Science , number =

    Mozes, S and Tsur, D and Weimann, O and Ziv-Ukelson, M , doi =. Theoretical Computer Science , number =

  254. [262]

    IEEE Transactions on Information Theory , month =

    Bannai, Hideo and Hirayama, Momoko and Hucke, Danny and Inenaga, Shunsuke and Jez, Artur and Lohrey, Markus and Reh, Carl Philipp , doi =. IEEE Transactions on Information Theory , month =

  255. [263]

    doi:10.1145/1378533.1378574 , file =

    Chowdhury, Rezaul Alam and Ramachandran, Vijaya , booktitle =. doi:10.1145/1378533.1378574 , file =

  256. [264]

    Stein, S K , title =

  257. [265]

    Sarmenta, L F G , booktitle =

  258. [266]

    Bringmann, K. and K. Proceedings of ACM-SIAM SODA , doi =

  259. [267]

    de la Torre, P and Kruskal, C P , booktitle =

  260. [268]

    Nature , number =

    Fawzi, Alhussein and Balog, Matej and Huang, Aja and Hubert, Thomas and Romera-Paredes, Bernardino and Barekatain, Mohammadamin and Novikov, Alexander and. Nature , number =. doi:10.1038/s41586-022-05172-4 , file =

    doi

  261. [269]

    and Carson, E

    Ballard, G. and Carson, E. and Demmel, J. and Hoemmen, M. and Knight, N. and Schwartz, O. , doi =. Acta Numerica , pages =

  262. [270]

    Future Generation Computer Systems , number =

    Lecomber, D and Rudgyard, M , doi =. Future Generation Computer Systems , number =

  263. [271]

    Transactions of the American Mathematical Society , number =

    Hammett, Adam and Pittel, Boris , doi =. Transactions of the American Mathematical Society , number =

  264. [272]

    and Schmidt, P

    Martin, J. and Schmidt, P. , file =. Latin American Journal of Probability and Mathematical Statistics , pages =

  265. [273]

    doi:10.1007/978-3-540-69733-6_33 , pages =

    Lou, Xiaowen and Zhu, Daming , booktitle =. doi:10.1007/978-3-540-69733-6_33 , pages =

    doi

  266. [274]

    Contributions to Discrete Mathematics , number =

    Tao, Terence , file =. Contributions to Discrete Mathematics , number =

  267. [275]

    doi:10.1016/S1570-8667(03)00029-7 , journal =

    Crochemore, M and Melichar, B and Tron. doi:10.1016/S1570-8667(03)00029-7 , journal =

    doi

  268. [276]

    and Siniolakis, C.J

    Gerbessiotis, A.V. and Siniolakis, C.J. and Tiskin, A. , file =. Computing and Informatics , keywords =

  269. [277]

    Algorithmica , number =

    Saukas, E L G and Song, S W , doi =. Algorithmica , number =

  270. [278]

    Masek, W. J. and Paterson, M. S. , doi =. Journal of Computer and System Sciences , number =

  271. [279]

    doi:10.1007/978-3-642-14390-8_19 , file =

    Krusche, Peter and Tiskin, Alexander , booktitle =. doi:10.1007/978-3-642-14390-8_19 , file =

    doi

  272. [280]

    doi:10.1007/s10479-007-0174-4 , journal =

    Barth. doi:10.1007/s10479-007-0174-4 , journal =

    doi

  273. [281]

    Algorithmica , pages =

    Wu, S and Manber, U and Myers, G , doi =. Algorithmica , pages =

  274. [282]

    doi:10.4230/LIPIcs.ESA.2022.86 , file =

    Tiskin, Alexander , booktitle =. doi:10.4230/LIPIcs.ESA.2022.86 , file =

    2022 doi

  275. [283]

    Sagan, Bruce , isbn =

  276. [284]

    Information Processing Letters , number =

    Liu, J J and Huang, G S and Wang, Y L and Lee, R C T , doi =. Information Processing Letters , number =

  277. [285]

    Pflueger, N , eprint =

  278. [286]

    Journal of Algebraic Combinatorics , number =

    Mazorchuk, Volodymyr and Steinberg, Benjamin , doi =. Journal of Algebraic Combinatorics , number =

  279. [287]

    Journal of the ACM , number =

    Galil, Z , doi =. Journal of the ACM , number =

  280. [288]

    Snir, M and Gropp, W , edition =

  281. [289]

    IEEE Transactions on Computers , number =

    Goudreau, M W and Lang, K and Rao, S B and Suel, T and Tsantilas, T , doi =. IEEE Transactions on Computers , number =

  282. [290]

    Theoretical Computer Science , number =

    Saunders, S and Takaoka, T , doi =. Theoretical Computer Science , number =

  283. [291]

    Journal of Discrete Algorithms , month =

    Inenaga, Shunsuke and Shinohara, Ayumi and Takeda, Masayuki and Arikawa, Setsuo , doi =. Journal of Discrete Algorithms , month =

  284. [292]

    Tiskin, A. , doi =. Journal of Mathematical Sciences , pages =

  285. [293]

    Banach Center Publications , number =

    Korec, Ivan , doi =. Banach Center Publications , number =

  286. [294]

    Algorithmica , pages =

    Blunck, Henrik and Vahrenhold, Jan , doi =. Algorithmica , pages =

  287. [295]

    Bein, W W and Pathak, P K , journal =

  288. [296]

    Johnson, D S and McGeoch, L A , booktitle =

  289. [297]

    Finocchi, I and Panconesi, A and Silvestri, R , booktitle =

  290. [298]

    doi:10.1145/1377676.1377708 , file =

    Pyrga, Evangelia and Ray, Saurabh , booktitle =. doi:10.1145/1377676.1377708 , file =

  291. [299]

    Birman, J S , journal =

  292. [300]

    Vasilev, V , journal =

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.