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

EAN (ISBN-13): 9783540614401
ISBN (ISBN-10): 3540614400
Livre de poche
Date de parution: 1996
Editeur: Springer Berlin Heidelberg
700 Pages
Poids: 1,040 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-05-29T12:49:59+02:00 (Zurich)
Page de détail modifiée en dernier sur 2024-03-31T10:32:21+02:00 (Zurich)
ISBN/EAN: 3540614400

ISBN - Autres types d'écriture:
3-540-61440-0, 978-3-540-61440-1
Autres types d'écriture et termes associés:
Auteur du livre: meyer, monien, auf der, friedhelm, heide heide, burkhard
Titre du livre: july july, michaels kloster paderborn, proceedings the international colloquium language, automata languages and programming, who who germany, was paderborn, lecture notes computer science automata

---

Données de l'éditeur

Auteur: Friedhelm Meyer auf der Heide; Burkhard Monien
Titre: Lecture Notes in Computer Science; Automata, Languages and Programming - 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings
Editeur: Springer; Springer Berlin
684 Pages
Date de parution: 1996-06-26
Berlin; Heidelberg; DE
Langue: Anglais
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XII, 684 p.

BC; 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; Theory of Computation; Software Engineering; Data Science; Discrete Mathematics; 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 probabilisticquantifiers.- 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.