[1] Fuxiang Yu, Ker-I Ko: On logarithmic-space computable real numbers. Theor. Comput. Sci. 469: 127-133 (2013)
[2] Fuxiang Yu, Ker-I Ko: On parallel complexity of analytic functions. Theor. Comput. Sci. 489-490: 48-57 (2013)
[3] Ker-I Ko, Fuxiang Yu: On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane. Electron. Notes Theor. Comput. Sci. 202: 121-135 (2008)
[4] Fuxiang Yu: On the Complexity of the Pancake Problem. Electron. Notes Theor. Comput. Sci. 167: 95-115
[5] Ker-I Ko, Fuxiang Yu: Jordan Curves with Polynomial Inverse Moduli of Continuity. Electron. Notes Theor. Comput. Sci. 167: 425-447 (2007)
[6] Ker-I Ko, Fuxiang Yu: On the complexity of computing the logarithm and square root functions on a complex domain. J. Complex. 23(1): 2-24 (2007)
[7] Fuxiang Yu: On the complexity of the pancake problem. Math. Log. Q. 53(4-5): 532-546 (2007)
[8] Fuxiang Yu: An Old Fermatian Problem: 11203. Am. Math. Mon. 114(9): 840 (2007)
[10] Ker-I Ko, Fuxiang Yu: Jordan curves with polynomial inverse moduli of continuity. Theor. Comput. Sci. 381(1-3): 148-161 (2007)
[11] Fuxiang Yu: On the Representations of NC and Log-Space Real Numbers. COCOON 2007: 318-326
[12] Fuxiang Yu, Arthur W. Chou, Ker-I Ko: On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. J. Complex. 22(6): 803-817 (2006)
[13] Fuxiang Yu: On Some Complexity Issues of NC Analytic Functions. TAMC 2006: 375-386
[14] Fuxiang Yu, Arthur W. Chou, Ker-I Ko: On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. CCA 2005: 341-355
[15] Ker-I Ko, Fuxiang Yu: On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain. COCOON 2005: 349-358
[16] Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D. Stoller, Nanjun Hu: Parametric regular path queries. PLDI 2004: 219-230