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 |
| Θέματα: | |
| Διαθέσιμο Online: | 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 |
Πίνακας περιεχομένων:
- 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.