2. ICCI 1990: Niagara Falls, Canada

Summaries of Invited Lectures

• David Lorge Parnas:
  Education for Computing Professionals (Abstract). 2-3
• Jonas Aczél:
  Merging of Scores for Decision Making in Practice and Theory (Abstract). 4
• Michel Cosnard:
  Designing Parallel Algorithms for Transputer Networks (Abstract). 5
• Richard P. Hopkins:
  Distributed Computers: Object-vs. Unix-Based and Beyond (Abstract). 6
• Russell C. Kick:
  The Strategic Significance of Expert Systems: Opportunities and Risks (Abstract). 7
• Michael A. Langston:
  Time-Space Optimal Parallel Algorithms (Abstract). 8
• Jeretta Horn Nord, G. Daryl Nord:
  Executive Support Systems for Strategic Advance (Abstract). 9
• Maria E. Orlowska:
  On the Semantic Enhancement of Information Systems Design (Abstract). 10
• Zdzislaw Pawlak:
  Theory of Rough Sets: A New Methodology for Knowledge Discovery (Abstract). 11
• Barbara Simons:
  Is there Science and Technology (Funding) after the Cold War? 12

Theory of Computing, Algorithms and Programming

• Robert S. Maier:
  The Asymptotic Evolution of Data Structures. 14-23
  
• José D. P. Rolim:
  On the Formal Aspects of Approximation Algorithms. 24-33
  
• Eugeniusz Eberbach:
  Selected Aspects of the Calculus of Self-Modifiable Algorithms Theory. 34-43
  
• John G. Geske, Diane Kakihara:
  Almost-Everywhere Complexity, Bi-Immunity and Nondeterministic Space. 44-51
  
• Dafna Sheinwald, Richard C. Pasco:
  Deriving Deterministic Prediction Rules from Reduction Schemes. 52-61
  
• William Pugh:
  Probabilistic Analysis of Set Operations with Constant-Time Set Equality Test. 62-71
  
• Chris S. Wallace:
  Classification by Minimum-Message-Length Inference. 72-81
  
• Fritz Henglein:
  Fast Left-Linear Semi-Unification. 82-91
  
• Tao Jiang:
  On the Complexity of (Off-Line) 1-Tape ATM's Running in Constant Reversals. 92-99
  
• Paul F. Dietz, Rajeev Raman:
  A Constant Update Time Finger Search Tree. 100-109
  
• Ricardo A. Baeza-Yates, Gaston H. Gonnet:
  Average Case Analysis of Algorithms using Matrix Recurrences. 110-119
  
• Alois P. Heinz:
  Finding Two-Tree-Factor Elements of Tableau-Defined Monoids in Time O(n³). 120-128
  
• J. V. Tucker, Jeffery I. Zucker:
  Toward a General Theory of Computation and Specification over Abstract Data Types. 129-133
  
• Iain A. Stewart:
  Using the Hamiltonian Path Operator to Capture NP. 134-143
  
• Jie Wang:
  Some Remarks on Polynomial Time Isomorphisms. 144-153
  
• Ambuj K. Singh:
  An Axiomatization of Wait-Freedom and Low-Atomicity. 154-163
  
• R. Harrison, Hugh Glaser:
  The Gamma Model as a Functional Programming Tool. 164-173
  
• Anestis A. Toptsis, Clement T. Yu, Peter C. Nelson:
  Computing the Transitive Closure of Symmetric Matrices. 174-183
  

Data and Software Engineering

• Kung-Chao Liu:
  An Environment for Information System Prototyping: A System Simulation Approach. 186-195
  
• Victor Yodaiken:
  A Logic-Free Method for Modular Composition of Specifications. 196-205
  
• Katsumi Okamoto, Masaski Hashimoto:
  On Real-Time Program Specification Description with a Data Model-Based Language. 206-215
  
• Wlodzimierz Ogryczak, Krzysztof Studzinski, Krystian Zorychta:
  DINAS: Computer-Assisted System for Multi-Criteria Transportation and Location Analysis. 216-224
  
• Sanjeev Khanna:
  Logic Programming for Software Testing. 225-234
  
