|
|
|
|
| LEADER |
02610nmm a2200277 u 4500 |
| 001 |
EB000654532 |
| 003 |
EBX01000000000000001349058 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540387145
|
| 100 |
1 |
|
|a Ausiello, G.
|e [editor]
|
| 245 |
0 |
0 |
|a CAAP '83
|h Elektronische Ressource
|b Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings
|c edited by G. Ausiello, M. Protasi
|
| 250 |
|
|
|a 1st ed. 1983
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1983, 1983
|
| 300 |
|
|
|a X, 418 p
|b online resource
|
| 505 |
0 |
|
|a Generalized heterogeneous algebras and partial interpretations -- Applicative information systems -- Acyclic database schemes (of various degrees): A painless introduction -- Efficient algorithms for finding maximal matching in graphs -- A survey of NLC grammars -- Prefix and perfect languages -- Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets -- VLSI mesh of trees for data base processing -- Continuite des transducteurs d'etats finis d'arbres -- Completeness results for a polymorphic type system -- A class of program schemes based on tree rewriting systems -- Complete sets of unifiers and matchers in equational theories -- Digital search trees and the generation of an exponentially distributed variate -- Decidable properties of monadic recursive schemas with a depth parameter -- Nivat-processing systems: Decision problems related to protection and synchronization -- Confluent and coherent equational term rewriting systems application to proofs in abstract data types -- An application of maximum bipartite c-matching to subtree isomorphism' -- Characterizing specification languages which admit initial semantics -- Topological bandwidth -- Probabilistic analysis of graph colouring algorithms -- Some further approximation algorithms for the vertex cover problem -- An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes -- Remarks on the pyramidal structure -- Structured theories in LCF -- Alternating tree automata -- Cofinality in reduction graphs
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Computer science
|
| 700 |
1 |
|
|a Protasi, M.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-12727-5
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-12727-5?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|