| 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 | A Convex Hull Algorithm on Coarse-Grained Multiprocessors. Xiaotie Deng |
| 1994 | A Linear-Time Algorithm for Computing Characteristic Strings. Michio Nakanishi, Morio Hasidume, Minoru Ito, Akihiro Hashimoto |
| 1994 | A Multiway Merging Network. De-Lei Lee, Kenneth E. Batcher |
| 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 | A New Problem in String Searching. George Havas, Jin Xian Lian |
| 1994 | A Randomized Algorithm to Finite Automata Public Key Cryptosystem. Feng Bao, Yoshihide Igarashi |
| 1994 | A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. Seiichiro Tani, Hiroshi Imai |
| 1994 | Achieving the Shortest Clock Period by Inserting the Minimum Amount of Delay. Shangzhi Sun, David Hung-Chang Du, Guoliang Xue |
| 1994 | Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings Ding-Zhu Du, Xiang-Sun Zhang |
| 1994 | Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. Anand Srivastav, Peter Stangier |
| 1994 | An Approximation Scheme for Some Steiner Tree Problems in the Plane. Tao Jiang, Lusheng Wang |
| 1994 | An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. Xuemin Lin, Maria E. Orlowska |
| 1994 | An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs. Sun-Yuan Hsieh, Chin-Wen Ho |
| 1994 | Analysing Deletions in Competitive Self-Adjusting Linear List. Lucas Chi Kwong Hui, Charles U. Martel |
| 1994 | Analysis of the Convergency of Topology Preserving Neural Networks on Learning. Daming Zhu, Shaohan Ma, Hongze Qiu |
| 1994 | Approximate Pattern Matching with Samples. Tadao Takaoka |
| 1994 | Are Fibonacci Heaps Optimal? Diab Abuaiadh, Jeffrey H. Kingston |
| 1994 | Average Cost to Produce Partial Orders. Jingsen Chen |
| 1994 | Average Time Complexity of the SAT 1.2 Algorithm. Jun Gu, Qian-Ping Gu |
| 1994 | Components and Projections of Curves over Finite Fields. Joachim von zur Gathen, Igor E. Shparlinski |
| 1994 | Computing All Small Cuts in Undirected Networks. Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki |
| 1994 | Computing Solutions Uniquely collapses the Polynomial Hierarchy. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman |
| 1994 | Definition and Existence of Super Complexity Cores. Ingrid Biehl |
| 1994 | Deterministic w Automata vis-a-vis Deterministic Buchi Automata. Sriram C. Krishnan, Anuj Puri, Robert K. Brayton |
| 1994 | Distributed Algorithms for Finding Small Cycle Covers in Arbitrary Networks. Esther Jennings, Lenka Motyckova |
| 1994 | Edge-Coloring and f-Coloring for Various Classes of Graphs. Xiao Zhou, Takao Nishizeki |
| 1994 | Edge-Disjoint Paths in Permutation Graphs. C. P. Gopalakrishnan, C. Pandu Rangan |
| 1994 | Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer. Gilbert H. Young, Chi-lok Chan |
| 1994 | Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem. Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
| 1994 | Every Set of Disjoint Line Segments Admits a Binary Tree. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint |
| 1994 | Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. Chuzo Iwamoto, Kazuo Iwama |
| 1994 | Fast Algorithms for Transversal Matroid Intersection Problems Ying Xu, Harold N. Gabow |
| 1994 | Fast Deterministic Hot-Potato Routing on Processor Arrays. Michael Kaufmann, Harald Lauer, Heiko Schröder |
| 1994 | Fast and Efficient Operations on Parallel Priority Queues. Danny Z. Chen, Xiaobo Hu |
| 1994 | Finitely Representables Spatial Objects and Efficient Computation. Yongmao Chen, Terence R. Smith |
| 1994 | Further Computational Geometry in Secondary Memory. Binhai Zhu |
| 1994 | Hamiltonian Abstract Voronoi Diagrams in Linear Time. Rolf Klein, Andrzej Lingas |
| 1994 | Hardness of Approximating Graph Transformation Problem. Chih-Long Lin |
| 1994 | Heaps with Bits. Svante Carlsson, Jingsen Chen, Christer Mattsson |
| 1994 | Improved Algorithms for Coloring Random Graphs. C. R. Subramanian |
| 1994 | Manpower Scheduling with Shift Change Constraints. Hoong Chuin Lau |
| 1994 | Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. Satoshi Taoka, Toshimasa Watanabe |
| 1994 | Multispace Search: A New Optimization Approach. Jun Gu |
| 1994 | Nonuniform Lowness and Strong Nonuniform Lowness. Hong-Zhou Li, Guan-Ying Li |
| 1994 | On Determining the Congruity of Point Sets in Higher Dimensions. Tatsuya Akutsu |
| 1994 | On Greedy Tetrahedralization of Points in 3D. Francis Y. L. Chin, Cao An Wang |
| 1994 | On Helping and Interactive Proof Systems. Vikraman Arvind, Johannes Köbler, Rainer Schuler |
| 1994 | On Random Hard Sets for NP. Ronald V. Book, Osamu Watanabe |
| 1994 | On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing. Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman |
| 1994 | On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences. Martin Middendorf |
| 1994 | On the Approximation of Largest Common Subtrees and Largest Common Point Sets. Tatsuya Akutsu, Magnús M. Halldórsson |
| 1994 | On the Parallel Complexity of Solving Recurrence Equations. Oscar H. Ibarra, Nicholas Q. Trân |
| 1994 | On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions. Kazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima |
| 1994 | Optimal Routing of Permutations on Rings. Xiaojun Shen, Qing Hu, Hao Dai, Xiangzu Wang |
| 1994 | Orthogonal Queries in Segments and Triangles. Takeshi Tokuyama |
| 1994 | Parallel h-v Drawings of Binary Trees. Panagiotis Takis Metaxas, Grammati E. Pantziou, Antonios Symvonis |
| 1994 | Polynomial Equations-Solving and its Applications. Wu Wen-Tsün |
| 1994 | Quantum Computation and NP-Complete Problems. Takashi Mihara, Tetsuro Nishino |
| 1994 | Quasi-Random Combinatorial Structures (Abstract). Ronald L. Graham |
| 1994 | Randomized Wait-Free Naming. Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi |
| 1994 | Realizing Degree Sequences in Parallel. Srinivasa Rao Arikati, Anil Maheshwari |
| 1994 | Reporting and Counting Intersections of Lines within a Polygon. Tetsuo Asano |
| 1994 | Resource Bounded Randomness and Weakly Complete Problems. Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng |
| 1994 | Revisiting Circular Arc Graphs. Lin Chen |
| 1994 | Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. Moshe Molcho, Shmuel Zaks |
| 1994 | Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry. Jin-Yi Cai, Michael D. Hirsch |
| 1994 | Separability and One-Way Functions. Lance Fortnow, John D. Rogers |
| 1994 | Shortest Safari Routes in Simple Polygon. Xuehou Tan, Tomio Hirata |
| 1994 | Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. Ming-Yang Kao, Shang-Hua Teng |
| 1994 | The Generating Algorithm for Quasi-Full Steiner Trees. Jiyu Ding |
| 1994 | The Maximum Latency and Identification of Positive Boolean Functions. Kazuhisa Makino, Toshihide Ibaraki |
| 1994 | The Totally-Perfect Bipartite Graph and Its Construction. Kunihiro Fujiyoshi, Yoji Kajitani, Hiroshi Niitsu |
| 1994 | The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki |
| 1994 | Two Notes on Low-Density Subset Sum Algorithms. Daxing Li, Shaohan Ma |
| 1994 | Unifying Themes for Network Selection. Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph |
| 1994 | Verifying the Determinant in Parallel. Miklos Santha, Sovanna Tan |
| 1994 | Weighted Irredundance of Interval Graphs. C. Pandu Rangan, Maw-Shang Chang |
| 1994 | k-Best Cuts for Circular-Arc Graphs. Kuo-Hui Tsai, D. T. Lee |
| 1994 | k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. Qian-Ping Gu, Shietung Peng |