Bibliography
Journals   ·   Book Chapters, Etc.   ·   Conference Papers

JOURNAL PUBLICATIONS (For updated list, see CV)

  1. On the Equivalence of Finite-State Sequential Machine Models, IEEE Transactions on Electronic Computers, Vol. 16, 88-90, February, 1967.

  2. Two-way Pushdown Automata (with J.N. Gray and M.A. Harrison), Information and Control, Vol. 11, 30-70, August, 1967.

  3. Multi-head and Multi-tape Pushdown Automata (with M.A. Harrison), Information and Control, Vol. 13, 433-470, November, 1968.

  4. Simple Matrix Languages, Information and Control, Vol. 17, 359-394, November, 1970.

  5. Tape-Bounded Turing Acceptors and Principal AFLS (with R.V. Book, S.A. Greibach, and B. Wegbreit), Journal of Computer and System Sciences, Vol. 4, 622-625, December, 1970.

  6. Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata, Journal of Computer and System Sciences, Vol. 5, 88-117, April, 1971.

  7. Characterizations of Transductions Defined by Abstract Families of Transducers, Mathematical Systems Theory, Vol. 5, 271-281, September, 1971.

  8. A Note Concerning Nondeterministic Tape Complexities, Journal of the Association for Computing Machinery, Vol. 19, 608-612, October, 1972.

  9. On Two-Way Multihead Automata, Journal of Computer and System Sciences, Vol. 7, 28-36, February, 1973.

  10. Controlled Pushdown Automata, Information Sciences, Vol. 6, 327-342, 1973.

  11. Some Results Concerning Automata on Two-Dimensional Tapes (with R.T. Melson), International Journal of Computer Mathematics, Vol. 4, Section A, 269-279, 1974.

  12. A Hierarchy Theorem for Polynomial Space Recognition, SIAM Journal on Computing, Vol. 3, 184-187, September, 1974.

  13. Hierarchies of Turing Machines with Restricted Tape Alphabet Size (with S.K. Sahni), Journal of Computer and System Science, Vol. 11, 56-67, August, 1975.

  14. Polynomially Complete Fault Detection Problems (with S.K. Sahni), IEEE Transactions on Computers, Vol. C-24, 242-249, March, 1975.

  15. A Note on Semilinear Sets and Bounded-Reversal Multi-head Pushdown Automata, Information Processing Letters, \rm Vol. 3, 25-28, July, 1974.

  16. On 3-Head Versus 2-Head Finite Automata (with C.E. Kim), Acta Informatic, Vol. 4, 193-200, 1975.

  17. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems (with C.E. Kim), Journal of the Association for Computing Machinery, Vol. 22, 463-468, October, 1975.

  18. On Two-Processor Scheduling of One-or Two-Unit Time Tasks with Precedence Constraints (with C.E. Kim), Journal of Cybernetics Vol. 5, 87-110, 1976.

  19. Finite Automata with Multiplication (with C.E. Kim and S.K. Sahni), Theoretical Computer Science, Vol. 2, 271-294, September, 1976.

  20. Bounds for LPT Schedules on Uniform Processors (with T. Gonzalez and S.K. Sahni), SIAM Journal on Computing, Vol. 6, 155-166, March, 1977.

  21. Heuristic Algorithms for Scheduling Independent Tasks on Non-identical Processors (with C.E. Kim), Journal of the Association for Computing Machinery, Vol. 24, 280-289, April, 1977.

  22. A Useful Device for Showing the Solvability of Some Decision Problems (with C.E. Kim), Journal of Computer and System Sciences, Vol. 13, 153-160, October, 1976.

  23. Reversal-bounded Multicounter Machines and their Decision Problems, Journal of the Association for Computing Machinery, Vol. 25, 116-133, January 1978.

  24. Approximation Algorithms for Certain Scheduling Problems (with C.E. Kim), Mathematics of Operations Research, Vol. 3, 197-204, August, 1978.

  25. The Unsolvability of the Equivalence Problem for e -Free NGSM's with Unary Input (Output) Alphabet and Applications, , Vol. 7, 524-532, November, 1978.

  26. On Two-way Sequential Transductions of Full Semi AFLS, Theoretical Computer Science, Vol. 7, 287-309, 1978.

  27. Some Decision Problems Concerning Sequential Transducers and Checking Automata (with E.M. Gurari), Journal of Computer and System Sciences, Vol. 18, 18-34, February, 1979.

  28. An NP-Complete Number-Theoretic Problem (with E.M. Gurari), Journal of the Association for Computing Machinery, Vol. 26, 567-581, July, 1979.

  29. On the Space Complexity of Recursive Algorithms (with E.M. Gurari), Information Processing Letters, Vol. 8, 267-271, June, 1979.

  30. Simple Counter Machines and Number-Theoretic Problems (with E.M. Gurari), Journal of Computer and System Sciences, Vol. 19, 145-162, October, 1979.

  31. Restricted One-Counter Machines with Undecidable Universe Problems, Mathematical Systems Theory, Vol. 13, 181-186, 1979.

  32. Path Systems: Constructions, Solutions, and Applications (with E.M. Gurari), SIAM Journal on Computing, Vol. 9, 348-374, 1980.

  33. A Note on the Parallel Complexity of Computing the Rank of Order n Matrices (with S. Moran and L.E. Rosier), Information Processing Letters, Vol. 11, 162, 1980.

  34. The Complexity of Equivalence Problem for Two Characterizations of Preburger Sets (with E.M. Gurari), Theoretical Computer Science, Vol. 13, 295-314, 1981.

  35. On Restricted One-Counter Machines (with L. Rosier), Mathematical Systems Theory, Vol. 14, 241-245, 1981.

  36. The Complexity of the Equivalence Problem for Simple Programs (with E.M. Gurari), Journal of the Association for Computing Machinery, Vol. 28, 535-560, 1981.

  37. Characterizations of Presburger Functions (with B. Leininger), SIAM Journal on Computing, Vol. 10, 22-39, 1981.

  38. The Complexity of Decision Problems for Finite-Turn Multicounter Machines (with E.M. Gurari), Journal of Computer and System Sciences, Vol. 22, 220-229, 1981.

  39. Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems (with S. Moran and L. Rosier), Information Processing Letters, Vol. 12, 227-232, 1981.

  40. Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication (with S. Moran), Information Processing Letters, Vol. 13, 12-15, 1981.

  41. On the Decidability of Equivalence for Deterministic Pushdown Transducers (with L. Rosier), Information Processing Letters, Vol. 13, 89-93, 1981.

  42. Some Simplified Undecidable and NP-hard Problems for Simple Programs (with E.M. Gurari), Theoretical Computer Science, Vol. 17, 55-73, 1982.

  43. Straight-Line Programs with One Input Variable (with B. Leininger),SIAM Journal on Computing, Vol. 11, 1-14, 1982.

  44. The Complexity of the Equivalence Problem for Simple Loop-Free Programs (with B. Leininger), SIAM Journal on Computing, Vol. 11, 15-27, 1982.

  45. (Semi-)Alternating Stack Automata (with E.M. Gurari), Mathematical Systems Theory, Vol. 15, 211-224, 1982.

  46. On the Complexity of Simple Arithmetic Expressions (with B. Leininger and S. Moran), Theoretical Computer Science, Vol. 19, 17-28, 1982.

  47. Two-way Counter Machines and Diophantine Equations (with E.M. Gurari), Journal of the Association for Computing Machinery Vol. 29, 863-873, 1982.

  48. On Some Decision Problems for RAM Programs (with S. Moran), Journal of Computer and System Sciences, Vol. 24, 69-81, 1982.

  49. A Generalized Fast Matrix Decomposition Algorithm and Applications (with S. Moran and R. Hui), Journal of Algorithms, Vol. 3, 45-56, 1982.

  50. 2DST Mappings on Languages and Related Problems, Theoretical Computer Science, Vol. 19, 219-227, 1982.

  51. Probabilistic Algorithms for Deciding Equivalence of Straight- line Programs (with S. Moran), Journal of the Association for Computing Machinery, Vol. 30, 217-228, 1983.

  52. On the Simplification and Equivalence Problems for Straight-line Programs (with B. Leininger), Journal of the Association for Computing Machinery, Vol. 30, 641-656, 1983.

  53. On the Zero-Inequivalence Problem for Loop Programs (with B. Leininger), Journal of Computer and System Sciences, Vol. 26, 47-64, 1983.

  54. On Some Decision Questions Concerning Pushdown Machines, Theoretical Computer Science, Vol. 24, 313-322, 1983.

  55. A Note on Finite-Valued and Finitely Ambiguous Transducers (with E.M. Gurari), Mathematical Systems Theory, Vol. 16, 61-66, 1983.

  56. On the Control Power of Integer Division (with S. Moran and L. Rosier), Theoretical Computer Science, Vol. 24, 35-52, 1983.

  57. Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's (with S. Moran), SIAM Journal on Computing, Vol. 12, 388-394, 1983.

  58. On the Space and Time Complexity of Functions Computable by Simple Programs (with T. Chan), SIAM Journal on Computing, Vol. 12, 708-716, 1983.

  59. On the Finite-Valuedness Problem for Sequential Machines (with T. Chan), Theoretical Computer Science, Vol. 23, 95-101, 1983.

  60. Simple Programming Languages and Restricted Classes of Turing Machines (with L. Rosier), Theoretical Computer Science, Vol. 26, 197-220, 1983.

  61. A Note on the Complexity of Program Evaluation (with B. Leininger and L. Rosier), Mathematical Systems Theor, Vol. 17, 85-96, 1984.

  62. Characterizations and Computational Complexity of Systolic Trellis Automata (with S. Kim), Theoretical Computer Science, Vol. 29, 123-153, 1984.

  63. A Characterization of Systolic Binary Tree Automata and Applications (with S. Kim), Acta Informatica, Vol. 21, 193-207, 1984.

  64. Sequential Machine Characterizations of Trellis and Cellular Automata and Applications (with S. Kim and S. Moran), SIAM Journal on Computing, Vol. 14, 426-447, 1985.

  65. Some Independence Results in Complexity Theory (with S. Moran), International Journal of Computer Mathematics, Vol. 17, 113-122, 1985.

  66. Some Results Concerning Linear Iterative (Systolic) Arrays (with S. Kim and M. Palis), Journal of Parallel and Distributed Computing, Vol. 2, 182-218, 1985.

  67. The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (with L. Rosier), Information and Control, Vol. 65, 18-41, 1985.

  68. On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's (with S. Kim and L. Rosier), Information and Control, Vol. 67, 126-143, 1985.

  69. Fast Parallel Language Recognition by Cellular Automata (with M. Palis and S. Kim), Theoretical Computer Science, Vol. 41, 231-146, 1985.

  70. On Efficient Recognition of Transductions and Relations (with M. Palis and J. Chang), Theoretical Computer Science, Vol. 39, 89-106, 1985.

  71. On Simple Programs with Primitive Conditional Statements (with L. Rosier), Information and Control, Vol. 65, 42-62, 1985.

  72. Some Characterizations of Multihead Finite Automata (with S. Kim and L. Rosier), Information and Control, 67, 114-125, 1985.

  73. Designing Systolic Algorithms Using Sequential Machines (with S. Kim and M. Palis), IEEE Transactions on Computers, Vol. c-35, 531-542, 1986.

  74. Iterative Tree Arrays with Logarithmic Depth (with K. Culik II and S. Yu), International Journal of Computer Mathematics, Vol. 20, 187-204, 1986.

  75. On Pebble Automata (with J. Chang, M. Palis and B. Ravikumar), Theoretical Computer Science, Vol. 44, 111-121, 1986.

  76. Parallel Parsing on a One-Way Array of Finite-State Machines (with J. Chang and M. Palis), IEEE Transactions on Computers, Vol. c-36, 64-75, 1987.

  77. On Efficient Simulations of Systolic Arrays by Random-Access Machines (with M. Palis), SIAM Journal on Computing, vol. 16, 367-377, 1987.

  78. VLSI Algorithms for Solving Recurrence Equations and Applications (with M. Palis), IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-35, 1046-1064, 1987.

  79. On One-way Cellular Arrays (with T. Jiang), SIAM Journal on Computing, vol. 16, 1135-1154, 1987.

  80. Some Observations Concerning Alternating Turing Machines Using Small Space (with J. Chang, B. Ravikumar, L. Berman), Information Processing Letters, vol. 25, 1-9, 1987.

  81. Single Row Routing with Crossover Bound (with D. Du and F. Naveda), IEEE Transactions on Computer Aided Design, Vol. CAD-6, 190-201, 1987.

  82. Systolic Tree Implementation of Data Structures (with J. Chang, M. Chung and K. Rao), IEEE Transactions on Computers, vol. 37, 727-735, 1988.

  83. On the Power of One-way Communication (with J. Chang and A Vergis), Journal of the Association for Computing Machinery, vol. 35, 697-726, 1988.

  84. Two-dimensional Iterative Arrays: Characterizations and Applications (with M. Palis), Theoretical Computer Science, vol. 57, 47-86, 1988.

  85. On Two-Dimensional Via Assignment for Single-Row Routing (with D. Du and F. Naveda), IEEE Transactions on Computers, vol. 37, 721-727, 1988.

  86. Relating the Power of Cellular Arrays to their Closure Properties (with T. Jiang), Theoretical Computer Science, vol. 57, 225-238, 1988.

  87. Two-Dimensional Convolution on the Pyramid Computer (with J. Chang, T. Pong, and S. Sohn), IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, 590-593, 1988.

  88. Sublogarithmic-space Turing Machines, Nonuniform Space Complexity, and Closure Properties (with B. Ravikumar), Mathematical Systems Theory, vol. 21, 1-17, 1988.

  89. Some Subclasses of Context-Free Languages in NC^1 (with T. Jiang and B. Ravikumar), Information Processing Letters, vol. 29, 111-117, 1988.

  90. Optimal Simulation of Tree Arrays by Linear Arrays (with T. Jiang), Information Processing Letters, vol. 30, 295-302, 1989.

  91. On Iterative and Cellular Tree Arrays (with T. Jiang), Journal of Computer and System Sciences, vol. 38, no. 3, 452-473, 1989.

  92. Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded Alternating TMs and Space-Bounded TMs (with J. Chang and M. Palis), Theoretical Computer Science, vol. 68, 19-36, 1989.

  93. Parallel Recognition and Parsing on the Hypercube (with T. Pong and S. Sohn), IEEE Transactions on Computers, vol. 40, 764-770, 1991.

  94. Learning Regular Languages from Counterexamples (with T. Jiang), Journal of Computer and System Sciences, vol. 43, 299-316, 1991.

  95. Relating the Type of Ambiguity of Finite Automata to Succinctness of their Representation (with B. Ravikumar), SIAM Journal on Computing, vol. 18, 1263-1282, 1989.

  96. String Processing on the Hypercube (with T. Pong and S. Sohn), IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 38, 160-164, 1990.

  97. Some Classes of Languages in NC^1 (with T. Jiang, J. Chang, and B. Ravikumar), Information and Computation, vol. 90, pp. 86-106, 1991.

  98. String Editing on a One-way Linear Array of Finite-state Machines (with T. Jiang and H. Wang), IEEE Transactions on Computers, vol. 41, pp. 112-118, 1992.

  99. Systolic Algorithms for Some Scheduling and Graph Problems (with T. Jiang, J. Chang, and M. Palis), Journal of VLSI Signal Processing, vol. 1, 307-320, 1990.

  100. Parallel Parsing on a One-way Linear Array of Finite-state Machines (with T. Jiang and H. Wang), Theoretical Computer Science, vol. 85, 53-74, 1991.

  101. On Mapping Systolic Algorithms onto the Hypercube (with S. Sohn), IEEE Transactions on Parallel and Distributed Systems, vol. 1, 48-63, 1990.

  102. The Power of Alternating One-reversal Counters and Stacks (with T. Jiang) (previously titled, Trading Reversals for Alternation), SIAM Journal on Computing, vol. 20, 278-290, 1991.

  103. An Efficient All-Parses Systolic Algorithm for General Context-free Parsing (with M. Palis), International Journal of Parallel Programming, vol. 19, pp. 295-331, 1990.

  104. On Space-bounded Synchronized Alternating Turing Machines (with N. Tran), Theoretical Computer Science, vol. 99, pp. 243-264, 1992.

  105. A Hierarchy Result for 2-Dimensional TM's Operating in Small Space (with T. Jiang, H. Wang, and Q. Zheng), Information Sciences, vol. 64, pp. 49-56, 1992.

  106. Iterative Algorithms for the Planar Convex Hull Problem on Mesh-Connected Arrays (with A. Holey), Parallel Computing, vol. 18, pp. 281-296, 1992.

  107. A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars (with T. Jiang and H. Wang), Theoretical Computer Science, vol. 99, pp. 301-313, 1992.

  108. On Efficient Parallel Algorithms for Solving Set Recurrence Equations (with H. Wang and T. Jiang), Journal of Algorithms, vol. 14, pp. 244-257, 1993.

  109. Synchronized Finite Automata and 2DFA Reductions (with N. Tran), Theoretical Computer Science, vol. 115, pp. 261-275, 1993.

  110. Quadtree Building Algorithms on an SIMD Hypercube (with M. Kim), Journal of Parallel and Distributed Computing, vol. 18, pp. 71-76, 1993.

  111. A Note on Simple Programs with Two Variables (with N. Tran), Theoretical Computer Science, vol. 112, pp. 391-397, 1993.

  112. On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages (with T. Jiang, N. Tran, and H. Wang), International Journal of Foundations of Computer Science, vol. 4, no. 2, pp. 135-146, 1993.

  113. Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube (with M. Kim), Journal of Parallel and Distributed Computing, vol. 20, pp. 303-316, 1994.

  114. Some Results Concerning 2-D On-line Tesselation Acceptors and 2-D Alternating Finite Automata (with T. Jiang and H. Wang), Theoretical Computer Science, vol. 125, pp. 243-257, 1994.

  115. Some Efficient Algorithms for Permutation Graphs (with Q. Zheng), Journal of Algorithms, vol. 16, pp. 453-469, 1994.

  116. On Communication-bounded Synchronized Alternating Finite Automata (with N. Tran), Acta Informatica, vol. 31, pp. 315-327, 1994.

  117. New Decidability Results Concerning Two-way Counter Machines (with T. Jiang, N. Tran, and H. Wang), SIAM Journal on Computing, vol. 24, no. 1, pp. 123-137, 1995.

  118. An Optimal Shortest Path Parallel Algorithm for Permutation Graphs (with Q. Zheng), Journal of Parallel and Distributed Computing, vol. 24, pp. 94-99, 1995.

  119. A Note on Parsing Pattern Languages (with T. Pong and S. Sohn), Pattern Recognition Letters, vol. 16, no. 2, pp. 179-182, 1995.

  120. Performance Prediction in Symbolic Scheduling of Partioned Programs with Weight Variation (with T. Yang), Journal of Parallel and Distributed Computing, vol. 34, pp. 171-182, 1996.

  121. A Digital Library for Geographically Referenced Materials (with T. Smith, D. Andresen, L. Carver, R. Dolin, C. Fischer, J. Frew, M. Goodchild, R. Kemp, R. Kothuri, M. Larsgaard, B. Manjunath, D. Nebert, J. Simpson, A. Wells, T. Yang, Q. Zheng), IEEE Computer, vol. 29, no. 5, pp. 54-60, 1996. (Note erratum on page 14 of vol. 29, no. 7 issue of IEEE Computer.)

  122. Towards a Scalable Distributed WWW Server on Networked Workstations (with A. Andresen and T. Yang), to appear in Journal of Parallel and Distributed Computing.

  123. On the Parallel Complexity of Loops (with N. Tran and T. Yang), to appear in Theoretical Computer Science.

  124. On the Complexity of Commutativity Analysis (with P. Diniz and M. Rinard), to appear in International Journal of Foundations of Computer Science.

  125. Parallel Progressive Radiosity with Adaptive Meshing (with Y. Yu and T. Yang), to appear in Journal of Parallel and Distributed Computing.


