Abstract is missing.
- Planar Point Location Revisited (A Guided Tour of a Decade of Research)Franco P. Preparata. 1-17
- Computing a Viewpoint of a Set of Points Inside a PolygonSubir Kumar Ghosh. 18-29
- Analysis of Preflow Push Algorithms for Maximum Network FlowJoseph Cheriyan, S. N. Maheshwari. 30-48
- A New Linear Algorithm for the Two Path Problem on Chordal GraphsS. V. Krishnan, C. Pandu Rangan, S. Seshadri. 49-66
- Extending Planar Graph Algorithms to ::::K 3, 3::::-free GraphsSamir Khuller. 67-79
- Constant-Space String-MatchingMaxime Crochemore. 80-87
- Inherent Nonslicibility of Rectangular Duals in VLSI FloorplanningSusmita Sur-Kolay, Bhargab B. Bhattacharya. 88-107
- Path Planning with Local InformationAmitava Datta, Kamala Krithivasan. 108-121
- Linear Broadcast RoutingChing-Tsun Chou. 122
- Predicting deadlock in Store-and-Forward NetworksClaudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi. 123-142
- On Parallel Sorting and Addition with Concurrent WritesSanjeev Saxena, P. C. P. Bhatt, V. C. Prasad. 143-153
- On Optimal Parallel Algorithm for Sorting Presorted FilesChristos Levcopoulos. 154-160
- Superlinear Speedup in Parallel State-Space SearchV. Nageshwara Rao, Vipin Kumar. 161-174
- Circuit Definitions of Nondeterministic Complexity ClassesH. Venkateswaran. 175-192
- Non-Uniform Proof System: A New Framework to Describe Non-Uniform and Probabalistic Complexity ClassesJürgen Kämper. 193-210
- Padding, Commitment and Self-reducabilitySanjeev N. Khadilkar. 211-224
- The Complexity of a Counting Finite-State AutomatonCraig A. Rich. 225-239
- A Hierarchy Theorem for Pram-Based Complexity ClassesWalter W. Kirchherr. 240-249
- A Natural Deduction treatment of Operational SemanticsRod M. Burstall, Furio Honsell. 250-269
- Unformly Applicative Structures, A Theory of Computability and Polyadic FunctionsPatrick Bellot. 270-285
- A Proof Technique for Register AutomicityBaruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi. 286-303
- Relation Level SemanticsJules Desharnais, Nazim H. Madhavji. 304-328
- A Constructive Set Theory for Program DevelopmentMartin C. Henson, Raymond Turner. 329-347
- McCarthy s Amb Cannot Implement Fair MergePrakash Panangaden. 348-363
- GHC - A Language for a New Age of Parallel ProgrammingKoichi Furukawa, Kazunori Ueda. 364-376
- Accumulators: A New Logic Variable Abstractions for Functional LanguagesKeshav Pingali, Kattamuri Ekanadham. 377-399
- A Resolution Rule for Well-Formed FormulaeK. S. H. S. R. Bhatta, Harish Karnick. 400-418
- Algebraic and Operational Semantics of Positive/Negative Conditional Algebraic SpecificationStéphane Kaplan. 419-434
- Semi-UnificationDeepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman. 435-454
- A Method to Check Knowledge Base ConsistencyAlain Beauvieux. 455-468
- Knowledgebases as Structured TheoriesJosé Luiz Fiadeiro, Amílcar Sernadas, Cristina Sernadas. 469-486
- On Functional IndependenciesJürgen M. Janas. 487-508
- A Generic Algorithm for Transaction Processing During Network PartitioningBharat K. Bhargava, Shirley Browne. 509-519