05499nam a22005055i 4500001001800000003000900018005001700027007001500044008004100059020001800100024002800118050001700146072001500163072001600178072002300194072002300217082001700240245021000257264006100467300003300528336002600561337002600587338003600613347002400649490005800673505295500731520073203686650002204418650002604440650005004466650001504516650003504531650002204566650002704588650002804615650005204643650004604695700003404741700002904775710003404804773002004838776003604858830005804894856004104952978-3-540-68342-1DE-He21320170515111447.0cr nn 008mamaa121227s1997 gw | s |||| 0|eng d a97835406834217 a10.1007/BFb00234432doi 4aQA75.5-76.95 7aUY2bicssc 7aUYA2bicssc 7aCOM0140002bisacsh 7aCOM0310002bisacsh04a004.015122310aSTACS 97h[electronic resource] :b14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings /cedited by Rüdiger Reischuk, Michel Morvan. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1997. aXV, 621 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v12000 aUnifying 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. aThis book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference. 0aComputer science. 0aComputer programming. 0aProgramming languages (Electronic computers). 0aComputers. 0aComputer sciencexMathematics.14aComputer Science.24aTheory of Computation.24aProgramming Techniques.24aProgramming Languages, Compilers, Interpreters.24aDiscrete Mathematics in Computer Science.1 aReischuk, Rüdiger.eeditor.1 aMorvan, Michel.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540626169 0aLecture Notes in Computer Science,x0302-9743 ;v120040uhttp://dx.doi.org/10.1007/BFb0023443