Table of Contents

• What s Wrong With Formal Programming Methods?Eric C. R. Hehner. 2-23
• Computer Science and Communications Protocols: Research RelationshipsRobert L. Probert. 24-32
• Reaping the Benefits of Mass Production with Massively Parallel Computing - Four Example ApplicationsStephen J. Smith. 33-42
• On the Quickest Path ProblemYung-Chen Hung, Gen-Huey Chen. 44-46
• Practical Adaptive SortingVladimir Estivill-Castro, Derick Wood. 47-54
• Lower Bounds for Algebraic Computation Trees of Functions with Finite DomainsNader H. Bshouty. 55-65
• Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of TreesJames Haralambides, Fillia Makedon. 66-77
• The Interpolation-Based Bintree and its Application to GraphicsAris M. Ouksel, Anan Yaagoub. 78-89
• On the k-Coloring of IntervalsMartin C. Carlisle, Errol L. Lloyd. 90-101
• Folding a Triangulated Simple Polygon: Structural and Algorithmic ResultsAli A. Kooshesh, Bernard M. E. Moret. 102-110
• A Relationship Between Self-Organizing Lists and Binary Search TreesTony W. Lai, Derick Wood. 111-116
• How Costly Can Red-Black Trees Be?Helen Cameron, Derick Wood. 117-126
• Balance in AVL TreesHelen Cameron, Derick Wood. 127-133
• A Tight Lower Bound for Selection in Sorted X+YMichel Cosnard, Afonso Ferreira. 134-138
• Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average CaseChristos Levcopoulos, Andrzej Lingas. 139-148
• Generating Random Graphs EfficientlyRajeev Raman. 149-160
• Linear Extensions with BacktrackingIvan Rival, Siming Zhan. 161-168
• Storing Shortest Paths for a PolyhedronJindong Chen, Yijie Han. 169-180
• An Improved Join Dependency for Efficient Constraint CheckingKok-Phuang Tan, T. C. Tan. 182-184
• On the Power of Query-Independent CompilationJiawei Han. 185-196
• Parallel Transitive Closure Computation in Highly Scalable MultiprocessorsAnestis A. Toptsis. 197-206
• Methods and Tools for Integrating Database Systems and Object-Oriented Programming SystemsBogdan D. Czejdo, Malcolm C. Taylor. 207-218
• Incremental Database Design RevisitedKe Wang, Li-Yan Yuan. 219-230
• Partial Document Ranking by Heuristic MethodsDik Lun Lee, Wai Yee Peter Wong. 231-239
• Context Inheritance and Content Inheritance in an Object-Oriented Data ModelLi Yu, Sylvia L. Osborn. 240-251
• Graphical Specification of Recursive QueriesBogdan D. Czejdo, Ralph P. Tucci, David W. Embley. 252-263
• On Designing Relational Database Schemes for Efficient Query ProcessingMichio Nakanishi, Yoshiki Katsuyama, Minoru Ito, Akihiro Hashimoto. 264-275
• The Mean Value Approach to Performance Evaluation of Time-Stamp Ordering AlgorithmsMohamed Eltoweissy, Nagwa M. El-Makky, M. Abougabal, Souheir A. Fouad. 276-287
• A Backend Text Retrieval Machine for Signature-Based Document RankingBudi Yuwono, Dik Lun Lee. 288-297
• Partitioning and Scheduling of Parallel Functional Programs Using Complexity InformationPiyush Maheshwari. 300-311
• Subtree Availability in Binary Tree ArchitecturesRavi Mittal, Bijendra N. Jain, Rakesh K. Patney. 312-322
• An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting ProblemIp-Wang Chan, Donald K. Friesen. 323-334
• A Fault-Tolerant Binary Tree ArchitectureSiu-Cheung Chau, Arthur L. Liestman. 335-346
• Undordered Tree ContractionLih-Hsing Hsu, Jones J. J. Wang. 347-349
• Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication ModelsChang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen. 350-359
• Parallel Routing and Sorting of the Pancake NetworkKe Qiu, Henk Meijer, Selim G. Akl. 360-371
• Practical Parallel Algorithms for Chordal GraphsEric S. Kirsch, Jean R. S. Blair. 372-382
• Logarithmic Time NC Algorithms for Comparability Graphs and Circle GraphsLin Chen. 383-394
• Compact Hypercubes: Properties and RecognitionAlfred J. Boals, Ajay K. Gupta, Jahangir A. Hashmi, Naveed A. Sherwani. 395-402
• Increasing Communication Bandwidth on HypercubeZhiyong Liu, Jia-Huai You. 403-414
• Programming a Parallel Sort Using Distributed Procedure CallsDaniel Herman, Laurent Trilling. 415-417
• A Note on Off-Line Permutation Routing on a Mesh-Connected Processor ArrayDanny Krizanc. 418-420
• A Fully-Pipelined Solutions Constructor for Dynamic Programming ProblemsJean Frédéric Myoupo. 421-430
• On the Fault-Tolerance of Quasi-Minimal Cayley NetworksMarc Baumslag. 431-442
• Some Fast Parallel Algorithms for Parentheses MatchingSajal K. Das, Calvin Ching-Yuen Chen, Gene Lewis, Sushil K. Prasad. 443-454
• A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor ProblemRong Lin, Stephan Olariu. 455-461
• Extended Cycle Shrinking: A Restructuring Method for Parallel CompilationSupratim Biswas, Amitabha Sanyal, L. M. Tewari. 462-470
• Sequential and Distributed Algorithms for the All Pairs Quickest Path ProblemJ. Ben Rosen, Guoliang Xue. 471-473
• An Efficient Approximation Algorithm for Hypercube SchedulingAlfred J. Boals, Ajay K. Gupta, Jahangir A. Hashmi, Naveed A. Sherwani. 474-483
• An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its TraversalsStephan Olariu, C. Michael Overstreet, Zhaofang Wen. 484-495
• An Efficient Multiprocessor Architecture for Image Processing in VLSIHee Yong Youn. 496-507
• Generalized Fault Tolerance Properties of Star GraphsPradip K. Srimani. 510-519
• A Formal Description of the IC:::*::: Model of Parallel ComputationB. Gopinath, Ambuj K. Singh, Prem Uppaluru. 520-531
• An Efficient Algorithm for Quiescence Detection in a Distributed SystemSatyendra P. Rana. 532-534
• Interval Arithmetic for Computing Performance Guarantees in Client-Server SoftwareC. Murray Woodside, Shikharesh Majumdar, John E. Neilson. 535-546
• Enhanced Reliability in Scheduling Critical Tasks for Hard Real-Time Distributed SystemsGhasem S. Alijani, Horst Wedde. 547-558
• A Design and Modeling Environment to Develop Real-Time, Distributed Software SystemsReda A. Ammar, Ping Zhang. 559-570
• On the Management of Remote Procedure Call TransactionsWanlei Zhou, Brian Molinari. 571-581
• Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-StampsLefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas. 582-587
• A Distributed Scheduling Algorithm for Heterogeneous Real-Time SystemsOsman ZeinElDine, Mohamed Eltoweissy, Ravi Mukkamala. 588-598
• A Distributed Solution to the k-out of-M Resources Allocation ProblemMichel Raynal. 599-609
• Efficient Distributed Resource Scheduling for Adaptive Real-Time Operation SupportHorst Wedde, Douglas C. Daniels, Dorota M. Huizinga. 610-627
• Mapping of Fault-Tolerant Permutations in OmegaUma Bhattacharya, Swapan Bhattacharya. 628-639
• Artificial Neural Networks for Predicting Silicon Content in Raw Iron From Blast FurnacesAbhay B. Bulsari, Henrik Saxén. 642-644
• A Chemical Reactor Selection Expert System Created by Training an Artificial Neural NetworkAbhay B. Bulsari, Bjørn Saxén, Henrik Saxén. 645-656
• A Modeling Technique for Generating Causal Explanations of Physical SystemsRattikorn Hewett. 657-668
• Planning in Conceptual NetworksLeixuan Yang, Stan Szpakowicz. 669-671
• Empirical Study of the Meaning of the Hedge VERY Patricia Cerrito, Waldemar Karwowski, Krzysztof Ostaszewski. 672-674
• Kernel Knowledge Versus Belt Knowledge in Default Reasoning: a Logical ApproachM. A. Nait Abdallah. 675-686
• Neural Network Processing Elements as a New Generation of Flip-Flops Eugeniusz Eberbach. 687-698
• A Proof-Theoretic Framework for Nonmonotonic Reasoning and Logic ProgrammingLi-Yan Yuan, Jia-Huai You, Cheng Hui Wang. 699-708
• On Semantics, Syntactics and Fixpoints of General ProgramsLi-Yan Yuan. 709-720
• A Framework for Variable -Resolution VisionAnup Basu, Xiaobo Li. 721-732
• An RMS for Temporal Reasoning with AbstractionV. Sundararajan, Hitesh N. Dholakia, N. Parameswaran. 733-744