Mathematical foundations of computer science 2003 : 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003 : proceedings
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
2747 |
| Soggetti: | |
| Accesso 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 |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of computer science 2003, 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, proceedings, Branislav Rovan, Peter Vojtáš (eds.), Berlin, Springer, 2003, 1 vol. (XIII-692 p.), Lecture notes in computer science, 3-540-40671-9 • Mathematical Foundations of Computer Science 2003, Texte imprimé, 9783662187616 |
| LEADER | 06310nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 969882 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155181017 | ||
| 020 | |a 9783540451389 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Mathematical foundations of Computer Science |n (28th |d :2003 |c :Bratislava, Slovakia). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 2003 : |b 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003 : proceedings |c [edited by] Branislav Rovan, Peter Vojtáš. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2747 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Talks -- Distributed Quantum Computing -- Selfish Routing in Non-cooperative Networks: A Survey -- Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols -- Semantic and Syntactic Approaches to Simulation Relations -- On the Computational Complexity of Conservative Computing -- Constructing Infinite Graphs with a Decidable MSO-Theory -- Towards a Theory of Randomized Search Heuristics -- Contributed Papers -- Adversarial Models for Priority-Based Networks -- On Optimal Merging Networks -- Problems which Cannot Be Reduced to Any Proper Subproblems -- ACID-Unification Is NEXPTIME-Decidable -- Completeness in Differential Approximation Classes -- On the Length of the Minimum Solution of Word Equations in One Variable -- Smoothed Analysis of Three Combinatorial Problems -- Inferring Strings from Graphs and Arrays -- Faster Algorithms for k-Medians in Trees -- Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies -- Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms -- Error-Bounded Probabilistic Computations between MA and AM -- A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves -- Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation -- Denotational Testing Semantics in Coinductive Form -- Lower Bounds for General Graph Driven Read Once Parity Branching Programs -- The Minimal Graph Model of Lambda Calculus -- Unambiguous Automata on Bi-infinite Words -- Relating Hierarchy of Temporal Properties to Model Checking -- Arithmetic Constant-Depth Circuit Complexity Classes -- Inverse NP Problems -- A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs -- Generalized Satisfiability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity.-Randomized Algorithms for Determining the Majority on Graphs -- Using Transitive Closure Logic for Deciding Linear Properties of Monoids -- Linear-Time Computation of Local Periods -- Two Dimensional Packing: The Power of Rotation -- Approximation Schemes for the Min-Max Starting Time Problem -- Quantum Testers for Hidden Group Properties -- Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces -- LTL with Past and Two-Way Very-Weak Alternating Automata -- Match-Bounded String Rewriting Systems -- Probabilistic and Nondeterministic Unary Automata -- On Matroid Properties Definable in the MSO Logic -- Characterizations of Catalytic Membrane Computing Systems -- Augmenting Local Edge-Connectivity between Vertices and Vertex Subsets in Undirected Graphs -- Scheduling and Traffic Allocation for Tasks with Bounded Splittability -- Computing Average Value in Ad Hoc Networks -- A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes -- Solving the Sabotage Game Is PSPACE-Hard -- The Approximate Well-Founded Semantics for Logic Programs with Uncertainty -- Which Is the Worst-Case Nash Equilibrium? -- A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory -- Generic Algorithms for the Generation of Combinatorial Objects -- On the Complexity of Some Problems in Interval Arithmetic -- An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources -- On Selection Functions that Do Not Preserve Normality -- On Converting CNF to DNF -- A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum -- On the Complexity of Some Equivalence Problems for Propositional Calculi -- Quantified Mu-Calculus for Control Synthesis -- On Probabilistic Quantified SatisfiabilityGames -- A Completeness Property of Wilke s Tree Algebras -- Symbolic Topological Sorting with OBDDs -- Ershov s Hierarchy of Real Numbers. | |
| 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 Informatique | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Informatique |x Mathématiques | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Rovan, Branislav, |d 1947- |4 pbd | |
| 700 | 1 | |a Vojtas, Peter. |4 pbd | |
| 776 | 0 | |0 074447017 |t Mathematical foundations of computer science 2003 |o 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003 |o proceedings |f Branislav Rovan, Peter Vojtáš (eds.) |c Berlin |n Springer |d 2003 |p 1 vol. (XIII-692 p.) |s Lecture notes in computer science |z 3-540-40671-9 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 2003 |b Texte imprimé |z 9783662187616 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b11836 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-WF32TJSW-R |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750669187 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b11836 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754018229 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b11836 |z Accès INSA CVL | |
| 997 | |0 969882 |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/ | ||