Artículos relacionados a Mathematical Foundations of Computer Science 2003:...
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings: 2747 (Lecture Notes in Computer Science, 2747) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
De la contraportada
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Mathematical Foundations of Computer Science 2003:...
Imagen de archivo
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 24.99-29, 2003, Proceedings (Lecture Notes in Computer Science)
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. Nº de ref. del artículo: UTD14a2149
Comprar usado
EUR 9,75
Envío por EUR 6,26
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (Lecture Notes in Computer Science, 2747)
Librería: -OnTimeBooks-, Phoenix, AZ, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail. Nº de ref. del artículo: OTV.3540406719.VG
Comprar usado
EUR 83,48
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 2003
Publicado por
Springer Berlin Heidelberg Aug 2003, 2003
ISBN 10: 3540406719
ISBN 13: 9783540406716
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783540406716
Comprar nuevo
EUR 106,99
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 2003
Publicado por
Springer Berlin Heidelberg, 2003
ISBN 10: 3540406719
ISBN 13: 9783540406716
Nuevo
Kartoniert / Broschiert
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Kartoniert / Broschiert. Condición: 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 ref. del artículo: 4888887
Comprar nuevo
EUR 92,27
Envío por EUR 48,99
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 2003 | 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 Print on Demand. Nº de ref. del artículo: 102503877
Comprar nuevo
EUR 95,95
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 2003
Publicado por
Springer, Springer Aug 2003, 2003
ISBN 10: 3540406719
ISBN 13: 9783540406716
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783540406716
Comprar nuevo
EUR 106,99
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783540406716
Comprar nuevo
EUR 124,85
Envío por EUR 42,42
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (Lecture Notes in Computer Science, 2747)
Librería: Books Puddle, Woodside, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. xiii + 692. Nº de ref. del artículo: 263099974
Comprar nuevo
EUR 176,98
Envío por EUR 3,58
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (Lecture Notes in Computer Science, 2747)
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Print on Demand pp. xiii + 692. Nº de ref. del artículo: 5829273
Comprar nuevo
EUR 181,24
Envío por EUR 7,80
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (Lecture Notes in Computer Science, 2747)
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. xiii + 692. Nº de ref. del artículo: 183099980
Comprar nuevo
EUR 182,39
Envío por EUR 9,95
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 4 disponibles