STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings - pocketboek

EAN (ISBN-13): 9783540626169
ISBN (ISBN-10): 3540626166
pocket book
Verschijningsjaar: 1997
Uitgever: Springer Berlin Heidelberg
636 Bladzijden
Gewicht: 0,947 kg
Taal: eng/Englisch

Boek bevindt zich in het datenbestand sinds 2007-02-18T19:12:12+01:00 (Amsterdam)
Detailpagina laatst gewijzigd op 2024-02-19T09:57:49+01:00 (Amsterdam)
ISBN/EAN: 3540626166

ISBN - alternatieve schrijfwijzen:
3-540-62616-6, 978-3-540-62616-9
alternatieve schrijfwijzen en verwante zoekwoorden:
Auteur van het boek: ger, diger, morvan, reischuk rüdiger, michel rudi, reisch
Titel van het boek: lübeck, berlin, annual symposium theoretical aspects computer science, lecture notes computer science, beck, germany, ufo symposium, von der march

---

Gegevens van de uitgever

Auteur: Rüdiger Reischuk; Michel Morvan
Titel: Lecture Notes in Computer Science; STACS 97 - 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings
Uitgeverij: Springer; Springer Berlin
621 Bladzijden
Verschijningsjaar: 1997-02-21
Berlin; Heidelberg; DE
Gedrukt / Gemaakt in
Gewicht: 1,940 kg
Taal: Engels
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
XV, 621 p.

BC; Theory of Computation; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; algorithm; algorithms; automata; complexity; computational geometry; computer science; data structure; data structures; distributed systems; formal language; formal languages; logic; semantics; verification; Programming Techniques; Programming Languages, Compilers, Interpreters; Discrete Mathematics in Computer Science; Theory of Computation; Programming Techniques; Compilers and Interpreters; Discrete Mathematics in Computer Science; Computerprogrammierung und Softwareentwicklung; Compiler und Übersetzer; Mathematik für Informatiker; Diskrete Mathematik; EA

Unifying models.- Predecessor queries in dynamic integer sets.- Semi-dynamic shortest paths and breadth-first search in digraphs.- Greibach normal form transformation, revisited.- Translating regular expressions into small ?-free nondeterministic finite automata.- Memory management for Union-Find algorithms.- Fast online multiplication of real numbers.- The operators min and max on the polynomial hierarchy.- Resource-bounded kolmogorov complexity revisited.- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations.- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes.- MODp-tests, almost independence and small probability spaces.- Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification.- Temporal logics for the specification of performance and reliability.- Efficient scaling-invariant checking of timed bisimulation.- Gossiping and broadcasting versus computing functions in networks.- On the descriptive and algorithmic power of parity ordered binary decision diagrams.- A reducibility concept for problems defined in terms of ordered binary decision diagrams.- On the classification of computable languages.- A conditional-logical approach to minimum cross-entropy.- Undecidability results on two-variable logics.- Methods and applications of (max,+) linear algebra.- Regular expressions and context-free grammars for picture languages.- Measuring nondeterminism in pushdown automata.- On polynomially D verbose sets.- A downward translation in the polynomial hierarchy.- Strict sequential P-completeness.- An unambiguous class possessing a complete set.- Deadlock-free interval routing schemes.- Power consumption in packet radio networks.- The complexity of generating test instances.- Efficient constructions of Hitting Sets for systems of linear functions.- Protocols for collusion-secure asymmetric fingerprinting.- Minimal transition systems for history-preserving bisimulation.- On ergodic linear cellular automata over Zm.- Intrinsic universality of a 1-dimensional reversible Cellular Automaton.- The computational complexity of some problems of linear algebra.- Algebraic and logical characterizations of deterministic linear time classes.- Finding the k shortest paths in parallel.- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs.- Distance approximating spanning trees.- A better upper bound on the bisection width of de Bruijn networks.- An information-theoretic treatment of random-self-reducibility.- Equivalence of measures of complexity classes.- Better algorithms for minimum weight vertex-connectivity problems.- RNC-approximation algorithms for the steiner problem.- Pattern matching in trace monoids.- Removing ?-transitions in timed automata.- Probabilistic proof systems — A survey.