|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-49995-4 |
| 003 |
DE-He213 |
| 005 |
20230406035947.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540499954
|9 978-3-540-49995-4
|
| 024 |
7 |
|
|a 10.1007/11944836
|2 doi
|
| 050 |
|
4 |
|a QA76.76.A65
|
| 072 |
|
7 |
|a UB
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a UX
|2 thema
|
| 082 |
0 |
4 |
|a 005.3
|2 23
|
| 245 |
1 |
0 |
|a FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science
|h [electronic resource] :
|b 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings /
|c edited by S. Arun-Kumar, Naveen Garg.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XIII, 434 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4337
|
| 505 |
0 |
|
|a Invited 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 Criteria for 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 |
|a Application software.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
1 |
4 |
|a Computer and Information Systems Applications.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Compilers and Interpreters.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 700 |
1 |
|
|a Arun-Kumar, S.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Garg, Naveen.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540833499
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540499947
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4337
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11944836
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
