Chih-Long Lin

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

1995

2 Chih-Long Lin: Optimizing TRIEs for Ordered Pattern Matching is Pi^P₂-Complete. Structure in Complexity Theory Conference 1995: 238-244

1994

1 Chih-Long Lin: Hardness of Approximating Graph Transformation Problem. ISAAC 1994: 74-82

1995
2		Chih-Long Lin: Optimizing TRIEs for Ordered Pattern Matching is Pi^P₂-Complete. Structure in Complexity Theory Conference 1995: 238-244
1994
1		Chih-Long Lin: Hardness of Approximating Graph Transformation Problem. ISAAC 1994: 74-82