| Publication | Date of Publication | Type |
|---|
The longest almost increasing subsequence problem with sliding windows
Theoretical Computer Science | 2024-06-27 | Paper |
A fast maximum finding algorithm on broadcast communication
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Linear-space S-table algorithms for the longest common subsequence problem
Theoretical Computer Science | 2023-06-15 | Paper |
An efficient algorithm for the longest common palindromic subsequence problem
Theoretical Computer Science | 2022-06-13 | Paper |
The generalized definitions of the two-dimensional largest common substructure problems
Algorithmica | 2020-05-21 | Paper |
A diagonal-based algorithm for the longest common increasing subsequence problem
Theoretical Computer Science | 2020-04-06 | Paper |
Parallel graph algorithms based upon broadcast communications
IEEE Transactions on Computers | 2018-09-14 | Paper |
Multiperiod portfolio investment using stochastic programming with conditional value at risk
Computers & Operations Research | 2018-07-11 | Paper |
Efficient merged longest common subsequence algorithms for similar sequences
Theoretical Computer Science | 2017-12-20 | Paper |
A parallel algorithm for circulant tridiagonal linear systems
Information Processing Letters | 2016-06-09 | Paper |
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
An adaptive heuristic algorithm with the probabilistic safety vector for fault-tolerant routing on the \((n,k)\)-star graph
International Journal of Foundations of Computer Science | 2015-01-21 | Paper |
Finding the gapped longest common subsequence by incremental suffix maximum queries
Information and Computation | 2014-07-18 | Paper |
The indexing for one-dimensional proportionally-scaled strings
Information Processing Letters | 2013-03-28 | Paper |
Efficient algorithms for the longest common subsequence problem with sequential substring constraints
Journal of Complexity | 2013-01-14 | Paper |
Fast algorithms for computing the constrained LCS of run-length encoded strings
Theoretical Computer Science | 2012-06-25 | Paper |
A new efficient indexing algorithm for one-dimensional real scaled patterns
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Efficient indexing algorithms for one-dimensional discretely-scaled strings
Information Processing Letters | 2012-03-19 | Paper |
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
Information Processing Letters | 2010-06-09 | Paper |
Efficient algorithms for the block edit problems
Information and Computation | 2010-04-14 | Paper |
Efficient algorithms for finding interleaving relationship between sequences
Information Processing Letters | 2010-03-24 | Paper |
An algorithm and applications to sequence alignment with weighted constraints
International Journal of Foundations of Computer Science | 2010-03-09 | Paper |
Dynamic programming algorithms for the mosaic longest common subsequence problem
Information Processing Letters | 2010-01-29 | Paper |
Tree edge decomposition with an application to minimum ultrametric tree approximation
Journal of Combinatorial Optimization | 2007-06-21 | Paper |
| scientific article; zbMATH DE number 1696641 (Why is no real title available?) | 2002-07-22 | Paper |
Multicast algorithms for hypercube multiprocessors
Journal of Parallel and Distributed Computing | 2001-11-27 | Paper |
| scientific article; zbMATH DE number 1471732 (Why is no real title available?) | 2000-07-09 | Paper |
| scientific article; zbMATH DE number 1444315 (Why is no real title available?) | 2000-05-09 | Paper |
Fault Tolerance on Star Graphs
International Journal of Foundations of Computer Science | 1997-09-29 | Paper |
A fast maximum finding algorithm on broadcast communication
Information Processing Letters | 1997-02-27 | Paper |
Reducing conflict resolution time for solving graph problems in broadcast communications
Information Processing Letters | 1992-06-28 | Paper |
The mapping of two-dimensional array processors to one-dimensional processors
Parallel Computing | 1986-01-01 | Paper |
