BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Belgium
1 × Canada
1 × China
1 × Czech Republic
1 × Germany
1 × Greece
1 × Israel
1 × Spain
1 × Sweden
2 × USA
Collaborated with:
M.Li P.M.B.Vitányi O.H.Ibarra B.Ravikumar M.Harman Y.Hassoun E.L.Lawler L.Wang J.I.Seiferas G.Lin Z.Chen J.Wen H.Buhrman N.Q.Trân H.Wang A.Salomaa K.Salomaa S.Yu A.Blum J.Tromp M.Yannakakis R.Hou L.Zhang P.Qi J.Dong H.Wang X.Gu S.Zhang
Talks about:
approxim (3) common (3) way (3) two (3) shortest (2) subsequ (2) sequenc (2) problem (2) longest (2) complex (2)

Person: Tao Jiang

DBLP DBLP: Jiang:Tao

Contributed to:

HPCA 20132013
WCRE 20082008
ICALP 20012001
ICALP 19991999
ICALP 19941994
STOC 19941994
ICALP 19931993
STOC 19931993
ICALP 19911991
STOC 19911991
ICALP 19871987

Wrote 14 papers:

HPCA-2013-HouJZQDWGZ #effectiveness
Cost effective data center servers (RH, TJ, LZ, PQ, JD, HW, XG, SZ), pp. 179–187.
WCRE-2008-JiangHH #analysis
Analysis of Procedure Splitability (TJ, MH, YH), pp. 247–256.
ICALP-2001-LinCJW #problem #sequence
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations (GHL, ZZC, TJ, JW), pp. 444–455.
New Applications of the Incompressibility Method (HB, TJ, ML, PMBV), pp. 220–229.
ICALP-1999-JiangLV #complexity
Average-Case Complexity of Shellsort (TJ, ML, PMBV), pp. 453–462.
ICALP-1994-JiangL #approximate #on the #sequence
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (TJ, ML), pp. 191–202.
STOC-1994-JiangLW #approximate #complexity #sequence
Aligning sequences via an evolutionary tree: complexity and approximation (TJ, ELL, LW), pp. 760–769.
Two heads are better than two tapes (TJ, JIS, PMBV), pp. 668–675.
ICALP-1993-IbarraJTW #decidability
New Decidability Results Concerning Two-way Counter Machines and Applications (OHI, TJ, NQT, HW), pp. 313–324.
ICALP-1993-JiangSSY #decidability #pattern matching
Inclusion is Undecidable for Pattern Languages (TJ, AS, KS, SY), pp. 301–312.
STOC-1993-JiangL #string
k one-way heads cannot do string-matching (TJ, ML), pp. 62–70.
ICALP-1991-JiangR #automaton #nondeterminism #problem
Minimal NFA Problems Are Hard (TJ, BR), pp. 629–640.
STOC-1991-BlumJLTY #approximate #linear #string
Linear Approximation of Shortest Superstrings (AB, TJ, ML, JT, MY), pp. 328–336.
ICALP-1987-IbarraJ #array #on the #power of
On the Computing Power of One-Way Cellular Arrays (OHI, TJ), pp. 550–562.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.