• Soon Myoung Chung:
  Block Concatenated Code Word Surrogate File for Partial Match Retrieval. 235-244
  
• David A. Swayne, John Storey, David C.-L. Lam, Isaac W. S. Wong, A. S. Fraser:
  Applications Development Toolkits for Environmental Modelling and Monitoring. 245-249
  
• M. Brown, Bogdan D. Czejdo:
  A Hypertext for Literate Programming. 250-259
  
• Gerhard Steinke, Gilbert Hamann:
  Ethics and Computers: Can Universities Set the Standards? 260-265
  
• William Boswell, Alan L. Tharp:
  Alternatives to the B+-Tree. 266-274
  
• Vincent G. Winters:
  Minimal Perfect Hashing For Large Sets of Data. 275-284
  
• M. Tamer Özsu, Ken Barker:
  Architectural Classification and Transaction Execution Models of Multidatabase Systems. 285-294
  
• H. J. A. van Kuijk, F. H. E. Pijpers, Peter M. G. Apers:
  Semantic Query Optimization in Distributed Databases. 295-303
  
• Vincent Y. Lum, Klaus Meyer-Wegener:
  An Architecture for a Multimedia Database Management System Supporting Content Search. 304-313
  
• H. Harry Zhou:
  Adaptive Expert Systems and Analogical Problem Solving. 314-323
  
• Jerry Place, Vijay Kumar, Appie van de Liefvoort:
  The Behavior of Database Concurrency Control Mechanisms under Bursty Arrivals. 324-333
  

Computer Architecture, Concurrency, Parallelism, Communication and Networking

• Piotr W. Prószynski:
  The Core Concurrency. 336-345
  
• Adrian Colbrook, Colin Smythe, David H. Pitt:
  Concurrent Data Structures. 346-355
  
• Jacques Julliand, Guy-René Perrin:
  Asynchronous Functional Parallel Programs. 356-365
  
• Jean-Marc Adamo, Christophe Bonello:
  Symbolic Configuartion for SuperNode Multiprocessors. 366-375
  
• Wanlei Zhou, Brian Molinari:
  A Model of Execution Time Estimating for RPC-Oriented Programs. 376-384
  
• Mi Lu:
  Parallel Computation of Longest-Common-Subsequence. 385-394
  
• Calvin Ching-Yuen Chen, Sajal K. Das:
  Parallel Breadth-First and Breadth-Depth Traversals of Generated Trees. 395-404
  
• Benjamin Yu:
  Parallelism via Speculation in Pure Prolog. 405-414
  
• Kassem Saleh, Robert L. Probert:
  Synthesis of Error-Recoverable Protocol Specifications from Service Specifications. 415-424
  
• Sung Kwon Kim:
  A Parallel Algorithm for Path-Min Queries in Trees. 425-432
  
• Lin Chen:
  Efficient Deterministic Parallel Algorithms for Integer Sorting. 433-442
  
• Chris D. Marlin, Michael Oudshoorn, Dennis Freidel:
  A Model of Communication in Ada using Shared Data Abstractions. 443-452
  
• Zhi-Quan Luo:
  Communication Complexity of Computing a Collection of Rational Functions. 453-462
  
• G. H. Masapati, Hasan Ural:
  Electing a Leader in a Synchronous Scalable Network. 463-472
  
• Jan R. Just:
  Analysis of Self-Reconfigurating Processes of Fault-Tolerant Distributed Computing Systems. 473-482
  
• T. Anthony Marsland, Liming Meng:
  Control Bottlenecks in a Network Database Mechine. 483-492
  
• Bernhard Klaassen:
  A Hierarchical Multirate Method for Circuit Simulation on Parallel Computers. 493-496
  
• Mark H. Nodine, Daniel P. Lopresti, Jeffrey Scott Vitter:
  I/O Overhead and Parallel VLSI Architectures for Lattice Computations. 497-506
  
• Deepak D. Sherlekar:
  Optimality of Gauge and Degree-Sensitive VLSI Layouts of Planar Graphs. 507-516
  
• Chandrabhan Chevli, Hee Yong Youn:
  An Efficient VLSI Network Bridge Architecture for Local Area Networks. 517-526