Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings - Couverture souple
Synopsis
This book constitutes the refereed proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, MFCS 2003, held in Bratislava, Slovakia in August 2003.The 55 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Mathematical Foundations of Computer Science 2003:...
Image d'archives
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 24.99-29, 2003, Proceedings (Lecture Notes in Computer Science)
Edité par
Springer, 2003
ISBN 10 : 3540406719
ISBN 13 : 9783540406716
Ancien ou d'occasion
Paperback
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. N° de réf. du vendeur UTD14a2149
Acheter D'occasion
EUR 9,28
Expédition à EUR 5,96
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (Lecture Notes in Computer Science, 2747, Band 2747)
Edité par
Springer, 2008
ISBN 10 : 3540406719
ISBN 13 : 9783540406716
Ancien ou d'occasion
paperback
Vendeur : Studibuch, Stuttgart, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
paperback. Etat : Gut. 708 Seiten; 9783540406716.3 Gewicht in Gramm: 3. N° de réf. du vendeur 863702
Acheter D'occasion
EUR 9,85
Expédition à EUR 62,30
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 2003
Edité par
Springer Berlin Heidelberg Aug 2003, 2003
ISBN 10 : 3540406719
ISBN 13 : 9783540406716
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Thisvolumecontainspapersselectedforpresentationatthe28thSymposiumon MathematicalFoundationsofComputerScience MFCS2003,heldinBratislava, Slovakia, August 25 29, 2003. MFCS 2003 was organized by the Slovak Society for Computer Science and the Comenius University in Bratislava, in cooperation with other institutions in Slovakia. It was supported by the European Association for Theoretical C- puter Science and the Slovak Research Consortium for Informatics and Mat- matics. The series of MFCS symposia, organized alternately in the Czech Republic, PolandandSlovakiasince1972,hasawell-establishedtradition. TheMFCSs- posiaencouragehigh-qualityresearchinallbranchesoftheoreticalcomputers- ence. Theirbroadscopeprovidesanopportunitytobringtogetherspecialistswho donotusuallymeetatspecializedconferences. Thepreviousmeetingstookplace in Jablonna, 1972; Strbsk e Pleso, 1973; Jadwisin, 1974; Mari ansk eL azn e, 1975; Gdansk, ` 1976; Tatransk a Lomnica, 1977; Zakopane, 1978; Olomouc, 1979; Ry- dzina, 1980; Strbsk e Pleso, 1981; Prague, 1984; Bratislava, 1986; Carlsbad, 1988; Porabk a-Kozubnik,1989;Bansk aBystrica,1990;KazimierzDolny,1991;Prague, 1992;Gdansk, ` 1993,Ko sice,1994;Prague,1995;Krak ow,1996;Bratislava,1997; Brno, 1998; Szklarska Por eba, 1999; Bratislava, 2000; Mari ansk eL azn e, 2001; and Warsaw-Otwock, 2002. The MFCS 2003 Proceedings consists of 7 invited papers and 55 c- tributed papers. The latter were selected by the Program Committee from a total of 137 submitted papers. 712 pp. Englisch. N° de réf. du vendeur 9783540406716
Acheter neuf
EUR 106,99
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 2003
Edité par
Springer Berlin Heidelberg, 2003
ISBN 10 : 3540406719
ISBN 13 : 9783540406716
Neuf
Kartoniert / Broschiert
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.- . N° de réf. du vendeur 4888887
Acheter neuf
EUR 92,27
Expédition à EUR 48,99
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (Lecture Notes in Computer Science, 2747)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. xiii + 692. N° de réf. du vendeur 263099974
Acheter neuf
EUR 156,97
Expédition à EUR 3,40
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (Lecture Notes in Computer Science, 2747)
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Print on Demand pp. xiii + 692. N° de réf. du vendeur 5829273
Acheter neuf
EUR 157,24
Expédition à EUR 7,50
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 2003 | 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Mathematical Foundations of Computer Science 2003 | 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings | Branislav Rovan (u. a.) | Taschenbuch | Englisch | 2003 | Springer | EAN 9783540406716 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu. N° de réf. du vendeur 102503877
Acheter neuf
EUR 95,70
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 2003
Edité par
Springer, Springer Aug 2003, 2003
ISBN 10 : 3540406719
ISBN 13 : 9783540406716
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 712 pp. Englisch. N° de réf. du vendeur 9783540406716
Acheter neuf
EUR 106,99
Expédition à EUR 60
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (Lecture Notes in Computer Science, 2747)
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. xiii + 692. N° de réf. du vendeur 183099980
Acheter neuf
EUR 161,69
Expédition à EUR 9,95
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings
Edité par
Springer Berlin Heidelberg, 2003
ISBN 10 : 3540406719
ISBN 13 : 9783540406716
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Thisvolumecontainspapersselectedforpresentationatthe28thSymposiumon MathematicalFoundationsofComputerScience MFCS2003,heldinBratislava, Slovakia, August 25 29, 2003. MFCS 2003 was organized by the Slovak Society for Computer Science and the Comenius University in Bratislava, in cooperation with other institutions in Slovakia. It was supported by the European Association for Theoretical C- puter Science and the Slovak Research Consortium for Informatics and Mat- matics. The series of MFCS symposia, organized alternately in the Czech Republic, PolandandSlovakiasince1972,hasawell-establishedtradition. TheMFCSs- posiaencouragehigh-qualityresearchinallbranchesoftheoreticalcomputers- ence. Theirbroadscopeprovidesanopportunitytobringtogetherspecialistswho donotusuallymeetatspecializedconferences. Thepreviousmeetingstookplace in Jablonna, 1972; Strbsk e Pleso, 1973; Jadwisin, 1974; Mari ansk eL azn e, 1975; Gdansk, ` 1976; Tatransk a Lomnica, 1977; Zakopane, 1978; Olomouc, 1979; Ry- dzina, 1980; Strbsk e Pleso, 1981; Prague, 1984; Bratislava, 1986; Carlsbad, 1988; Porabk a-Kozubnik,1989;Bansk aBystrica,1990;KazimierzDolny,1991;Prague, 1992;Gdansk, ` 1993,Ko sice,1994;Prague,1995;Krak ow,1996;Bratislava,1997; Brno, 1998; Szklarska Por eba, 1999; Bratislava, 2000; Mari ansk eL azn e, 2001; and Warsaw-Otwock, 2002. The MFCS 2003 Proceedings consists of 7 invited papers and 55 c- tributed papers. The latter were selected by the Program Committee from a total of 137 submitted papers. N° de réf. du vendeur 9783540406716
Acheter neuf
EUR 106,99
Expédition à EUR 65,30
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)