- 0 Ergebnisse
Kleinster Preis: € 2,26, größter Preis: € 150,79, Mittelwert: € 33,41
1
Automata, Languages and Programming : 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings
Bestellen
bei BetterWorldBooks.com
€ 3,98
Bestellen
gesponserter Link

Automata, Languages and Programming : 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings - gebrauchtes Buch

1996, ISBN: 9783540614401

This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP i… Mehr…

used in stock. Versandkosten:plus shipping costs., zzgl. Versandkosten
2
Bestellen
bei AbeBooks.com
$ 2,45
(ca. € 2,26)
Versand: € 4,001
Bestellen
gesponserter Link

Friedhelm Meyer auf der Heide, Burkhard Monien:

Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings (Lecture Notes in Computer Science v. 1099) - Taschenbuch

1996, ISBN: 3540614400

[EAN: 9783540614401], Used, good, [PU: Springer], COMPUTER, 680 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically… Mehr…

NOT NEW BOOK. Versandkosten: EUR 4.00 Zubal-Books, Since 1961, Cleveland, OH, U.S.A. [581] [Rating: 5 (of 5)]
3
Bestellen
bei Biblio.co.uk
$ 2,45
(ca. € 2,26)
Versand: € 3,681
Bestellen
gesponserter Link
Friedhelm Meyer auf der Heide, Burkhard Monien:
Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings (Lecture Notes in Computer Science v. 1099) - Taschenbuch

1996

ISBN: 9783540614401

Springer, 1996. 680 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once… Mehr…

Versandkosten: EUR 3.68 Zubal Books
4
Bestellen
bei Indigo.ca
C$ 206,95
(ca. € 150,79)
Bestellen
gesponserter Link
Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings - neues Buch

ISBN: 9783540614401

Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings Books > Computers > Computer Science List_Books, [PU: Spri… Mehr…

new in stock. Versandkosten:plus shipping costs., zzgl. Versandkosten
5
Bestellen
bei Biblio.co.uk
$ 8,42
(ca. € 7,75)
Versand: € 0,001
Bestellen
gesponserter Link
Editor-Friedhelm Meyer auf der Heide; Editor-Burkhard Monien:
Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings (Lecture Notes in Computer Science) - Taschenbuch

1996, ISBN: 9783540614401

Springer, 1996-01-15. Paperback. Good., Springer, 1996-01-15, 2.5

Versandkosten:Free shipping. (EUR 0.00) Ergodebooks

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
Details zum Buch
Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings

This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS).The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures...

Detailangaben zum Buch - Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings


EAN (ISBN-13): 9783540614401
ISBN (ISBN-10): 3540614400
Taschenbuch
Erscheinungsjahr: 1996
Herausgeber: Springer Berlin
700 Seiten
Gewicht: 1,040 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-29T12:49:59+02:00 (Berlin)
Detailseite zuletzt geändert am 2022-04-14T04:28:23+02:00 (Berlin)
ISBN/EAN: 3540614400

ISBN - alternative Schreibweisen:
3-540-61440-0, 978-3-540-61440-1


Daten vom Verlag:

Autor/in: Friedhelm Meyer auf der Heide; Burkhard Monien
Titel: Lecture Notes in Computer Science; Automata, Languages and Programming - 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings
Verlag: Springer; Springer Berlin
684 Seiten
Erscheinungsjahr: 1996-06-26
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Gewicht: 2,130 kg
Sprache: Englisch
123,04 € (DE)
126,49 € (AT)
153,65 CHF (CH)
POD
XII, 684 p.

BC; Book; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; algorithms; automata; combinatorics on words; complexity; complexity theory; computer; computer science; data structures; logic; programming; combinatorics; C; Theory of Computation; Software Engineering/Programming and Operating Systems; Data Structures; Combinatorics; Theory of Computation; Software Engineering; Data Science; Discrete Mathematics; Computer Science; Software Engineering; Datenbanken; Diskrete Mathematik; EA

Saturation-based theorem proving (abstract).- Bandwidth efficient parallel computation.- Variable-length maximal codes.- Lower bounds for prepositional proofs and independence results in bounded arithmetic.- Algebraic characterizations of decorated trace equivalences over tree-like structures.- Fast asynchronous systems in dense time.- A hierarchy theorem for the ?-calculus.- An effective tableau system for the linear time ?-calculus.- Characterizing fairness implementability for multiparty interaction.- Termination of context-sensitive rewriting by rewriting.- A complete gentzen-style axiomatization for set constraints.- Fatal errors in conditional expressions.- Different types of arrow between logical frameworks.- Effective models of polymorphism, subtyping and recursion (extended abstract).- Regularity for a large class of context-free processes is decidable.- On infinite transition graphs having a decidable monadic theory.- Semi-groups acting on context-free graphs.- Hard sets method and semilinear reservoir method with applications.- Random polynomials and polynomial factorization.- Optimal gröbner base algorithms for binomial ideals.- Minimum fill-in on circle and circular-arc graphs.- Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs.- Searching a fixed graph.- Improved sampling with applications to dynamic graph algorithms.- The expressive power of existential first order sentences of büchi's sequential calculus.- Fixpoints for rabin tree automata make complementation easy.- New upper bounds to the limitedness of distance automata.- Recognizing regular expressions by means of dataflow networks.- On the power of randomized branching programs.- Hitting sets derandomize BPP.- On type-2 probabilistic quantifiers.- Speeding-up single-tape nondeterministic computations by single alternation, with separation results.- On ?-generators and codes.- On standard Sturmian morphisms.- Constructions and bounds for visual cryptography.- On capital investment.- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication.- Lower bounds for row minima searching.- On the complexity of relational problems for finite state processes.- Deciding finiteness of Petri nets up to bisimulation.- Mobile processes with a distributed environment.- The meaning of negative premises in transition system specifications II.- Average case analyses of list update algorithms, with applications to data compression.- Self-organizing data structures with dependent accesses.- Lopsided trees: Analyses, algorithms, and applications.- Optimal logarithmic time randomized suffix tree construction.- Improved parallel approximation of a class of integer programming problems.- Efficient collective communication in optical networks.- Shared-memory simulations on a faulty-memory DMM.- Fast deterministic backtrack search.- Agent rendezvous: A dynamic symmetry-breaking problem.- Efficient asynchronous consensus with the value-oblivious adversary scheduler.- A formal framework for evaluating heuristic programs.- Improved scheduling algorithms for minsum criteria.- On the complexity of string folding.- A polynomial-time algorithm for near-perfect phylogeny.

< zum Archiv...