STACS 86
Springer Berlin (Verlag)
978-3-540-16078-6 (ISBN)
Abstract interpretation of denotational definitions.- Temporal reasoning under generalized fairness constraints.- Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples.- Some probabilistic powerdomains in the category SFP.- Ions and local definitions in logic programming.- Input sensitive, optimal parallel randomized algorithms for addition and identification.- A parallel statistical cooling algorithm.- Subgraph isomorphism for biconnected outerplanar graphs in cubic time.- Polynomial time algorithms for finding integer relations among real numbers.- New upperbounds for decentralized extrema-finding in a ring of processors.- Algorithms for visibility representations of planar graphs.- Speeding up random access machines by few processors.- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs.- On sparseness, ambiguity and other decision problems for acceptors and transducers.- Varietes de Semis Groupes et Mots Infinis.- Equations in free partially commutative monoids.- Separating and testing.- Decomposition de Fonctions Rationnelles.- Long unavoidable patterns.- Abstract implementations and correctness proofs.- Strictness and serializability.- Towards specification and proof of asynchronous systems.- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report).- Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata.- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ?-machines.- On sparse oracles separating feasible complexity classes.- On generalized kolmogorov complexity.- Area-time optimal division for T=?((logn)1+? ).- A time-spacetradeoff for element distinctness.- Parallel machines and their communication theoretical limits.
| Erscheint lt. Verlag | 1.12.1985 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 372 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 540 g |
| Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • Automata • Complexity • Computer • Logic • Monoid • Notation • Proof |
| ISBN-10 | 3-540-16078-7 / 3540160787 |
| ISBN-13 | 978-3-540-16078-6 / 9783540160786 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
