Search results

From MaRDI portal
  • decomposable graphs 2024-01-05 Paper The average case complexity of the parallel prefix problem 2019-04-29 Paper Minimal solvers for unsynchronized TDOA sensor...
    10 bytes (13 words) - 18:51, 12 December 2023
  • complexity of scheduling problems with communication delays for trees 2022-12-09 Paper The average case complexity of the parallel prefix problem 2019-04-29 Paper...
    10 bytes (13 words) - 00:46, 13 December 2023
  • Publication Date of Publication Type The average case complexity of the parallel prefix problem 2019-04-29 Paper https://portal.mardi4nfdi.de/entity/Q2766848 2002-07-01...
    10 bytes (14 words) - 15:30, 6 October 2023
  • recurrence relations revisited 1998-07-22 Paper The complexity of parallel prefix problems on small domains 1998-06-02 Paper https://portal.mardi4nfdi.de/entity/Q3129921...
    10 bytes (14 words) - 15:05, 10 December 2023
  • Paper Covering problems for partial words and for indeterminate strings 2015-09-11 Paper A note on the longest common compatible prefix problem for partial...
    10 bytes (15 words) - 04:01, 9 December 2023
  • indeterminate strings 2015-09-11 Paper A note on the longest common compatible prefix problem for partial words 2015-08-24 Paper Global and local sequence alignment...
    10 bytes (17 words) - 02:41, 9 December 2023
  • for the RMQ and the RMSQ problems 2011-02-19 Paper Optimal prefix and suffix queries on texts 2010-08-02 Paper Optimal prefix and suffix queries on texts...
    10 bytes (17 words) - 06:49, 7 October 2023
  • common compatible prefix problem for partial words 2015-08-24 Paper String Powers in Trees 2015-08-20 Paper On the string consensus problem and the Manhattan...
    10 bytes (15 words) - 17:22, 9 December 2023
  • packed texts 1997-07-27 Paper Parallel detection of all palindromes in a string 1997-02-28 Paper Fast parallel string prefix-matching 1997-02-28 Paper An...
    10 bytes (14 words) - 14:23, 10 December 2023
  • to settle the ReDoS problem: back to the classical automata theory 2022-08-16 Paper On the decidability of infix inclusion problem 2022-08-11 Paper Template-based...
    10 bytes (15 words) - 02:14, 25 September 2023
  • Publication Type More general parallel tree contraction: register allocation and broadcasting in a tree 2024-06-05 Paper Prefix graphs and their applications...
    10 bytes (15 words) - 19:37, 11 December 2023
  • optimal parallel prefix sums and list ranking 1989-01-01 Paper Fast parallel and serial approximate string matching 1989-01-01 Paper Parallel construction...
    10 bytes (13 words) - 16:24, 12 December 2023
  • Enhanced covers of regular and indeterminate strings using prefix tables 2017-06-13 Paper A prefix array for parameterized strings 2017-02-14 Paper Large-scale...
    10 bytes (15 words) - 05:12, 25 September 2023
  • State complexity of \(k\)-parallel tree concatenation 2018-01-19 Paper Outfix-guided insertion 2017-12-06 Paper Relative prefix distance between languages...
    10 bytes (16 words) - 20:30, 9 December 2023
  • 2010-08-05 Paper Unimodal regression via prefix isotonic regression 2010-03-30 Paper Unimodal regression via prefix isotonic regression 2008-12-01 Paper Response...
    10 bytes (16 words) - 02:21, 25 September 2023
  • and provably highly compressible string transformations 2022-07-18 Paper Prefix-free parsing for building big BWTs 2022-07-18 Paper Space efficient merging...
    10 bytes (13 words) - 03:51, 9 December 2023
  • Faster optimal parallel prefix circuits: new algorithmic construction 2006-11-15 Paper A new approach to constructing optimal parallel prefix circuits with...
    10 bytes (15 words) - 11:04, 7 October 2023
  • with gaps 2018-02-16 Paper A fast algorithm for the all-pairs suffix-prefix problem 2017-11-06 Paper Fast batch modular exponentiation with common-multiplicand...
    10 bytes (15 words) - 11:18, 8 December 2023
  • Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem 2010-09-02 Paper Bidirectional search in a string...
    10 bytes (13 words) - 04:33, 7 October 2023
  • Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem 2010-09-02 Paper Bidirectional search in a string...
    10 bytes (13 words) - 03:11, 9 December 2023