Rovan / Vojtas Mathematical Foundations of Computer Science 2003

28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings
Erscheinungsjahr 2003
ISBN: 978-3-540-45138-9
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 2747, 692 Seiten, eBook

Reihe: Lecture Notes in Computer Science

Zielgruppe

Research

Autoren/Hrsg.

Rovan, Branislav

Vojtas, Peter

Inhaltsverzeichnis

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.