| 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 |
scientific article; zbMATH DE number 7696008 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-14 | Paper |
Efficient Construction of Hierarchical Overlap Graphs
1511.68104 | 2022-12-22 | Paper |
Cartesian Tree Matching and Indexing
(available as arXiv preprint) | 2022-07-18 | Paper |
Impact of the arm's length regulation on a supply chain with asymmetric retailers
European Journal of Operational Research | 2022-03-18 | Paper |
Fast algorithms for single and multiple pattern Cartesian tree matching
Theoretical Computer Science | 2020-12-15 | Paper |
Finding patterns and periods in Cartesian tree matching
Theoretical Computer Science | 2020-10-22 | Paper |
Fast multiple pattern Cartesian tree matching
(available as arXiv preprint) | 2020-07-22 | Paper |
| Finding periods in Cartesian tree matching | 2020-02-25 | Paper |
Fast string matching for DNA sequences
Theoretical Computer Science | 2020-02-20 | Paper |
Impact of transfer pricing methods for tax purposes on supply chain performance under demand uncertainty
Naval Research Logistics | 2019-03-26 | Paper |
Improved pattern-scan-order algorithms for string matching
Journal of Discrete Algorithms | 2018-09-27 | Paper |
| Algorithm engineering for all-pairs suffix-prefix matching | 2018-08-13 | Paper |
Offshoring and outsourcing in a global supply chain: impact of the arm's length regulation on transfer pricing
European Journal of Operational Research | 2018-05-30 | Paper |
Joint decisions on product line selection, purchasing, and pricing
European Journal of Operational Research | 2018-05-30 | Paper |
FM-index of alignment with gaps
Theoretical Computer Science | 2018-02-16 | Paper |
A fast algorithm for the all-pairs suffix-prefix problem
Theoretical Computer Science | 2017-11-06 | Paper |
Fast batch modular exponentiation with common-multiplicand multiplication
Information Processing Letters | 2017-10-18 | Paper |
On representations of ternary order relations in numeric strings
Mathematics in Computer Science | 2017-07-17 | Paper |
A new graph model and algorithms for consistent superstring problems
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
FM-index of alignment: a compressed index for similar strings
Theoretical Computer Science | 2016-06-16 | Paper |
The working set algorithm has competitive ratio less than two
Information Processing Letters | 2016-05-26 | Paper |
Fast multiple order-preserving matching algorithms
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Parallel maximum matching algorithms in interval graphs
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Transferring and sharing exchange-rate risk in a risk-averse supply chain of a multinational firm
European Journal of Operational Research | 2015-02-04 | Paper |
A fast algorithm for order-preserving pattern matching
Information Processing Letters | 2014-12-09 | Paper |
High-speed parallel implementations of the rainbow method in a heterogeneous system
Lecture Notes in Computer Science | 2014-08-20 | Paper |
Continuous-time Markov chain models to estimate the premium for extended hedge fund lockups
Annals of Operations Research | 2014-05-08 | Paper |
Order-preserving matching
Theoretical Computer Science | 2014-03-13 | Paper |
Extending alignments with \(k\)-mismatches and \(\ell\)-gaps
Theoretical Computer Science | 2014-03-13 | Paper |
Suffix tree of alignment: an efficient index for similar data
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Constant-round privacy preserving multiset union
Bulletin of the Korean Mathematical Society | 2014-01-14 | Paper |
Fast order-preserving pattern matching
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
On-line construction of parameterized suffix trees for large alphabets
Information Processing Letters | 2013-04-04 | Paper |
Finding consensus and optimal alignment of circular strings
Theoretical Computer Science | 2013-02-19 | Paper |
| scientific article; zbMATH DE number 5989955 (Why is no real title available?) | 2011-12-19 | Paper |
| Approximate word sequence matching on an inverted file index | 2011-12-19 | Paper |
An efficient parallel algorithm for scheduling interval ordered tasks
Journal of Complexity | 2011-12-14 | Paper |
Efficient algorithms for consensus string problems minimizing both distance sum and radius
Theoretical Computer Science | 2011-10-10 | Paper |
Fair threshold decryption with semi-trusted third parties
International Journal of Applied Cryptography | 2011-04-05 | Paper |
Linear-time construction of two-dimensional suffix trees
Algorithmica | 2011-03-02 | Paper |
A stochastic-difference-equation model for hedge-fund returns
Quantitative Finance | 2010-09-21 | Paper |
Improving multikey Quicksort for sorting strings with many equal elements
Information Processing Letters | 2010-08-16 | Paper |
Finding optimal alignment and consensus of circular strings
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Linear-time construction of suffix arrays (extended abstract)
Combinatorial Pattern Matching | 2010-04-06 | Paper |
A sequential auction-bargaining procurement model
Naval Research Logistics | 2010-02-12 | Paper |
Dynamic rank/select structures with applications to run-length encoded texts
Theoretical Computer Science | 2009-10-09 | Paper |
A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets
Information Processing Letters | 2009-07-21 | Paper |
Fair Threshold Decryption with Semi-Trusted Third Parties
Information Security and Privacy | 2009-06-25 | Paper |
Boolean circuit programming: A new paradigm to design parallel algorithms
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Sliding Window Method for NTRU
Applied Cryptography and Network Security | 2009-03-10 | Paper |
Fast Matching Method for DNA Sequences
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
| scientific article; zbMATH DE number 5499319 (Why is no real title available?) | 2009-01-28 | Paper |
| An improved Boolean circuit for maximum matching in a convex bipartite graph | 2009-01-28 | Paper |
Computing similarity of run-length encoded strings with affine gap penalty
Theoretical Computer Science | 2008-07-10 | Paper |
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
Combinatorial Pattern Matching | 2008-06-17 | Paper |
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
Combinatorial Pattern Matching | 2008-06-17 | Paper |
| Approximate seeds of strings | 2008-03-06 | Paper |
Linear time algorithm for the longest common repeat problem
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
Theoretical Computer Science | 2007-10-18 | Paper |
On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
Algorithmica | 2007-10-10 | Paper |
A dynamic edit distance table
Journal of Discrete Algorithms | 2007-04-26 | Paper |
The consensus string problem for a metric is NP-complete
Journal of Discrete Algorithms | 2007-04-26 | Paper |
An efficient alignment algorithm for masked sequences
Theoretical Computer Science | 2007-02-26 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
The subtree max gap problem with application to parallel string covering
Information and Computation | 2006-10-10 | Paper |
Implementing approximate regularities
Mathematical and Computer Modelling | 2006-02-16 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Information Security and Cryptology - ICISC 2003
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Information Security and Cryptology - ICISC 2003
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Constructing suffix arrays in linear time
Journal of Discrete Algorithms | 2005-10-27 | Paper |
| scientific article; zbMATH DE number 2185637 (Why is no real title available?) | 2005-07-04 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Three-Dimensional Periodicity and Its Application to Pattern Matching
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Efficient parallel exponentiation in using normal basis representations
Journal of Algorithms | 2005-02-22 | Paper |
Deleting keys of B-trees in parallel
Journal of Parallel and Distributed Computing | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 1998344 (Why is no real title available?) | 2003-10-29 | Paper |
Generalizations of suffix arrays to multi-dimensional matrices.
Theoretical Computer Science | 2003-08-17 | Paper |
Generalizations of suffix arrays to multi-dimensional matrices.
Theoretical Computer Science | 2003-08-17 | Paper |
Truncated suffix trees and their application to data compression.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1950618 (Why is no real title available?) | 2003-07-17 | Paper |
| scientific article; zbMATH DE number 1759465 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1786458 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 1696642 (Why is no real title available?) | 2002-07-22 | Paper |
Parallel algorithms for red--black trees
Theoretical Computer Science | 2002-03-03 | Paper |
Approximate periods of strings
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1263250 (Why is no real title available?) | 2002-01-30 | Paper |
Fully scalable fault-tolerant simulations for BSP and CGM
Journal of Parallel and Distributed Computing | 2001-08-21 | Paper |
| scientific article; zbMATH DE number 1615270 (Why is no real title available?) | 2001-07-08 | Paper |
Efficient algorithms for approximate string matching with swaps
Journal of Complexity | 1999-05-11 | Paper |
| scientific article; zbMATH DE number 1256660 (Why is no real title available?) | 1999-04-22 | Paper |
Analysis of two-dimensional approximate pattern matching algorithms
Theoretical Computer Science | 1998-08-13 | Paper |
Constant-Time Randomized Parallel String Matching
SIAM Journal on Computing | 1998-02-10 | Paper |
| scientific article; zbMATH DE number 1003282 (Why is no real title available?) | 1997-04-23 | Paper |
A work-time optimal algorithm for computing all string covers
Theoretical Computer Science | 1997-02-27 | Paper |
Alphabet-Independent Two-Dimensional Witness Computation
SIAM Journal on Computing | 1996-11-07 | Paper |
Covering a string
Algorithmica | 1996-10-16 | Paper |
Dynamic dictionary matching
Journal of Computer and System Sciences | 1996-02-26 | Paper |
Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
Journal of Parallel and Distributed Computing | 1995-09-14 | Paper |
On the Set LCS and Set-Set LCS Problems
Journal of Algorithms | 1993-06-29 | Paper |
Dynamic programming with convexity, concavity and sparsity
Theoretical Computer Science | 1992-09-26 | Paper |
An Improved Algorithm For Approximate String Matching
SIAM Journal on Computing | 1990-01-01 | Paper |
A linear-time algorithm for concave one-dimensional dynamic programming
Information Processing Letters | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4119620 (Why is no real title available?) | 1989-01-01 | Paper |
