000 04717nam a22006015i 4500
001 978-3-540-49995-4
003 DE-He213
005 20240730170222.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540499954
_9978-3-540-49995-4
024 7 _a10.1007/11944836
_2doi
050 4 _aQA76.76.A65
072 7 _aUB
_2bicssc
072 7 _aCOM005000
_2bisacsh
072 7 _aUX
_2thema
082 0 4 _a005.3
_223
245 1 0 _aFSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science
_h[electronic resource] :
_b26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings /
_cedited by S. Arun-Kumar, Naveen Garg.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXIII, 434 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4337
505 0 _aInvited Papers -- Shared-Variable Concurrency: A Proposal -- Hennessy-Plotkin-Brookes Revisited -- Approximation Algorithms for 2-Stage Stochastic Optimization Problems -- The Number of Crossing Free Configurations on Finite Point Sets in the Plane -- Contributed Papers - Track A -- Normal and Feature Approximations from Noisy Point Clouds -- Coresets for Discrete Integration and Clustering -- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time -- One-Input-Face MPCVP Is Hard for L, But in LogDCFL -- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs -- Multi-stack Boundary Labeling Problems -- Computing a Center-Transversal Line -- On Obtaining Pseudorandomness from Error-Correcting Codes -- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance -- Zero Error List-Decoding Capacity of the q/(q-1) Channel -- Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems -- Solving Connected Dominating Set Faster Than 2 n -- Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species -- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions -- Some Results on Average-Case Hardness Within the Polynomial Hierarchy -- Unbiased Rounding of Rational Matrices -- Contributed Papers - Track B -- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games -- The Anatomy of Innocence Revisited -- Testing Probabilistic Equivalence Through Reinforcement Learning -- On Decidability of LTL Model Checking for Process Rewrite Systems -- Monitoring of Real-Time Properties -- A Proof System for the Linear Time ?-Calculus -- Tree Automata Make Ordinal Theory Easy -- Context-Sensitive Dependency Pairs -- On Reduction Criteriafor Probabilistic Reward Models -- Distributed Synthesis for Well-Connected Architectures -- The Meaning of Ordered SOS -- Almost Optimal Strategies in One Clock Priced Timed Games -- Expressivity Properties of Boolean BI Through Relational Models -- On Continuous Timed Automata with Input-Determined Guards -- Safely Freezing LTL -- Branching Pushdown Tree Automata -- Validity Checking for Finite Automata over Linear Arithmetic Constraints -- Game Semantics for Higher-Order Concurrency.
650 0 _aApplication software.
_992430
650 0 _aComputer science.
_99832
650 0 _aCompilers (Computer programs).
_93350
650 0 _aMachine theory.
_992431
650 0 _aAlgorithms.
_93390
650 1 4 _aComputer and Information Systems Applications.
_992432
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aFormal Languages and Automata Theory.
_992433
650 2 4 _aAlgorithms.
_93390
650 2 4 _aTheory of Computation.
_992434
700 1 _aArun-Kumar, S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_992435
700 1 _aGarg, Naveen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_992436
710 2 _aSpringerLink (Online service)
_992437
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540499947
776 0 8 _iPrinted edition:
_z9783540833499
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4337
_992438
856 4 0 _uhttps://doi.org/10.1007/11944836
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86793
_d86793