This volume contains selected and invited papers presented at the International Conference on Computing and Information, ICCI '90, Niagara Falls, Ontario, Canada, May 23-26, 1990. ICCI conferences provide an international forum for presenting new results in research, development and applications in computing and information. Their primary goal is to promote an interchange of ideas and cooperation between practitioners and theorists in the interdisciplinary fields of computing, communication and information theory. The four main topic areas of ICCI '90 are: - Information and coding theory, statistics and probability, - Foundations of computer science, theory of algorithms and programming, - Concurrency, parallelism, communications, networking, computer architecture and VLSI, - Data and software engineering, databases, expert systems, information systems, decision making, and AI methodologies.
Author(s): S. G. Akl, F. Fiala, W. W. Koczkodaj (eds.)
Series: Lecture Notes in Computer Science 468
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1990
Language: English
Pages: 438
Tags: Models and Principles; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Coding and Information Theory; Programming Techniques; Software Engineering
Summaries of invited lectures....Pages 1-12
The asymptotic evolution of data structures....Pages 13-23
On the formal aspects of approximation algorithms....Pages 24-33
Selected aspects of the calculus of self-modifiable algorithms theory....Pages 34-43
Almost-everywhere complexity, bi-immunity and nondeterministic space....Pages 44-51
Deriving deterministic prediction rules from reduction schemes....Pages 52-61
Probabilistic analysis of set operations with constant-time set equality test....Pages 62-71
Classification by minimum-message-length inference....Pages 72-81
Fast left-linear semi-unification....Pages 82-91
On the complexity of (off-line) 1-tape ATM's running in constant reversals....Pages 92-99
A constant update time finger search tree....Pages 100-109
Average case analysis of algorithms using matrix recurrences....Pages 110-119
Finding two-tree-factor elements of tableau-defined monoids in time O( n 3 )....Pages 120-128
Toward a general theory of computation and specification over abstract data types....Pages 129-133
Using the hamiltonian path operator to capture NP....Pages 134-143
Some remarks on polynomial time isomorphisms....Pages 144-153
An axiomatization of wait-freedom and low-atomicity....Pages 154-163
The Gamma model as a functional programming tool....Pages 164-173
Computing the transitive closure of symmetric matrices....Pages 174-183
An environment for information system prototyping: A system simulation approach....Pages 185-195
A logic-free method for modular composition of specifications....Pages 196-205
On real-time program specification description with a data model-based language....Pages 206-215
DINAS: Computer-assisted system for multi-criteria transportation and location analyses....Pages 216-224
Logic programming for software testing....Pages 225-234
Block concatenated code word surrogate file for partial match retrieval....Pages 235-244
Applications development toolkits for environmental modelling and monitoring....Pages 245-249
A hypertext for literate programming....Pages 250-259
Ethics and computers: Can universities set the standards?....Pages 260-265
Alternatives to the B + - tree....Pages 266-274
Minimal perfect hashing for large sets of data....Pages 275-284
Architectural classification and transaction execution models of multidatabase systems....Pages 285-294
Semantic query optimization in distributed databases....Pages 295-303
An architecture for a multimedia database management system supporting content search....Pages 304-313
Adaptive expert systems and analogical problem solving....Pages 314-323
The behavior of database concurrency control mechanisms under bursty arrivals....Pages 324-333
The core concurrency....Pages 335-345
Concurrent data structures....Pages 346-355
Asynchronous functional parallel programs....Pages 356-365
Symbolic configuration for SuperNode multiprocessors....Pages 366-375
A model of execution time estimating for RPC-oriented programs....Pages 376-384
Parallel computation of Longest-Common-Subsequence....Pages 385-394
Parallel Breadth-first and Breadth-depth traversals of general trees....Pages 395-404
Parallelism via speculation in pure Prolog....Pages 405-414
Synthesis of error-recoverable protocol specifications from service specifications....Pages 415-424
A parallel algorithm for path-min queries in trees....Pages 425-432
Efficient deterministic parallel algorithms for integer sorting....Pages 433-442
A model of communication in Ada using shared data abstractions....Pages 443-452
Communication complexity of computing a collection of rational functions....Pages 453-462
Electing a leader in a synchronous recursively scalable network....Pages 463-472
Analysis of self-reconfigurating process of fault-tolerant distributed computing systems....Pages 473-482
Control of bottlenecks in a network database machine....Pages 483-492
A hierarchical multirate method for circuit simulation on parallel computers....Pages 493-496
I/O overhead and parallel VLSI architectures for lattice computations....Pages 497-506
Optimality of gauge and degree-sensitive VLSI layouts of planar graphs....Pages 507-516
An efficient VLSI network bridge architecture for local area networks....Pages 517-526
