2. ICCI 1990: Niagara Falls, Canada

Selim G. Akl, Frantisek Fiala, Waldemar W. Koczkodaj (Eds.): Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings. Lecture Notes in Computer Science 468 Springer 1990, ISBN 3-540-53504-7 BibTeX

@proceedings{DBLP:conf/icci/1990,
  editor    = {Selim G. Akl and
               Frantisek Fiala and
               Waldemar W. Koczkodaj},
  title     = {Advances in Computing and Information - ICCI'90, International
               Conference on Computing and Information, Niagara Falls, Canada,
               May 23-26, 1990, Proceedings},
  booktitle = {ICCI},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {468},
  year      = {1990},
  isbn      = {3-540-53504-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Summaries of Invited Lectures

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

Theory of Computing, Algorithms and Programming

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

Data and Software Engineering

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

Computer Architecture, Concurrency, Parallelism, Communication and Networking

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