Abstract is missing.
- Algorithms and Complexity - IntroductionDavid W. Krumme. 2
- On the Complexity of Bisimilarity of Normed Probabilistic Context-Free ProcessesDung T. Huynh, Lu Tian. 3-7
- An Adaptive Generic Sorting Algorithm That Uses Variable PartitioningVladimir Estivill-Castro, Derick Wood. 8-12
- Lambda-Calculi with Decidable Cappa-Type CheckingKevin E. Flannery. 13-19
- The Synthesis of Two Compatible Rooted Trees in a Rooted Supertree by an Algorithm on SetsMariana Kant. 20-25
- Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc GraphsMadhav V. Marathe, Harry B. Hunt III, S. S. Ravi. 26-30
- Efficient Algorithms for All-Pairs Shortest Path Problem on Interval, Directed Path, and Circular-Arc GraphsDipti S. Joshi, R. Sridhar, N. Chandrasekharan. 31-35
- On the Difference Between Turing Machine Time and Random-Access Machine TimeKenneth W. Regan. 36-40
- Size-Depth Tradeoff for Strictly Non-Blocking Generalized-ConcentratorsH. K. Dai. 41-47
- The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small DepthH. K. Dai. 48-54
- SelectivityLane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang. 55-59
- An O(n log::2:: n) Hybrid Sorting Algorithm on 2-D GridKok-Phuang Tan, Ghim Hwee Ong, Seng Chuan Tay. 60-64
- Far Field Path Planning for Rotorcraft NOE Missions in a Mountainous RegionHuade Li, Francis Suraweera. 65-70
- Interpretive Language Implementation from a Layered Operational ModelMichael Oudshoorn, Chris D. Marlin. 71-76
- On Space Bounded Server AlgorithmsGanesh Baliga, Anil M. Shende. 77-81
- An Efficient Parallel Recognition Algorithm of Parity GraphsElias Dahlhaus. 82-86
- A Combinatorial View of Visibility Graphs of Simple PolygonsJames Abello, Krishna Kumar, Ömer Egecioglu. 87-92
- Analysis of Windowing Operations or R+ TreesXiao You Zhou, W. A. Davis. 93-97
- Minimize Linear Mutual Recursion by Rule UnfoldingKe Wang, Weining Zhang, Siu-Cheung Chau. 98-102
- Self-Stablizing Fault LocationMitchell Flatebo, Ajoy Kumar Datta. 103-107
- Distributed Computing - IntroductionDavid W. Krumme. 110
- Fixed-Path Proxy-Logins with Assured TerminationThomas Hardjono, Tadashi Ohta. 111-115
- On a Communication Software Generation Method from Communication Service Specifications Described by a Declarative LanguageKeizo Kawata, Akira Takura, Tadashi Ohta. 116-122
- Potential Benefits of File Migration in a Heterogeneous Distributed File SystemRichard T. Hurley, Soon Aun Yeap, J. W. Wong, James P. Black. 123-127
- Impact of Priority-Based ATM Switch Design on System PerformanceJianxun Ding, Hong Jiang. 128-132
- Object Oriented Specification of Multi-Layered ProtocolsAndrew F. Watts, David H. Pitt, Colin Smythe. 133-139
- BUS: A Multicasting Protocol for Interconnected LANsOsman ZeinElDine, Mohamed Eltoweissy, Hussein M. Abdel-Wahab. 140-144
- On Implementing Large Fault-Tolerant Binary Tree Architecture in WSISiu-Cheung Chau. 145-149
- A New Decomposition Method to Relieve the State Space Explosion ProblemX. Li, Richard Lai, Tharam S. Dillon. 150-154
- On the Rearrangeability of Switching Networks Composed of Digital Symmetrical MatricesDung T. Huynh, Hai N. Nguyen. 155-159
- DCL: Protocols and Primitives for Distributed and Concurrent Computing in Networked EnvironmentsVaidy S. Sunderam. 160-164
- A Sequentially Consistent Distributed Shared MemoryJames Z. Zhou, Masaaki Mizuno, Gurdip Singh. 165-169
- Design and Implementation of a Distributed Applications TestbedJames W. Hong, Michael A. Bauer, John A. O Neill. 170-174
- Performance of Barrier Synchronization Methods in a Multi-Access NetworkShun Yan Cheung, Vaidy S. Sunderam. 175-179
- A Distributed Algorithm for Ear DecompositionSridhar Hannenhalli, Kalyan S. Perumalla, N. Chandrasekharan, R. Sridhar. 180-184
- An Efficient Transitive Closure Algorithm for Distributed DatabasesIsmail H. Toroslu, Lawrence J. Henschen. 185-189
- Differential Hashing Functions: Application to Reachability Graph GenerationBernard Cousin. 190-194
- A Distributed Approach to the Design of ApplicationsDag Johansen. 195-201
- On the Complexities of the Leader Election AlgorithmsHosame Abu-Amara, Arkady Kanevsky. 202-206
- Solvable Classes for Reliable Network AllocationConstantine Stivaros. 207-211
- Concurrency and Parallelism - IntroductionMichael A. Langston. 214
- On the Concurrency of C++Xining Li, He Huang. 215-219
- An Efficient Parallel Solution for the Longest Increasing Subsequence ProblemChristophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo. 220-224
- Job Simulation Techniques on Incomplete and Gray Code Incomplete HypercubesIvan Stojmenovic. 225-229
- Independent Performance Modeling of Parallel Architectures and AlgorithmsEric E. Johnson. 230-234
- Context Parallelism in an Indexical Programming LanguageWeichang Du. 235-239
- Parallel Compting Dominators on Hypercube MultiprocessorsShi-Jinn Horng. 240-243
- A Denotational Model for the Integration of Concurrent, Functional, and Imperative ProgrammingDominique Bolignano, Mourad Debbabi. 244-250
- Integrated Concurrency-Coherence Control in Distributed Shared MemoryDawn N. Jutla, Peter Bodorik, J. Spruce Riordon. 251-255
- A Simple Optimal Parallel Dicitionary MachineF. Choi, I. W. Chan. 256-260
- Speculative Parallelism in BaLinda LispChung-Kwong Yuen, Ming-Dong Feng, Jenn-Jong Yee. 261-265
- Parallel Algorithm for Quadtree Medial Axis TransformDipak Pravin Doctor, Ivan Hal Sudborough. 266-271
- Optimizing the Time Cost of the Parallel Structures with a Limited Number of ProcessorsTahany A. Fergany, Reda A. Ammar, Mohamad R. Neilforoshan-Dardashti. 272-276
- B:::**:::-Tree: A Data Organization Method for High Storage UtilizationAnestis A. Toptsis. 277-281
- B:::***:::-Tree: A Family of Efficient Data Packaging Multiway TreesAnestis A. Toptsis. 282-286
- Artificial Intelligence - IntroductionJerzy W. Grzymala-Busse. 288
- Combination of Evidence in Rough Set TheoryPawan Lingras. 289-293
- Specialised Theorem-Proving in an Intelligent Tutoring System for the Dijkstra-Gries Programming MethodologyFrank Ng, Gregory Butler. 294-298
- Improving Efficiency of a Theorem Prover by Eliminating Redundant Unifications Using Network StructuresShie-Jue Lee, Chih-Hung Wu. 299-304
- The Design of Competitive Algorithms via Genetic AlgorithmsVladimir Estivill-Castro. 305-309
- Pattern Matching for Case Analysis: A Computational Definition of ClosenessSylvain Delisle, Terry Copeck, Stan Szpakowicz, Ken Barker. 310-315
- Dynamic Integration of Knowledge in MemoryAdil Kabbaj, Claude Frasson. 316-320
- An Object-Oriented Expert System for Local Area Network DesignChih-Hung Wu, Shie-Jue Lee. 321-326
- The CSA Approach to Knowledge Representation in Neural NetworksEugeniusz Eberbach, Piotr W. Prószynski. 327-331
- InterlinguaeWalter A. Sedelow Jr., Sally Yeates Sedelow. 332-338
- The Concept conceptSally Yeates Sedelow, Walter A. Sedelow Jr.. 339-343
- Structural and Behavioral Representations in Roget s International ThesaurusJohn Brady. 344-348
- Formal Concept Analysis with Many-Sorted AttributesRobert E. Kent, John Brady. 349-353
- Discovery of Geometry Theorems: Avoiding Isomorphic Situation DescriptionsRajiv Bagai, Vasant Shanbhogue, Jan M. Zytkow, Shang-Ching Chou. 354-358
- A Hierarchy of Pattern Recognition Algorithms for the Diagnosis of Sucker Rod Pumped WellsJames Abello, Anne Houang, James Russell. 359-364
- Botstrap Learning of Alpha-Beta-Evaluation FunctionsAlois P. Heinz, Christoph Hense. 365-369
- Interval-Set Algebra for Qualitative Knowledge RepresentationY. Y. Yao. 370-374
- Designing a Stochastic Parameter ReasonerMarimin, Robert E. Mercer, J. M. Carroll. 375-379
- A Parallel Algorithm for the Steiner Tree ProblemKia Makki, Ken Been, Niki Pissinou. 380-384
- Formal Description and Verification of Knowledge Base Redundancy and SubsumptionNga Kwo Liu. 385-389
- Software Engineering and Information Technology - IntroductionPradip K. Srimani. 392
- Why Views Do Not Provide Logical Data IndependenceMartin Boogaard, Jonas M. de Graaff, René J. Veldwijk. 393-397
- A Framework for Incremental Integration ToolsMartin Lefering. 398-402
- The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed DatabasesChristos Bouras, Paul G. Spirakis. 403-407
- Case-Based Reasoning Methodology for Analyzing Multi-Database SchemasJian Yang, Mike P. Papazoglou. 408-412
- Evaluation of Linear Join Processing Trees in Shared-Nothing Database EnvironmentLilian Harada, Naoki Akaboshi. 413-417
- The Descriptor Theory - What is about?Sieglinde Stainer, Stefan Biffl, Thomas Grechenig. 418-422
- Why Functional Languages Really Need ParallelismPaul A. Bailes, Ming Gong, Andrew Moran. 423-427
- The Serializability of Transactions in Object BasesMichael Zapp, Ken Barker. 428-432
- Graphical Query Specification with Participation ConstraintsBogdan D. Czejdo, Ralph P. Tucci, David W. Embley, Stephen W. Liddle. 433-437
- A Timestamp-Based Concurrency Control Algorithm for Heterogeneous Distributed DatabasesSoon Myoung Chung, Khalid A. Elghayesh. 438-442
- A Heterogeneous Distributed Information SystemSoon Myoung Chung, C. N. Ravikiran. 443-447
- Using Information Retrieval for Software ReuseJian-Yun Nie, François Paradis, Jean G. Vaucher. 448-452
- An Object-Oriented Data Model SpecificationDaniel K. C. Chan, David J. Harper, Philip W. Trinder. 453-457
- Performance Analysis of Time-Stamp Ordering Algorithms in Database Systems: The Pure Restarts CaseMohamed Eltoweissy, Hussein M. Abdel-Wahab, M. Abougabal, Nagwa M. El-Makky, Souheir A. Fouad. 458-463
- A Method for Software Reuse Through Large Component LibrariesGuttorm Sindre, Even-André Karlsson, Tor Stålhane. 464-468
- From Code Comprehension Model to Tool CapabilitiesAnneliese Amschler Andrews, A. Marie Vans. 469-473
- Towards CASE Tool Support for Rigorous Structured AnalysisRobert B. France, Thomas W. G. Docker. 474-478
- Improving the Reusability of Program Specification Through Data Flow ModelingHee Beng Kuan Tan, Tok Wang Ling, Yin Seong Ho. 479-483
- The GeoSQL Language for the Manipulation of Geographical DataFranco Arcieri, Stefano Ercoli, Enrico Nardelli. 484-490
- Index Selection in Relational DatabasesSunil Choenni, Henk M. Blanken, Thiel Chang. 491-496
- Parallel Naive and Semi-Naive Transitive Closure EvaluationXiaofang Zhou, Maria E. Orlowska. 497-501
- An Extended Version Model for Artistic Design ApplicationsBarry Eaglestone, G. L. Davies, T. Ungvary. 502-506
- A Software Reuse System Based on Natural Language SpecificationsM. R. Girardi, Bertrand Ibrahim. 507-511
- A Neural Network Model for Documentary Base Self-Organising and QueryingMohand Boughanem, Redouane Layaida, Armand Caron. 512-518
- AI-Based Classification and Retrieval of Reusable Software ComponentsAarthi Prasad, E. K. Park. 519-523
- Preprocessing First-Class Functions for AdaPaul A. Bailes, Dan B. Johnston, Eric J. Salzman. 524-528
- Optimal Operations on Red-Black TreesLin Chen, René Schott. 529-533
- On Driving and Monitoring Smalltalk-80 Applications Using Unix SpreadsheetsJean-Pierre Corriveau, Bill Macready. 534-538
- On Data Allocation with the Minimum Overall Communication Costs in Distributed Database DesignXuemin Lin, Maria E. Orlowska, Yanchun Zhang. 539-544
- Chronolog (Z): Linear-Time Logic ProgrammingMehmet A. Orgun, William W. Wadge, Weichang Du. 545-549
- Eliminating Unnecessary Array Bounds Checks in Nests of LoopsKleanthis Psarris, David Klappholz. 550-554
- Multimedia Databases ModelingJean-François Merlet, Corinne Nadalin. 555-559
- Towards a Methodology for Developing a Federated Database SystemChristian Soutou. 560-564
- Modeling and Storage Allocation Strategies for Homogeneous Parallel Access Storage Devices in Real Time Multimedia Information ProcessingC. Y. Roger Chen, Kingsley C. Nwosu, P. Bruce Berra. 565-569
- Evaluating Partitioning Techniques for Main Memory Database: Horizontal and Single VerticalYu Chin Cheng, Le Gruenwald, Greg Ingels, M. T. Thakkar. 570-574
- An Entity-Relationship Approach to Schema EvolutionChien-Tsai Liu, Shi-Kuo Chang, Panos K. Chrysanthis. 575-578
- Consistency Management for Software Design Information RepositoryAtsuko Oka, Shuichiro Yamamoto, Sadahiro Isoda. 579-585