| Publication | Date of Publication | Type |
|---|
| New seeding strategies for the influence maximization problem | 2024-10-18 | Paper |
| Fast Cartesian tree matching | 2024-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098795 | 2023-06-14 | Paper |
| Efficient Construction of Hierarchical Overlap Graphs | 2022-12-22 | Paper |
| Cartesian Tree Matching and Indexing | 2022-07-18 | Paper |
| Impact of the arm's length regulation on a supply chain with asymmetric retailers | 2022-03-18 | Paper |
| Fast algorithms for single and multiple pattern Cartesian tree matching | 2020-12-15 | Paper |
| Finding patterns and periods in Cartesian tree matching | 2020-10-22 | Paper |
| Fast multiple pattern Cartesian tree matching | 2020-07-22 | Paper |
| Finding periods in Cartesian tree matching | 2020-02-25 | Paper |
| Fast string matching for DNA sequences | 2020-02-20 | Paper |
| Impact of transfer pricing methods for tax purposes on supply chain performance under demand uncertainty | 2019-03-26 | Paper |
| Improved pattern-scan-order algorithms for string matching | 2018-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580161 | 2018-08-13 | Paper |
| Offshoring and outsourcing in a global supply chain: impact of the arm's length regulation on transfer pricing | 2018-05-30 | Paper |
| Joint decisions on product line selection, purchasing, and pricing | 2018-05-30 | Paper |
| FM-index of alignment 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 multiplication | 2017-10-18 | Paper |
| On representations of ternary order relations in numeric strings | 2017-07-17 | Paper |
| A new graph model and algorithms for consistent superstring problems | 2017-01-13 | Paper |
| FM-index of alignment: a compressed index for similar strings | 2016-06-16 | Paper |
| The working set algorithm has competitive ratio less than two | 2016-05-26 | Paper |
| Fast Multiple Order-Preserving Matching Algorithms | 2016-04-04 | Paper |
| PARALLEL MAXIMUM MATCHING ALGORITHMS IN INTERVAL GRAPHS | 2015-04-29 | Paper |
| Transferring and sharing exchange-rate risk in a risk-averse supply chain of a multinational firm | 2015-02-04 | Paper |
| A fast algorithm for order-preserving pattern matching | 2014-12-09 | Paper |
| High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous System | 2014-08-20 | Paper |
| Continuous-time Markov chain models to estimate the premium for extended hedge fund lockups | 2014-05-08 | Paper |
| Order-preserving matching | 2014-03-13 | Paper |
| Extending alignments with \(k\)-mismatches and \(\ell\)-gaps | 2014-03-13 | Paper |
| Suffix Tree of Alignment: An Efficient Index for Similar Data | 2014-01-17 | Paper |
| Constant-round privacy preserving multiset union | 2014-01-14 | Paper |
| Fast Order-Preserving Pattern Matching | 2013-12-10 | Paper |
| On-line construction of parameterized suffix trees for large alphabets | 2013-04-04 | Paper |
| Finding consensus and optimal alignment of circular strings | 2013-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3104262 | 2011-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3104263 | 2011-12-19 | Paper |
| An efficient parallel algorithm for scheduling interval ordered tasks | 2011-12-14 | Paper |
| Efficient algorithms for consensus string problems minimizing both distance sum and radius | 2011-10-10 | Paper |
| Fair threshold decryption with semi-trusted third parties | 2011-04-05 | Paper |
| Linear-time construction of two-dimensional suffix trees | 2011-03-02 | Paper |
| A stochastic-difference-equation model for hedge-fund returns | 2010-09-21 | Paper |
| Improving multikey Quicksort for sorting strings with many equal elements | 2010-08-16 | Paper |
| Finding Optimal Alignment and Consensus of Circular Strings | 2010-07-26 | Paper |
| Linear-Time Construction of Suffix Arrays | 2010-04-06 | Paper |
| A sequential auction-bargaining procurement model | 2010-02-12 | Paper |
| Dynamic rank/select structures with applications to run-length encoded texts | 2009-10-09 | Paper |
| A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets | 2009-07-21 | Paper |
| Fair Threshold Decryption with Semi-Trusted Third Parties | 2009-06-25 | Paper |
| Boolean circuit programming: A new paradigm to design parallel algorithms | 2009-06-24 | Paper |
| Sliding Window Method for NTRU | 2009-03-10 | Paper |
| Fast Matching Method for DNA Sequences | 2009-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5506326 | 2009-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5506330 | 2009-01-28 | Paper |
| Computing similarity of run-length encoded strings with affine gap penalty | 2008-07-10 | Paper |
| Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts | 2008-06-17 | Paper |
| A Simple Construction of Two-Dimensional Suffix Trees in Linear Time | 2008-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5446122 | 2008-03-06 | Paper |
| Linear time algorithm for the longest common repeat problem | 2007-10-30 | Paper |
| Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space | 2007-10-18 | Paper |
| On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time | 2007-10-10 | Paper |
| A dynamic edit distance table | 2007-04-26 | Paper |
| The consensus string problem for a metric is NP-complete | 2007-04-26 | Paper |
| An efficient alignment algorithm for masked sequences | 2007-02-26 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| The subtree max gap problem with application to parallel string covering | 2006-10-10 | Paper |
| Implementing approximate regularities | 2006-02-16 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Information Security and Cryptology - ICISC 2003 | 2005-12-27 | Paper |
| Information Security and Cryptology - ICISC 2003 | 2005-12-27 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Constructing suffix arrays in linear time | 2005-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024803 | 2005-07-04 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Three-Dimensional Periodicity and Its Application to Pattern Matching | 2005-02-28 | Paper |
| Efficient parallel exponentiation in using normal basis representations | 2005-02-22 | Paper |
| Deleting keys of B-trees in parallel | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432980 | 2003-10-29 | Paper |
| Generalizations of suffix arrays to multi-dimensional matrices. | 2003-08-17 | Paper |
| Generalizations of suffix arrays to multi-dimensional matrices. | 2003-08-17 | Paper |
| Truncated suffix trees and their application to data compression. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413331 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536418 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547749 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766835 | 2002-07-22 | Paper |
| Parallel algorithms for red--black trees | 2002-03-03 | Paper |
| Approximate periods of strings | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234122 | 2002-01-30 | Paper |
| Fully scalable fault-tolerant simulations for BSP and CGM | 2001-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723940 | 2001-07-08 | Paper |
| Efficient algorithms for approximate string matching with swaps | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230346 | 1999-04-22 | Paper |
| Analysis of two-dimensional approximate pattern matching algorithms | 1998-08-13 | Paper |
| Constant-Time Randomized Parallel String Matching | 1998-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128912 | 1997-04-23 | Paper |
| A work-time optimal algorithm for computing all string covers | 1997-02-27 | Paper |
| Alphabet-Independent Two-Dimensional Witness Computation | 1996-11-07 | Paper |
| Covering a string | 1996-10-16 | Paper |
| Dynamic dictionary matching | 1996-02-26 | Paper |
| Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency | 1995-09-14 | Paper |
| On the Set LCS and Set-Set LCS Problems | 1993-06-29 | Paper |
| Dynamic programming with convexity, concavity and sparsity | 1992-09-26 | Paper |
| An Improved Algorithm For Approximate String Matching | 1990-01-01 | Paper |
| A linear-time algorithm for concave one-dimensional dynamic programming | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733401 | 1989-01-01 | Paper |
