FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science 26th International Conference, Kolkata, India, December 13-15, 2006. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Arun-Kumar, S. (Επιμελητής έκδοσης), Garg, Naveen (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
Σειρά:Lecture Notes in Computer Science, 4337
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04403nam a22005655i 4500
001 978-3-540-49995-4
003 DE-He213
005 20151204180517.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 
040 |d GrThAP 
050 4 |a QA76.76.A65 
072 7 |a UB  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
082 0 4 |a 004  |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. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |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 Lecture Notes in Computer Science,  |x 0302-9743 ;  |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 Computer science. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Application software. 
650 1 4 |a Computer Science. 
650 2 4 |a Computer Applications. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Computation by Abstract Devices. 
700 1 |a Arun-Kumar, S.  |e editor. 
700 1 |a Garg, Naveen.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540499947 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4337 
856 4 0 |u http://dx.doi.org/10.1007/11944836  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)