ICCI 1993: Sudbury, Ontario, Canada
Osman Abou-Rabia, Carl K. Chang, Waldemar W. Koczkodaj (Eds.): Computing and Information - ICCI'93, Fifth International Conference on Computing and Information, Sudbury, Ontario, Canada, May 27-29, 1993, Proceedings. IEEE Computer Society 1993 ISBN 0-8186-4212-2
Algorithms and Complexity
- David W. Krumme: Algorithms and Complexity - Introduction. 2
- Dung T. Huynh, Lu Tian: On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes. 3-7
- Vladimir Estivill-Castro, Derick Wood: An Adaptive Generic Sorting Algorithm That Uses Variable Partitioning. 8-12
- Kevin E. Flannery: Lambda-Calculi with Decidable Cappa-Type Checking. 13-19
- Mariana Kant: The Synthesis of Two Compatible Rooted Trees in a Rooted Supertree by an Algorithm on Sets. 20-25
- Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi: Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs. 26-30
- Dipti S. Joshi, R. Sridhar, N. Chandrasekharan: Efficient Algorithms for All-Pairs Shortest Path Problem on Interval, Directed Path, and Circular-Arc Graphs. 31-35
- Kenneth W. Regan: On the Difference Between Turing Machine Time and Random-Access Machine Time. 36-40
- H. K. Dai: Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators. 41-47
- H. K. Dai: The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth. 48-54
- Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang: Selectivity. 55-59
- Kok-Phuang Tan, Ghim Hwee Ong, Seng Chuan Tay: An O(n log2 n) Hybrid Sorting Algorithm on 2-D Grid. 60-64
- Huade Li, Francis Suraweera: Far Field Path Planning for Rotorcraft NOE Missions in a Mountainous Region. 65-70
- Michael Oudshoorn, Chris D. Marlin: Interpretive Language Implementation from a Layered Operational Model. 71-76
- Elias Dahlhaus: An Efficient Parallel Recognition Algorithm of Parity Graphs. 82-86
- James Abello, Krishna Kumar, Ömer Egecioglu: A Combinatorial View of Visibility Graphs of Simple Polygons. 87-92
Distributed Computing
- David W. Krumme: Distributed Computing - Introduction. 110
- Keizo Kawata, Akira Takura, Tadashi Ohta: On a Communication Software Generation Method from Communication Service Specifications Described by a Declarative Language. 116-122
- Richard T. Hurley, Soon Aun Yeap, J. W. Wong, James P. Black: Potential Benefits of File Migration in a Heterogeneous Distributed File System. 123-127
- Andrew F. Watts, David H. Pitt, Colin Smythe: Object Oriented Specification of Multi-Layered Protocols. 133-139
- Osman ZeinElDine, Mohamed Eltoweissy, Hussein M. Abdel-Wahab: BUS: A Multicasting Protocol for Interconnected LANs. 140-144
- Siu-Cheung Chau: On Implementing Large Fault-Tolerant Binary Tree Architecture in WSI. 145-149
- X. Li, Richard Lai, Tharam S. Dillon: A New Decomposition Method to Relieve the State Space Explosion Problem. 150-154
- Dung T. Huynh, Hai N. Nguyen: On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices. 155-159
- Vaidy S. Sunderam: DCL: Protocols and Primitives for Distributed and Concurrent Computing in Networked Environments. 160-164
- James Z. Zhou, Masaaki Mizuno, Gurdip Singh: A Sequentially Consistent Distributed Shared Memory. 165-169
- James W. Hong, Michael A. Bauer, John A. O'Neill: Design and Implementation of a Distributed Applications Testbed. 170-174
- Shun Yan Cheung, Vaidy S. Sunderam: Performance of Barrier Synchronization Methods in a Multi-Access Network. 175-179
- Sridhar Hannenhalli, Kalyan S. Perumalla, N. Chandrasekharan, R. Sridhar: A Distributed Algorithm for Ear Decomposition. 180-184
- Ismail H. Toroslu, Lawrence J. Henschen: An Efficient Transitive Closure Algorithm for Distributed Databases. 185-189
- Bernard Cousin: Differential Hashing Functions: Application to Reachability Graph Generation. 190-194
- Dag Johansen: A Distributed Approach to the Design of Applications. 195-201
- Constantine Stivaros: Solvable Classes for Reliable Network Allocation. 207-211
Concurrency and Parallelism
- Michael A. Langston: Concurrency and Parallelism - Introduction. 214
- Christophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo: An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. 220-224
- Ivan Stojmenovic: Job Simulation Techniques on Incomplete and Gray Code Incomplete Hypercubes. 225-229
- Eric E. Johnson: Independent Performance Modeling of Parallel Architectures and Algorithms. 230-234
- Weichang Du: Context Parallelism in an Indexical Programming Language. 235-239
- Shi-Jinn Horng: Parallel Compting Dominators on Hypercube Multiprocessors. 240-243
- Dominique Bolignano, Mourad Debbabi: A Denotational Model for the Integration of Concurrent, Functional, and Imperative Programming. 244-250
- Dawn N. Jutla, Peter Bodorik, J. Spruce Riordon: Integrated Concurrency-Coherence Control in Distributed Shared Memory. 251-255
- Dipak Pravin Doctor, Ivan Hal Sudborough: Parallel Algorithm for Quadtree Medial Axis Transform. 266-271
- Tahany A. Fergany, Reda A. Ammar, Mohamad R. Neilforoshan-Dardashti: Optimizing the Time Cost of the Parallel Structures with a Limited Number of Processors. 272-276
- Anestis A. Toptsis: B**-Tree: A Data Organization Method for High Storage Utilization. 277-281
- Anestis A. Toptsis: B***-Tree: A Family of Efficient Data Packaging Multiway Trees. 282-286
Artificial Intelligence
- Jerzy W. Grzymala-Busse: Artificial Intelligence - Introduction. 288
- Pawan Lingras: Combination of Evidence in Rough Set Theory. 289-293
- Frank Ng, Gregory Butler: Specialised Theorem-Proving in an Intelligent Tutoring System for the Dijkstra-Gries Programming Methodology. 294-298
- Shie-Jue Lee, Chih-Hung Wu: Improving Efficiency of a Theorem Prover by Eliminating Redundant Unifications Using Network Structures. 299-304
- Vladimir Estivill-Castro: The Design of Competitive Algorithms via Genetic Algorithms. 305-309
- Sylvain Delisle, Terry Copeck, Stan Szpakowicz, Ken Barker: Pattern Matching for Case Analysis: A Computational Definition of Closeness. 310-315
- Eugeniusz Eberbach, Piotr W. Prószynski: The CSA Approach to Knowledge Representation in Neural Networks. 327-331
- John Brady: Structural and Behavioral Representations in Roget's International Thesaurus. 344-348
- Rajiv Bagai, Vasant Shanbhogue, Jan M. Zytkow, Shang-Ching Chou: Discovery of Geometry Theorems: Avoiding Isomorphic Situation Descriptions. 354-358
- James Abello, Anne Houang, James Russell: A Hierarchy of Pattern Recognition Algorithms for the Diagnosis of Sucker Rod Pumped Wells. 359-364
- Y. Y. Yao: Interval-Set Algebra for Qualitative Knowledge Representation. 370-374
- Nga Kwo Liu: Formal Description and Verification of Knowledge Base Redundancy and Subsumption. 385-389
Software Engineering and Information Technology
- Pradip K. Srimani: Software Engineering and Information Technology - Introduction. 392
- Martin Boogaard, Jonas M. de Graaff, René J. Veldwijk: Why Views Do Not Provide Logical Data Independence. 393-397
- Martin Lefering: A Framework for Incremental Integration Tools. 398-402
- Christos Bouras, Paul G. Spirakis: The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases. 403-407
- Jian Yang, Mike P. Papazoglou: Case-Based Reasoning Methodology for Analyzing Multi-Database Schemas. 408-412
- Lilian Harada, Naoki Akaboshi: Evaluation of Linear Join Processing Trees in Shared-Nothing Database Environment. 413-417
- Bogdan D. Czejdo, Ralph P. Tucci, David W. Embley, Stephen W. Liddle: Graphical Query Specification with Participation Constraints. 433-437
- Soon Myoung Chung, Khalid A. Elghayesh: A Timestamp-Based Concurrency Control Algorithm for Heterogeneous Distributed Databases. 438-442
- Jian-Yun Nie, François Paradis, Jean G. Vaucher: Using Information Retrieval for Software Reuse. 448-452
- Daniel K. C. Chan, David J. Harper, Philip W. Trinder: An Object-Oriented Data Model Specification. 453-457
- Mohamed Eltoweissy, Hussein M. Abdel-Wahab, M. Abougabal, Nagwa M. El-Makky, Souheir A. Fouad: Performance Analysis of Time-Stamp Ordering Algorithms in Database Systems: The Pure Restarts Case. 458-463
- Guttorm Sindre, Even-André Karlsson, Tor Stålhane: A Method for Software Reuse Through Large Component Libraries. 464-468
- Anneliese von Mayrhauser, A. Marie Vans: From Code Comprehension Model to Tool Capabilities. 469-473
- Robert B. France, Thomas W. G. Docker: Towards CASE Tool Support for Rigorous Structured Analysis. 474-478
- Hee Beng Kuan Tan, Tok Wang Ling, Yin Seong Ho: Improving the Reusability of Program Specification Through Data Flow Modeling. 479-483
- Franco Arcieri, Stefano Ercoli, Enrico Nardelli: The GeoSQL Language for the Manipulation of Geographical Data. 484-490
- Xiaofang Zhou, Maria E. Orlowska: Parallel Naive and Semi-Naive Transitive Closure Evaluation. 497-501
- Barry Eaglestone, G. L. Davies, T. Ungvary: An Extended Version Model for Artistic Design Applications. 502-506
- M. R. Girardi, Bertrand Ibrahim: A Software Reuse System Based on Natural Language Specifications. 507-511
- Mohand Boughanem, Redouane Layaida, Armand Caron: A Neural Network Model for Documentary Base Self-Organising and Querying. 512-518
- Aarthi Prasad, E. K. Park: AI-Based Classification and Retrieval of Reusable Software Components. 519-523
- Paul A. Bailes, Dan B. Johnston, Eric J. Salzman: Preprocessing First-Class Functions for Ada. 524-528
- Jean-Pierre Corriveau, Bill Macready: On Driving and Monitoring Smalltalk-80 Applications Using Unix Spreadsheets. 534-538
- Xuemin Lin, Maria E. Orlowska, Yanchun Zhang: On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design. 539-544
- Mehmet A. Orgun, William W. Wadge, Weichang Du: Chronolog (Z): Linear-Time Logic Programming. 545-549
- Kleanthis Psarris, David Klappholz: Eliminating Unnecessary Array Bounds Checks in Nests of Loops. 550-554
- Christian Soutou: Towards a Methodology for Developing a Federated Database System. 560-564
- C. Y. Roger Chen, Kingsley C. Nwosu, P. Bruce Berra: Modeling and Storage Allocation Strategies for Homogeneous Parallel Access Storage Devices in Real Time Multimedia Information Processing. 565-569
- Yu Chin Cheng, Le Gruenwald, Greg Ingels, M. T. Thakkar: Evaluating Partitioning Techniques for Main Memory Database: Horizontal and Single Vertical. 570-574
- Chien-Tsai Liu, Shi-Kuo Chang, Panos K. Chrysanthis: An Entity-Relationship Approach to Schema Evolution. 575-578
- Atsuko Oka, Shuichiro Yamamoto, Sadahiro Isoda: Consistency Management for Software Design Information Repository. 579-585
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team