- 5 Ergebnisse
Kleinster Preis: € 16,69, größter Preis: € 156,77, Mittelwert: € 103,38
1
Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings Ji
Bestellen
bei BarnesandNoble.com
€ 109,99
Bestellen
Details und Versand
gesponserter Link

Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings Ji - neues Buch

2004, ISBN: 9783540228233

This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The c… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings Ji
Bestellen
bei BarnesandNoble.com
€ 109,99
Bestellen
Details und Versand
gesponserter Link
Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings Ji - neues Buch

2004, ISBN: 9783540228233

This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22-27, 2004. The confere… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
3
Mathematical Foundations of Computer Science 2004 - Fiala, Jiri Koubek, Vaclav Kratochvil, Jan
Bestellen
bei booklooker.de
€ 123,45
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Fiala, Jiri Koubek, Vaclav Kratochvil, Jan:
Mathematical Foundations of Computer Science 2004 - Erstausgabe

2004

ISBN: 9783540228233

Taschenbuch

[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
zuklappen (X)
4
Bestellen
bei Biblio.co.uk
$ 175,91
(ca. € 156,77)
Versand: € 16,261
Bestellen
Details beim Anbieter
gesponserter Link
Fiala, Jirí [Editor]; Koubek, Václav [Editor]; Kratochvíl, Jan [Editor];:
Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings (Lecture Notes in Computer Science, 3153) - Taschenbuch

2004, ISBN: 9783540228233

Springer, 2004-08-09. Paperback. New. New. In shrink wrap. Looks like an interesting title!, Springer, 2004-08-09, 6

Versandkosten: EUR 16.26 GridFreed LLC
zuklappen (X)
5
Bestellen
bei Biblio.co.uk
$ 18,73
(ca. € 16,69)
Versand: € 18,711
Bestellen
Details beim Anbieter
gesponserter Link
jir (editor) ; koubek, v. clav (editor) ; kratochv l., jan (editor) fiala:
Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings (Lecture Notes in Computer Science) - Taschenbuch

2004, ISBN: 9783540228233

Springer, 2004-10-05. 2004. Paperback. Used:Good., Springer, 2004-10-05, 0

Versandkosten: EUR 18.71 Ergodebooks
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings Ji
Autor:
Titel:
ISBN-Nummer:

9783540228233


This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167

Detailangaben zum Buch - Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings Ji


EAN (ISBN-13): 9783540228233
ISBN (ISBN-10): 3540228233
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2004
Herausgeber: Springer Berlin Heidelberg Core >1

Buch in der Datenbank seit 2007-04-08T20:51:51+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-03-31T10:32:24+02:00 (Vienna)
ISBN/EAN: 9783540228233

ISBN - alternative Schreibweisen:
3-540-22823-3, 978-3-540-22823-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: jirí kratochvil, jiri fiala, jira, fiala vaclav, koubek, kratochvil jan, charles rest
Titel des Buches: mfc, proceedings the 9th international, mathematical foundations computer science, august, czech, mfcs, symposium notes

Daten vom Verlag:

Autor/in: Jirí Fiala; Václav Koubek; Jan Kratochvíl
Titel: Lecture Notes in Computer Science; Mathematical Foundations of Computer Science 2004 - 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings
Verlag: Springer; Springer Berlin
904 Seiten
Erscheinungsjahr: 2004-08-09
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XXVIII, 904 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Informatik; Mathematik; Automat; XML; algorithms; automata; complexity; computer; computer science; algorithm analysis and problem complexity; data structures; Theory of Computation; Algorithms; Discrete Mathematics in Computer Science; Data Science; Computer Science Logic and Foundations of Programming; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; EA

Invited Lectures.- A Case Study of Genome Evolution: From Continuous to Discrete Time Model.- Multicoloring: Problems and Techniques.- Some Recent Progress in Algorithmic Randomness.- Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms.- PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness.- Theory and Applied Computing: Observations and Anecdotes.- Boxed Ambients with Communication Interfaces.- Algebraic Recognizability of Languages.- Geometric Optimization and Unique Sink Orientations of Cubes.- Congestion Games and Coordination Mechanisms.- Graph Algorithms.- Equitable Colorings of Bounded Treewidth Graphs.- The Bidimensional Theory of Bounded-Genus Graphs.- Parallel Knock-Out Schemes in Networks.- Online Algorithms for Disk Graphs.- Approximations.- Protein Folding in the HP Model on Grid Lattices with Diagonals.- Optimization, Games, and Quantified Constraint Satisfaction.- Approximating Boolean Functions by OBDDs.- On Approximation Hardness of the Minimum 2SAT-DELETION Problem.- Graphs and Complexity.- Group Coloring and List Group Coloring Are ?2 P -Complete.- Complexity Results in Graph Reconstruction.- Generating Paths and Cuts in Multi-pole (Di)graphs.- Packing Directed Cycles Efficiently.- Circuits.- The Complexity of Membership Problems for Circuits over Sets of Integers.- Some Meet-in-the-Middle Circuit Lower Bounds.- The Enumerability of P Collapses P to NC.- On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge.- General Complexity.- All Superlinear Inverse Schemes Are coNP-Hard.- The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups.- Generation Problems.- One Query Reducibilities Between Partial Information Classes.- Automata.- A New Dimension Sensitive Property forCellular Automata.- Captive Cellular Automata.- Simulating 3D Cellular Automata with 2D Cellular Automata.- Graph Exploration by a Finite Automaton.- Parametrized and Kolmogorov Complexity.- On Polynomially Time Bounded Symmetry of Information.- Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets.- A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.- Polynomial Time Approximation Schemes and Parameterized Complexity.- Semantics.- Epistemic Foundation of the Well-Founded Semantics over Bilattices.- Structural Model Checking for Communicating Hierarchical Machines.- Compositional Verification: Decidability Issues Using Graph Substitutions.- Event Structures for Resolvable Conflict.- Scheduling.- Optimal Preemptive Scheduling for General Target Functions.- The Price of Anarchy for Polynomial Social Cost.- Agent-Based Information Handling in Large Networks.- Approximating Earliest Arrival Flows with Flow-Dependent Transit Times.- Algebraic Theory of Languages.- A Hierarchy of Irreducible Sofic Shifts.- Membership and Reachability Problems for Row-Monomial Transformations.- On Pseudovarieties of Semiring Homomorphisms.- An Algebraic Generalization of ?-Regular Languages.- Games.- A Protocol for Serializing Unique Strategies.- A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.- When Can You Play Positionally?.- Languages.- The Dual of Concatenation.- Computational Aspects of Disjunctive Sequences.- Decidability of Trajectory-Based Equations.- Geometry.- Efficient View Point Selection for Silhouettes of Convex Polyhedra.- Angles and Lengths in Reconfigurations of Polygons and Polyhedra.- Improved Bounds and Schemes for the Declustering Problem.- Crossing Number Is Hard for CubicGraphs.- Languages and Complexity.- A Reducibility for the Dot-Depth Hierarchy.- Sublogarithmic Ambiguity.- An Elementary Proof for the Non-parametrizability of the Equation xyz=zvx.- A Generalization of Repetition Threshold.- Quantum Computing.- An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation.- Universal Test for Quantum One-Way Permutations.- A Common Algebraic Description for Probabilistic and Quantum Computations.- XML.- Extraction and Implication of Path Constraints.- Schema Evolution for XML: A Consistency-Preserving Approach.- Complexity of Decision Problems for Simple Regular Expressions.
Includes supplementary material: sn.pub/extras
< zum Archiv...