Advances in computing and information - ICCI '90 : International Conference on Computing and Information, Niagara Falls, Canada, May 23 26, 1990 : proceedings
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 application...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
468 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Advances in computing and information--ICCI '90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, proceedings, S.G. Akl, F. Fiala, W.W. Koczkodaj (eds.), Berlin, Springer-Verlag, 1990, 1 vol. (VII-529 p.), Lecture notes in computer science, 3-540-53504-7 • Advances in Computing and Information - ICCI '90, Texte imprimé, 9783662188903 |
Taula de continguts:
- Summaries of invited lectures
- The asymptotic evolution of data structures
- On the formal aspects of approximation algorithms
- Selected aspects of the calculus of self-modifiable algorithms theory
- Almost-everywhere complexity, bi-immunity and nondeterministic space
- Deriving deterministic prediction rules from reduction schemes
- Probabilistic analysis of set operations with constant-time set equality test
- Classification by minimum-message-length inference
- Fast left-linear semi-unification
- On the complexity of (off-line) 1-tape ATM's running in constant reversals
- A constant update time finger search tree
- Average case analysis of algorithms using matrix recurrences
- Finding two-tree-factor elements of tableau-defined monoids in time O(n 3)
- Toward a general theory of computation and specification over abstract data types
- Using the hamiltonian path operator to capture NP
- Some remarks on polynomial time isomorphisms
- An axiomatization of wait-freedom and low-atomicity
- The Gamma model as a functional programming tool
- Computing the transitive closure of symmetric matrices
- An environment for information system prototyping: A system simulation approach
- A logic-free method for modular composition of specifications
- On real-time program specification description with a data model-based language
- DINAS: Computer-assisted system for multi-criteria transportation and location analyses
- Logic programming for software testing
- Block concatenated code word surrogate file for partial match retrieval
- Applications development toolkits for environmental modelling and monitoring
- A hypertext for literate programming
- Ethics and computers: Can universities set the standards?
- Alternatives to the B+- tree
- Minimal perfect hashing for large sets of data
- Architectural classification and transaction execution models of multidatabase systems
- Semantic query optimization in distributed databases
- An architecture for a multimedia database management system supporting content search
- Adaptive expert systems and analogical problem solving
- The behavior of database concurrency control mechanisms under bursty arrivals
- The core concurrency
- Concurrent data structures
- Asynchronous functional parallel programs
- Symbolic configuration for SuperNode multiprocessors
- A model of execution time estimating for RPC-oriented programs
- Parallel computation of Longest-Common-Subsequence
- Parallel Breadth-first and Breadth-depth traversals of general trees
- Parallelism via speculation in pure Prolog
- Synthesis of error-recoverable protocol specifications from service specifications
- A parallel algorithm for path-min queries in trees
- Efficient deterministic parallel algorithms for integer sorting
- A model of communication in Ada using shared data abstractions
- Communication complexity of computing a collection of rational functions
- Electing a leader in a synchronous recursively scalable network
- Analysis of self-reconfigurating process of fault-tolerant distributed computing systems
- Control of bottlenecks in a network database machine
- A hierarchical multirate method for circuit simulation on parallel computers
- I/O overhead and parallel VLSI architectures for lattice computations
- Optimality of gauge and degree-sensitive VLSI layouts of planar graphs
- An efficient VLSI network bridge architecture for local area networks.