paredaens j (29 risultati)

Gebundene Ausgabe. Condizione: Gut. 261 Seiten ex Library Book aus einer wissenschafltichen Bibliothek Sprache: Englisch Gewicht in Gramm: 504.

X/231 S./pp., 53 Abbildungen (Illustrations), Originalpappband (publisher's cardboard covers), Bibliotheksexemplar in sehr gutem Zustand / exlibrary in excellent condition (Stempel auf Titel / title stamped, Rückenschildchen / lettering pannel to the spine, Block sehr gut / contents fine, keine Unterstreichungen oder Anstreichungen / no underlining or remarks, nicht in Folie eingeschlagen / not wrapped up in foil), (EATCS Monographs on Theoretical Computer Science 17), Sprache: englisch.

Condizione: As New. Unread book in perfect condition.

Condizione: OTTIMO USATO. Courses and Lectures INGLESE Volume n. 347 della serie Courses and Lectures a cura del Cism- International Centre for Mechanical Sciences. Brossura in cartoncino, plastificata ed in ottimo stato. Interno integro, ben saldo, con ampio margino e corredato da 99 illustrazioni nel testo, in bianco e nero. Numero pagine 377.

Condizione: New. In.

Paperback. Condizione: New.

Condizione: New.

Gebundene Ausgabe. Condizione: Gut. Gebraucht - Gut Sofortversand,übliche Markierungsstempel/Zeichen, Deckel und Rücken berieben und leicht fleckig, altersgemaesser Zustand, innen SEHR GUT.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. In.

Condizione: New. pp. 388.

Condizione: New. pp. 388.

Paperback. Condizione: Brand New. 1st edition. 377 pages. 9.50x6.75x1.00 inches. In Stock.

Condizione: New.

Condizione: New. pp. vi + 409.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The theory of data dependencies - An overview.- The VLSI revolution in theoretical circles.- Tuple sequences and indexes.- The complexity of cubical graphs.- P-generic sets.- Functional dependencies and disjunctive existence constraints in database relations with null values.- The algebra of recursively defined processes and the algebra of regular processes.- Algebraic specification of exception handling and error recovery by means of declarations and equations.- Building the minimal DFA for the set of all subwords of a word on-line in linear time.- The complexity and decidability of separation.- Concurrent transmissions in broadcast networks.- Linear searching for a square in a word.- Domain algebras.- Principality results about some matrix languages families.- Oriented equational clauses as a programming language.- Relational algebra operations and sizes of relations.- Some results about finite and infinite behaviours of a pushdown automaton.- On the relationship of CCS and petri nets.- Communicating finite state machines with priority channels.- A modal characterization of observational congruence on finite terms of CCS.- Communication complexity.- Space and time efficient simulations and characterizations of some restricted classes of PDAS.- A complete axiom system for algebra of closed-regular expression.- The complexity of finding minimum-length generator sequences.- On probabilistic tape complexity and fast circuits for matrix inversion problems.- On three-element codes.- Recursion depth analysis for special tree traversal algorithms.- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem.- Measures of presortedness and optimal sorting algorithms.- Languages and inverse semigroups.- Area-time optimal vlsi integer multiplierwith minimum computation time.- On the interpretation of infinite computations in logic programming.- A linear time algorithm to solve the single function coarsest partition problem.- Complexité des facteurs des mots infinis engendrés par morphismes itérés.- Automates boustrophedon, semi-groupe de birget et monoide inversif libre.- Probabilistic bidding gives optimal distributed resource allocation.- Partial order semantics versus interleaving semantics for CSP - like languages and its impact on fairness.- Cancellation, pumping and permutation in formal languages.- A hardware implementation of the CSP primitives and its verification.- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm.- Robust algorithms: A different approach to oracles.- Node weighted matching.- The propositional mu-calculus is elementary.- AVL-trees for localized search.- The simple roots of real-time computation hierarchies.- Computational complexity of an optical disk interface.- Encoding graphs by derivations and implications for the theory of graph grammars.- Sampling algorithms for differential batch retrieval problems (extended abstract).

Condizione: Acceptable. Used - Acceptable. Sticker on cover. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library with wear and barcode page may have been removed. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 388 | Sprache: Englisch | Produktart: Bücher | Advanced information technology is pervasive in any kind of human activity - science, business, finance, management and others - and this is particularly true for database systems. Both database theory and database applications constitute a very important part of the state of the art of computer science. Meanwhile there is some discrepancy between different aspects of database activity. Theoreticians are sometimes not much aware of the real needs of business and industry; software specialists not always have the time or the apportunity to get acquainted with the most recent theoretical ideas and trends, as well as with advanced prototypes arising from these ideas; potential users often do not have the possibility of evaluating the theoretical foundations and the potential practical impact of different commercial products. So the main goal of the course was to put together people involved in different aspects of database activity and to promote active exchange of ideas among them.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Advanced information technology is pervasive in any kind of human activity - science, business, finance, management and others - and this is particularly true for database systems. Both database theory and database applications constitute a very important part of the state of the art of computer science. Meanwhile there is some discrepancy between different aspects of database activity. Theoreticians are sometimes not much aware of the real needs of business and industry; software specialists not always have the time or the apportunity to get acquainted with the most recent theoretical ideas and trends, as well as with advanced prototypes arising from these ideas; potential users often do not have the possibility of evaluating the theoretical foundations and the potential practical impact of different commercial products. So the main goal of the course was to put together people involved in different aspects of database activity and to promote active exchange of ideas among them.

Taschenbuch. Condizione: Neu. Automata, Languages, and Programming | 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings | J. Paredaens | Taschenbuch | x | Englisch | 1984 | Springer | EAN 9783540133452 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Condizione: Neu. Advances in Database Systems | Implementations and Applications | L. Tenenbaum (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 1994 | Springer Vienna | EAN 9783211826140 | Verantwortliche Person für die EU: Springer Wien, Prinz-Eugen-Str. 8-10, 1040 WIEN, ÖSTERREICH, buchhandel-buch[at]springer[dot]com | Anbieter: preigu.

Paperback. Condizione: Brand New. 1984 edition. 535 pages. 9.25x6.10x1.22 inches. In Stock.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The theory of data dependencies ¿ An overview.- The VLSI revolution in theoretical circles.- Tuple sequences and indexes.- The complexity of cubical graphs.- P-generic sets.- Functional dependencies and disjunctive existence constraints in database relations with null values.- The algebra of recursively defined processes and the algebra of regular processes.- Algebraic specification of exception handling and error recovery by means of declarations and equations.- Building the minimal DFA for the set of all subwords of a word on-line in linear time.- The complexity and decidability of separation.- Concurrent transmissions in broadcast networks.- Linear searching for a square in a word.- Domain algebras.- Principality results about some matrix languages families.- Oriented equational clauses as a programming language.- Relational algebra operations and sizes of relations.- Some results about finite and infinite behaviours of a pushdown automaton.- On the relationship of CCS and petri nets.- Communicating finite state machines with priority channels.- A modal characterization of observational congruence on finite terms of CCS.- Communication complexity.- Space and time efficient simulations and characterizations of some restricted classes of PDAS.- A complete axiom system for algebra of closed-regular expression.- The complexity of finding minimum-length generator sequences.- On probabilistic tape complexity and fast circuits for matrix inversion problems.- On three-element codes.- Recursion depth analysis for special tree traversal algorithms.- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem.- Measures of presortedness and optimal sorting algorithms.- Languages and inverse semigroups.- Area-time optimal vlsi integer multiplier with minimum computation time.- On the interpretation of infinite computations in logic programming.- A linear time algorithm to solve the single function coarsest partition problem.- Complexit¿es facteurs des mots infinis engendr¿par morphismes it¿s.- Automates boustrophedon, semi-groupe de birget et monoide inversif libre.- Probabilistic bidding gives optimal distributed resource allocation.- Partial order semantics versus interleaving semantics for CSP ¿ like languages and its impact on fairness.- Cancellation, pumping and permutation in formal languages.- A hardware implementation of the CSP primitives and its verification.- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm.- Robust algorithms: A different approach to oracles.- Node weighted matching.- The propositional mu-calculus is elementary.- AVL-trees for localized search.- The simple roots of real-time computation hierarchies.- Computational complexity of an optical disk interface.- Encoding graphs by derivations and implications for the theory of graph grammars.- Sampling algorithms for differential batch retrieval problems (extended abstract). 540 pp. Englisch.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Advanced information technology is pervasive in any kind of human activity - science, business, finance, management and others - and this is particularly true for database systems. Both database theory and database applications constitute a very important part of the state of the art of computer science. Meanwhile there is some discrepancy between different aspects of database activity. Theoreticians are sometimes not much aware of the real needs of business and industry; software specialists not always have the time or the apportunity to get acquainted with the most recent theoretical ideas and trends, as well as with advanced prototypes arising from these ideas; potential users often do not have the possibility of evaluating the theoretical foundations and the potential practical impact of different commercial products. So the main goal of the course was to put together people involved in different aspects of database activity and to promote active exchange of ideas among them. 388 pp. Englisch.

Condizione: New. Print on Demand pp. 388 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Advanced information technology is pervasive in any kind of human activity - science, business, finance, management and others - and this is particularly true for database systems. Both database theory and database applications constitute a very important p.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The theory of data dependencies - An overview.- The VLSI revolution in theoretical circles.- Tuple sequences and indexes.- The complexity of cubical graphs.- P-generic sets.- Functional dependencies and disjunctive existence constraints in database relations with null values.- The algebra of recursively defined processes and the algebra of regular processes.- Algebraic specification of exception handling and error recovery by means of declarations and equations.- Building the minimal DFA for the set of all subwords of a word on-line in linear time.- The complexity and decidability of separation.- Concurrent transmissions in broadcast networks.- Linear searching for a square in a word.- Domain algebras.- Principality results about some matrix languages families.- Oriented equational clauses as a programming language.- Relational algebra operations and sizes of relations.- Some results about finite and infinite behaviours of a pushdown automaton.- On the relationship of CCS and petri nets.- Communicating finite state machines with priority channels.- A modal characterization of observational congruence on finite terms of CCS.- Communication complexity.- Space and time efficient simulations and characterizations of some restricted classes of PDAS.- A complete axiom system for algebra of closed-regular expression.- The complexity of finding minimum-length generator sequences.- On probabilistic tape complexity and fast circuits for matrix inversion problems.- On three-element codes.- Recursion depth analysis for special tree traversal algorithms.- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem.- Measures of presortedness and optimal sorting algorithms.- Languages and inverse semigroups.- Area-time optimal vlsi integer multiplierwith minimum computation time.- On the interpretation of infinite computations in logic programming.- A linear time algorithm to solve the single function coarsest partition problem.- Complexité des facteurs des mots infinis engendrés par morphismes itérés.- Automates boustrophedon, semi-groupe de birget et monoide inversif libre.- Probabilistic bidding gives optimal distributed resource allocation.- Partial order semantics versus interleaving semantics for CSP - like languages and its impact on fairness.- Cancellation, pumping and permutation in formal languages.- A hardware implementation of the CSP primitives and its verification.- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm.- Robust algorithms: A different approach to oracles.- Node weighted matching.- The propositional mu-calculus is elementary.- AVL-trees for localized search.- The simple roots of real-time computation hierarchies.- Computational complexity of an optical disk interface.- Encoding graphs by derivations and implications for the theory of graph grammars.- Sampling algorithms for differential batch retrieval problems (extended abstract).Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 540 pp. Englisch.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Advanced information technology is pervasive in any kind of human activity - science, business, finance, management and others - and this is particularly true for database systems. Both database theory and database applications constitute a very important part of the state of the art of computer science. Meanwhile there is some discrepancy between different aspects of database activity. Theoreticians are sometimes not much aware of the real needs of business and industry; software specialists not always have the time or the apportunity to get acquainted with the most recent theoretical ideas and trends, as well as with advanced prototypes arising from these ideas; potential users often do not have the possibility of evaluating the theoretical foundations and the potential practical impact of different commercial products. So the main goal of the course was to put together people involved in different aspects of database activity and to promote active exchange of ideas among them.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 388 pp. Englisch.