FST TCS 2003 : foundations of software technology and theoretical computer science : 23rd conference, Mumbai, India, December 15-17, 2003 : proceedings
में बचाया:
| निगमित लेखक: | |
|---|---|
| अन्य लेखक: | , |
| स्वरूप: | Livre numérique |
| भाषा: | Anglais |
| प्रकाशित: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| श्रृंखला: | Lecture notes in computer science
2914 |
| विषय: | |
| ऑनलाइन पहुंच: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| टिप्पणी: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • FST TCS 2003, foundations of software technology and theoretical computer science, 23rd conference, Mumbai, India, December 15-17, 2003, proceedings, Paritosh K. Pandya, Jaikumar Radhakrishnan (eds.), Berlin, Springer, 2003, 1 vol. (XIII-446 p.), Lecture notes in computer science, 3-540-20680-9 • FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662196397 |
| LEADER | 05001nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 969788 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15517956X | ||
| 020 | |a 9783540245971 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 005 | ||
| 111 | 2 | |a International Conference on Foundations of Software Technology and Theoretical Computer Science |n (23rd |d :2003 |c :Mumbai, India). | |
| 245 | 1 | 0 | |a FST TCS 2003 : |b foundations of software technology and theoretical computer science : 23rd conference, Mumbai, India, December 15-17, 2003 : proceedings |c [edited by] Paritosh K. Pandya, Jaikumar Radhakrishnan. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2914 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Contributed Papers -- A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol -- Constructions of Sparse Asymmetric Connectors -- A Separation Logic for Resource Distribution -- An Equational Theory for Transactions -- Axioms for Regular Words -- 1-Bounded TWA Cannot Be Determinized -- Reachability Analysis of Process Rewrite Systems -- Pushdown Games with Unboundedness and Regular Conditions -- Real-Time Model-Checking: Parameters Everywhere -- The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata -- Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents -- Subtyping Constraints in Quasi-lattices -- An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case -- Word Equations over Graph Products -- Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models -- Comparing Sequences with Segment Rearrangements -- On Logically Defined Recognizable Tree Languages -- Randomized Time-Space Tradeoffs for Directed Graph Connectivity -- Distance-Preserving Approximations of Polygonal Paths -- Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra -- On the Covering Steiner Problem -- Minimality Results for the Spatial Logics -- Algorithms for Non-uniform Size Data Placement on Parallel Disks -- Efficient Algorithms for Abelian Group Isomorphism and Related Problems -- Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees -- Model Checking and Satisfiability for Sabotage Modal Logic -- Merging and Sorting By Strip Moves -- The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase -- Distributed Games -- Maintenance of Multidimensional Histograms -- Tagging Makes Secrecy Decidable with Unbounded Nonces as Well -- Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties -- On the Greedy Superstring Conjecture -- Invited Papers -- Reasoning about Infinite State Systems Using Boolean Methods -- Stringent Relativization -- Component-Based Construction of Deadlock-Free Systems -- Moderately Hard Functions: From Complexity to Spam Fighting -- Zigzag Products, Expander Constructions, Connections, and Applications. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Génie logiciel | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Pandya, Paritosh K. |4 pbd | |
| 700 | 1 | |a Radhakrishnan, Jaikumar. |4 pbd | |
| 776 | 0 | |0 076053962 |t FST TCS 2003 |o foundations of software technology and theoretical computer science |o 23rd conference, Mumbai, India, December 15-17, 2003 |o proceedings |f Paritosh K. Pandya, Jaikumar Radhakrishnan (eds.) |c Berlin |n Springer |d 2003 |p 1 vol. (XIII-446 p.) |s Lecture notes in computer science |z 3-540-20680-9 | |
| 776 | 0 | |t FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science |b Texte imprimé |z 9783662196397 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b94618 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-VJM4NR9G-S |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750670231 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b94618 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754019179 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b94618 |z Accès INSA CVL | |
| 997 | |0 969788 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||