|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
b3243838 |
003 |
MWH |
005 |
20191024131257.0 |
007 |
cr nn 008mamaa |
008 |
121227s1983 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540387145
|
024 |
7 |
|
|a 10.1007/3-540-12727-5
|2 doi
|
035 |
|
|
|a (DE-He213)978-3-540-38714-5
|
050 |
|
4 |
|a E-Book
|
072 |
|
7 |
|a UM
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UM
|2 thema
|
072 |
|
7 |
|a UYF
|2 thema
|
245 |
1 |
0 |
|a CAAP '83
|h [electronic resource] :
|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.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 1983.
|
300 |
|
|
|a X, 418 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 159
|
490 |
1 |
|
|a Springer eBook Collection
|
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.
|
590 |
|
|
|a Loaded electronically.
|
590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
650 |
|
0 |
|a Computer logic.
|
690 |
|
|
|a Electronic resources (E-books)
|
700 |
1 |
|
|a Ausiello, G.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Protasi, M.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 159
|
830 |
|
0 |
|a Springer eBook Collection.
|
856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-12727-5
|3 Click to view e-book
|t 0
|
907 |
|
|
|a .b32438382
|b 04-18-22
|c 02-26-20
|
998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|
902 |
|
|
|a springer purchased ebooks
|
903 |
|
|
|a SEB-COLL
|
945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21570036
|z 02-26-20
|
999 |
f |
f |
|i 844a1076-01cb-51e5-adde-d1a16b7c7bb0
|s 3c4a8f08-5694-5727-941e-89033ee88750
|t 0
|
952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|