BOOK CHAPTERS, ETC. (For updated list, see CV)
  1. Parallel Parsing on the Hypercube (with T. Pong and S. Sohn), book section in Performance of Distributed and Parallel Systems , T. Hasegawa, H. Takagi, and Y. Takahashi, editors, North-Holland, 1989.

  2. On Resetting DLBA's, Bulletin of the European Association for Theoretical Computer Science, no. 44, pp. 190-191, 1991; also appeared in SIGACT (Special Interest Group in Automata and Computability Theory) News, vol. 22, no. 1, pp. 62-63, 1991.

  3. Applications of the Unsolvability of Hilbert's Tenth Problem to Decision Questions Concerning Programs and Abstract Machines, invited chapter for the "Handbook on Hilbert's Tenth Problem", co-edited by M. Davis and Y. Matiyasevich, to be published by the AMS as a volume in the Advances in Mathematical Sciences. The handbook is expected to appear on the eve of the centenary of Hilbert's famous address about "Mathematical Problems" delivered in 1900 during the ICM in Paris.


CONFERENCE PAPERS SINCE 1986 (For updated list, see CV)
  1. Systolic Arrays: Characterizations and Complexity, Proceedings of the 1986 Mathematical Foundations of Computer Science Symposium (invited speaker), Bratislava, Czechoslovakia, 1986.

  2. On Pebble Automata (with J. Chang, M. Palis and B. Ravikumar), Proceedings of the 20th Annual Conference on Information Sciences and Systems, Princeton, New Jersey, 1986.

  3. Parallel Parsing on a One-Way Array of Finite-State Machines (with J. Chang and M. Palis), Proceedings of the 1986 International Conference on Parallel Processing, St. Charles, Illinois, 1986.

  4. Systolic Tree Implementation of Data Structures (with J. Chang., M. Chung and K. Rao), Proceedings of the 1986 International Conference on Parallel Processing, St. Charles, Illinois, 1986.

  5. On the Power of One-way Communication (with J. Chang and A. Vergis), Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, Toronto, Canada, 1986.

  6. On Sparseness, Ambiguity and Other Decision Problems for Acceptors and Transducers (with B. Ravikumar), Proceedings of the 3rd Symposium on Theoretical Aspects of Compututer Science , Orsay, France, 1986.

  7. On One-way Cellular Arrays (with T. Jiang), Proceedings of the 14th International Colloquium on Automata, Languages, and Programming, Karlsruhe, F. R. Germany, 1987.

  8. Two-Dimensional Convolution on the Pyramid Computer (with J. Chang, T. Pong, and S. Sohn), Proceedings of the 1987 International Conference on Parallel Processing, St. Charles, Illinois, 1987.

  9. Relating the Degree of Ambiguity of Finite Automata to Succinctness of their Representation (with B. Ravikumar), Proceedings of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, 1987.

  10. Systolic Algorithms for Some Scheduling and Graph Problems (with T. Jiang, J. Chang, and M. Palis), Proceedings of the 1988 International Conference on Systolic Arrays, San Diego, California, 1988.

  11. Trading Reversals for Alternation (with T. Jiang), Proceedings of the Structure in Complexity Theory Third Annual Conference, Washington, D.C., 1988.

  12. Some Languages in NC^1 (with T. Jiang and B. Ravikumar), Proceedings of the Aegean Workshop on Computing: 3rd International Workshop on Parallel Computation and VLSI Theory, Corfu Island, Greece, 1988.

  13. Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded Alternating TMs and Space-Bounded TMs (with J. Chang and M. Palis), Proceedings of the 15th International Colloquium on Automata, Languages, and Programming, Tampere, Finland 1988.

  14. Hypercube Algorithms for Some String Comparison Problems (with T. Pong and S. Sohn), Proceedings of the 1988 International Conference on Parallel Processing, St. Charles, Illinois, 1988.

  15. Learning Regular Languages from Counterexamples (with T. Jiang), Proceedings of the 1988 Workshop on Computational Learning Theory, Boston, Massachusetts, 1988.

  16. Parallel Parsing on the Hypercube (with T. Pong and S. Sohn), Proceedings of the International Seminar on Performance of Distributed and Parallel Systems, Kyoto, Japan, 1988.

  17. On Mapping Systolic Algorithms onto the Hypercube (with S. Sohn), Proceedings of the 1989 International Conference on Parallel Processing, St. Charles, Illinois, August 1989.

  18. An Efficient All-Parses Systolic Algorithm for General Context-free Parsing (with M. Palis), Proceedings of the 1989 Workshop on Algorithms and Data Structures, Ottawa, Canada, August 1989.

  19. Cellular Arrays: Characterizations and Complexity, 1989 Workshop on Cellular Automata: Theory and Experiment (invited speaker), Los Alamos, New Mexico, September 1989.

  20. Scene Labeling on the Hypercube (with T. Pong and S. Sohn), Proceedings of the 1989 International Joint Conference on Artificial Intelligence Workshop on Parallel Algorithms for Machine Intelligence, Detroit, Michigan, August 1989.

  21. Parallel Parsing on a One-way Linear Array of Finite-state Machines (with T. Jiang and H. Wang), Proceedings of the 1989 Ninth Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India, December 1989.

  22. String Processing on the Hypercube (with T. Pong and S. Sohn), Proceedings of the 1988 International Conference on Parallel Processing, August 1988.

  23. Iterative Algorithms for Planar Convex Hull on Mesh-Connected Arrays (with A. Holey), Proceedings of the 1990 International Conference on Parallel Processing, St. Charles, Illinois, August 1990.

  24. String Editing on a One-way Linear Array of Finite-state Machines (with T. Jiang and H. Wang), Proceedings of the 1990 International Conference on Parallel Processing, St. Charles, Illinois, August 1990.

  25. Some Results Concerning 2-D On-line Tesselation Acceptors Proceedings of the Toyohashi Symposium on Theoretical Computer Science (invited speaker), Toyohashi, Japan, August 1990.

  26. Efficient Parallel Algorithms for Solving Set Recurrence Equations and Applications (with H. Wang and Y. Jiang), Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas, December 1990.

  27. Triangulation in a Plane and 3-D Convex Hull on Mesh-Connected Arrays and Hypercubes (with A. Holey), Proceedings of the Fifth International Parallel Processing Symposium, Anaheim, California, April-May 1991.

  28. Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube (with M. Kim), Proceedings of the Fifth International Parallel Processing Symposium, Anaheim, California, April-May 1991.

  29. Triangulation, Voronoi Diagram, and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes (with A. Holey), Proceedings of the 20th Annual International Conference on Parallel Processing, St. Charles, Illinois, August 1991.

  30. On Space-bounded Synchronized Alternating Turing Machines (with N. Tran), Proccedings of the 1991 Fundamentals of Computation Theory Conference, Berlin, Germany, September 1991.

  31. Some Results Concerning 2-D On-line Tesselation Acceptors and 2-D Alternating Finite Automata (with T. Jiang and H. Wang), Proceedings of the International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, September 1991.

  32. Quadtree Building Algorithms on an SIMD Hypercube (with M. Kim), Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, California, March 1992.

  33. New Results Concerning Synchronized Finite Automata (with N. Tran), Proceedings of the 1992 International Colloquium on Automata, Languages, and Programming, Vienna, Austria, July 1992.

  34. Minimum Cover and Single Source Shortest Path Problems for Weighted Interval Graphs and Circular-arc Graphs (with H. Wang and Q. Zheng), Proceedings of the Thirtieth Annual Allerton Conference on Communication, Control, and Computing, Allerton, Illinois, October 1992.

  35. On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages (with T. Jiang, N. Tran, and H. Wang), Proceedings of the 1993 Symposium on Theoretical Aspects of Computer Science, Germany, February 1993.

  36. On the Shortest Path Problem for Permutation Graphs (with Q. Zheng), Proceedings of the 7th International Parallel Processing Symposium, Newport Beach, California, April 1993.

  37. New Decidability Results Concerning Two-way Counter Machines and Applications (with T. Jiang, N. Tran, and H. Wang), Proceedings of the 1993 International Colloquium on Automata, Languages and Programming, Lund, Sweden, July 1993.

  38. On the Communication Complexity of Parallel Computation (with N. Tran), Proceedings of the 1993 Mathematical Foundations of Computer Science Symposium, Gdanks, Poland, August 1993.

  39. Finding Articulation Points and Bridges of Permutation Graphs (with Q. Zheng), Proceedings of the 1993 International Conference on Parallel P Processing, St. Charles, Illinois, August 1993.

  40. A Flow Based Approach to the Pin Redistribution Problem for Multi-Chip Modules (with D. Chang and T. Gonzalez), Proceedings of the Fourth Great Lakes Symposium on VLSI, Notre Dame, Indiana, March 1994.

  41. Transformations Between Boundary Codes, Run Length Codes and Linear Quadtrees (with M. Kim), Proccedings of the 1994 International Parallel Processing Symposium, Cancun, Mexico, April 1994.

  42. On Some Open Problems Concerning the Complexity of Cellular Arrays (with T. Jiang), invited paper, Proceedings: Results and Trends in Theoretical Computer Science - Colloquium in Honor of Arto Salomaa, Graz, Austria, June 1994.

  43. On the Parallel Complexity of Solving Recurrence Equations (with N. Tran), Proceedings of the 1994 International Symposium on Algorithms and Computation, Beijing, China, August 1994.

  44. The WWW Prototype of the Alexandria Digital Library (with D. Andresen, L. Carver, R. Dolin, C. Fischer, J. Frew, M. Goodchild, T. Kothuri, M. Larsgaard, B. Manjunath, D. Nebert, J. Simpson, T. Smith, T. Yang, Q. Zheng), Proceedings of ISDL'95: International Symposium on Digital Libraries, Japan, August 1995.

  45. On Symbolic Scheduling and Parallel Complexity of Loops (with T. Yang), to appear in Proceedings of IEEE Symposium on Parallel and Distributed Processing, San Antonio, Texas, October 1995.

  46. SWEB: Towards a Scalable World Wide Web Server on Multicomputers (with D. Andresen, T. Yang, V. Holmedahl), Proceedings of the 1996 International Parallel Processing Symposium, Honolulu, Hawaii, April 1996.

  47. Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval (with A. Poulakidas, A. Srinivasan, O. Egecioglu and T. Yang), Proceedings of the 1996 NASA Combined Industry, Space and Earth Science Data Compression Workshop, Snowbird, Utah, April 1996.

  48. Scalability Issues for High Performance Digital Libraries on the World Wide Web (with D. Andresen, O. Egecioglu, T. Smith and T. Yang, Proceedings of the 1996 Advanced Digital Libraries Conference, Washington, D.C., May 1996.

  49. On the Complexity of Cellular Automata, invited presentation, Proceedings of the French School in Theoretical Computer Science, Saissac, France, June 1996.

  50. On the Complexity of Commutativity Analysis (with P. Diniz and M. Rinard), Proceedings of the 1996 Conference on Computing and Combinatorics, Hong Kong, June 1996.

  51. Parallel Progressive Radiosity with Adaptive Meshing (with Y. Yu and T. Yang), Proceedings of Irregular'96, Santa Barbara, August 1996.

  52. Efficient Access and Delivery of Images for the Digital Library, Keynote Address, Third International Conference on High Performance Computing, Trivandrum, India, December 1996.

  53. On the Containment and Equivalence of Database Queries with Linear Constraints (with J. Su), Sixteenth Symposium on Principles of Database Systems, Tucson, Arizona, May 1997.

  54. A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval (with A. Poulakidas, A. Srinivasan, O. Egecioglu, T. Yang), COCOON'97, Shanghai, China, August 1997.

Return to top of page.