| 1994 | Analysis of the Convergency of Topology Preserving Neural Networks on Learning. | Daming Zhu, Shaohan Ma, Hongze Qiu |
| 1994 | Further Computational Geometry in Secondary Memory. | Binhai Zhu |
| 1994 | Edge-Coloring and f-Coloring for Various Classes of Graphs. | Xiao Zhou, Takao Nishizeki |
| 1994 | A Neural Network Model for Quadratic Programming with Simple Upper and Lower Bounds and its Application to Linear Programming. | Xiang-Sun Zhang, Hui-Can Zhu |
| 1994 | Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer. | Gilbert H. Young, Chi-lok Chan |
| 1994 | A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations. | Bo-Ting Yang, Yin-Feng Xu, Zhao-yong You |
| 1994 | Fast Algorithms for Transversal Matroid Intersection Problems | Ying Xu, Harold N. Gabow |
| 1994 | Polynomial Equations-Solving and its Applications. | Wu Wen-Tsn |
| 1994 | k-Best Cuts for Circular-Arc Graphs. | Kuo-Hui Tsai, D. T. Lee |
| 1994 | Orthogonal Queries in Segments and Triangles. | Takeshi Tokuyama |
| 1994 | Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. | Satoshi Taoka, Toshimasa Watanabe |
| 1994 | A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. | Seiichiro Tani, Hiroshi Imai |
| 1994 | Shortest Safari Routes in Simple Polygon. | Xuehou Tan, Tomio Hirata |
| 1994 | Approximate Pattern Matching with Samples. | Tadao Takaoka |
| 1994 | Achieving the Shortest Clock Period by Inserting the Minimum Amount of Delay. | Shangzhi Sun, David Hung-Chang Du, Guoliang Xue |
| 1994 | Improved Algorithms for Coloring Random Graphs. | C. R. Subramanian |
| 1994 | Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. | Anand Srivastav, Peter Stangier |
| 1994 | Optimal Routing of Permutations on Rings. | Xiaojun Shen, Qing Hu, Hao Dai, Xiangzu Wang |
| 1994 | Verifying the Determinant in Parallel. | Miklos Santha, Sovanna Tan |
| 1994 | Weighted Irredundance of Interval Graphs. | C. Pandu Rangan, Maw-Shang Chang |
| 1994 | Unifying Themes for Network Selection. | Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph |
| 1994 | Randomized Wait-Free Naming. | Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitnyi |
| 1994 | A Linear-Time Algorithm for Computing Characteristic Strings. | Michio Nakanishi, Morio Hasidume, Minoru Ito, Akihiro Hashimoto |
| 1994 | Computing All Small Cuts in Undirected Networks. | Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki |
| 1994 | Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. | Moshe Molcho, Shmuel Zaks |