| Publication | Date of Publication | Type |
|---|
A constrained subgrid-scale model for passive scalar turbulence
Acta Mechanica Sinica | 2025-04-10 | Paper |
Subgrid-scale structure and fluxes of turbulence underneath a surface wave
Journal of Fluid Mechanics | 2019-10-14 | Paper |
A conservative scheme for solving coupled surface-bulk convection-diffusion equations with an application to interfacial flows with soluble surfactant
Journal of Computational Physics | 2016-12-05 | Paper |
One-dimensional approximate point set pattern matching with L_p-norm
Theoretical Computer Science | 2014-01-22 | Paper |
Chaos synchronization in the presence of noise
International Journal of Modern Physics C | 2013-04-18 | Paper |
A fully compressed algorithm for computing the edit distance of run-length encoded strings
Algorithmica | 2013-03-05 | Paper |
Efficient retrieval of approximate palindromes in a run-length encoded string
Theoretical Computer Science | 2012-06-25 | Paper |
A note on pressure accuracy in immersed boundary method for Stokes flow
Journal of Computational Physics | 2011-07-13 | Paper |
Finding all sorting tandem duplication random loss operations
Journal of Discrete Algorithms | 2011-05-03 | Paper |
FINDING ALL APPROXIMATE GAPPED PALINDROMES
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
Identifying approximate palindromes in run-length encoded strings
Algorithms and Computation | 2010-12-09 | Paper |
An inverse problem in estimating the relaxation time for nanoscale phonon radiative transfer problem
International Journal for Numerical Methods in Engineering | 2010-09-17 | Paper |
An iterative regularization method for inverse phonon radiative transport problem in nanoscale thin films
International Journal for Numerical Methods in Engineering | 2010-09-10 | Paper |
A fully compressed algorithm for computing the edit distance of run-length encoded strings
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Hardness of comparing two run-length encoded strings
Journal of Complexity | 2010-09-01 | Paper |
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
Information Processing Letters | 2009-12-18 | Paper |
Finding all approximate gapped palindromes
Algorithms and Computation | 2009-12-17 | Paper |
Mathematical model and worm wheel tooth working surfaces of the ZN-type hourglass worm gear set
Mechanism and Machine Theory | 2009-10-26 | Paper |
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
Combinatorial Pattern Matching | 2009-07-07 | Paper |
CONTROLLING CHAOS VIA STATE FEEDBACK CANCELLATION IN A NOISY CHAOTIC SYSTEM
International Journal of Modern Physics C | 2009-06-05 | Paper |
On the range maximum-sum segment query problem
Discrete Applied Mathematics | 2007-09-21 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Improved algorithms for the \(k\) maximum-sums problems
Theoretical Computer Science | 2006-10-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
