Automata, Languages and Programming: 17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings: Lecture Notes in Computer Science, cartea 443
Editat de Michael S. Patersonen Limba Engleză Paperback – 2 iul 1990
Din seria Lecture Notes in Computer Science
- 20% Preț: 1018.35 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 554.98 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 970.25 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 782.28 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 550.29 lei
- 20% Preț: 560.32 lei
- 20% Preț: 319.32 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 256.27 lei
- 20% Preț: 172.69 lei
- 20% Preț: 548.74 lei
- 20% Preț: 315.19 lei
- 20% Preț: 611.22 lei
- 20% Preț: 315.78 lei
- 20% Preț: 552.64 lei
- 20% Preț: 722.90 lei
- 20% Preț: 722.90 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.94 lei
- 20% Preț: 552.64 lei
- Preț: 389.31 lei
- 20% Preț: 564.99 lei
- 20% Preț: 724.49 lei
- 20% Preț: 552.64 lei
- 15% Preț: 549.86 lei
- 20% Preț: 331.82 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 634.85 lei
Preț vechi: 793.56 lei
-20% Nou
Puncte Express: 952
Preț estimativ în valută:
121.54€ • 131.69$ • 101.49£
121.54€ • 131.69$ • 101.49£
Carte tipărită la comandă
Livrare economică 12-26 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540528265
ISBN-10: 3540528261
Pagini: 800
Ilustrații: XII, 788 p.
Dimensiuni: 155 x 235 x 42 mm
Greutate: 1.1 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540528261
Pagini: 800
Ilustrații: XII, 788 p.
Dimensiuni: 155 x 235 x 42 mm
Greutate: 1.1 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
LEDA: A library of efficient data types and algorithms.- A new universal class of hash functions and dynamic hashing in real time.- A complete and decidable proof system for call-by-value equalities.- Static correctness of hierarchical procedures.- Generic terms having no polymorphic types.- A complete system of B-rational identities.- On non-counting regular classes.- Two-way automata with multiplicity.- ?-Continuous semirings, algebraic systems and pushdown automata.- Nondeterministic computations in sublogarithmic space and space constructibility.- Normalizing and accelerating RAM computations and the problem of reasonable space measures.- A formal study of learning via queries.- Language learning by a “team”.- Functions as processes.- A domain-theoretic model for a higher-order process calculus.- Concurrency, automata and domains.- A theory of communicating processes with value-passing.- Analytic variations on the common subexpression problem.- Can a maximum flow be computed in o(nm) time?.- On the distributional complexity of disjointness.- Computing boolean functions on anonymous networks.- On the composition of zero-knowledge proof systems.- Additional queries to random and pseudorandom oracles.- Communication among relations.- Stability and sequentiality in dataflow networks.- Automata for modeling real-time systems.- Markov decision processes and regular events.- Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond.- Nonoblivious normalization algorithms for nonlinear rewrite systems.- Algebraic properties of idempotent substitutions.- Determining the separation of preprocessed polyhedra — A unified approach.- Randomized incremental construction of delaunay and Voronoi diagrams.- Merging free trees in parallel for efficient voronoidiagram construction.- Local optimization and the Traveling Salesman Problem.- Polynomial-time approximation algorithms for the ising model.- On parallelizing graph-partitioning heuristics.- Iterated substitutions and locally catenative systems: a decidability result in the binary case.- Decomposition of partial commutations.- Boolean closure and unambiguity of rational sets.- Compositionality through an operational semantics of contexts.- Structural and behavioural equivalences of networks.- Proving partial order liveness properties.- A proof system for the parallel object-oriented language POOL.- A new approach to maximum matching in general graphs.- On-line graph algorithms with SPQR-trees.- On the bit-complexity of discrete solutions of PDEs: Compact multigrid.- An efficient algorithm for branching bisimulation and stuttering equivalence.- Partial evaluation, self-application and types.- Provable computable functions on abstract data types.- Equational formulas in order-sorted algebras.- An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal.- Approximation of convex polygons.- On the rectilinear art gallery problem.- On parallel hashing and integer sorting.- The parallel simplicity of compaction and chaining.- The importance of the left merge operator in process algebras.- Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming.