9783540160786 - stacs 86: 3rd annual symposium on theoretical aspects of computer science - orsay, france, january 16-18, 1986 (lecture notes in computer science, 210, band 210) von vidal-naquet, g.; monien, b. (3 Ergebnisse)
- Softcover
Anbieter: Better World Books, Mishawaka, IN, USABetter World Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 44,99
Versand nach gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 45,47
EUR 14,11 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 37,44
EUR 62,91 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
