Mathematical Foundations of Computer Science 1994 : 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22  26, 1994. Proceedings
This volume constitutes the proceedings of the 19th International Symposium on Mathematical Foundations of Theoretical Computer Science, MFCS '94, held in Kosice, Slovakia in August 1994. MFCS '94 brought together specialists in theoretical fields of computer science from various countries...
Corporate Author:  

Other Authors:  , , 
Format:  eBook 
Language:  English 
Published: 
Berlin, Heidelberg
Springer Berlin Heidelberg
1994, 1994

Edition:  1st ed. 1994 
Series:  Lecture Notes in Computer Science

Subjects:  
Online Access:  
Collection:  Springer Book Archives 2004  Collection details see MPG.ReNa 
Table of Contents:
 Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable
 Complexity of EOL structural equivalence
 Shorter queues for permutation routing on meshes
 Full abstraction for the second order subset of an ALGOLlike language
 The finest homophonic partition and related code concepts
 Models, languages, and compiler technology for high performance computers
 On NCreal complexity classes for additive circuits and their relations with NC
 Ecomplete sets do not have optimal polynomial time approximations
 Solving polynomial fixed point equations
 Capturing complexity classes with Lindström quantifiers
 Communication throughput of interconnection networks
 Intuitive counterexamples for constructive fallacies
 Algebraic methods in the compositional analysis of logic programs
 Longest common subsequences
 Towards DNA sequencing chips
 Online scheduling of parallel jobs
 Stable bistructure models of PCF
 A Competitive analysis of the list update problem with lookahead
 May and must convergency in concurrent ?calculus
 Genericity and measure for exponential time
 Analysis of bounded disorder
 On languages accepted with simultaneous complexity bounds and their ranking problem
 On the power of the wavefront approach to Voronoi diagrams
 Reliable minimum finding comparator networks
 On parallel complexity of maximum fmatching and the degree sequence problem
 A comparison of two lower bound methods for communication complexity
 Efficient solving of the word equations in one variable
 A ?calculus with explicit substitutions: The late semantics
 Processes and hyperuniverses
 The combinatorial complexity of a finite string
 A fully abstract semantics for termination in Petri nets
 Passive and active rules in deductive databases
 Combinatorial results on the complexity of teaching and learning
 Degrees and reducibilities of easy tally sets
 MSO definable text languages
 A technique for the efficient parallel solution of shortest paths and other problems
 The relationship between gossiping in vertexdisjoint paths mode and bisection width
 A comparison of finite and cellular automata
 Empty alternation
 On the minimization problem for ?automata
 On the complexity of constructing optimal ordered binary decision diagrams
 Approximation algorithms for Minkoverlap problems using the principal lattice of partitions approach
 A completeness theorem for nondeterministic Kleene algebras
 How a rainbow coloring function can simulate waitfree handshaking
 Critical pairs in term graph rewriting
 Readwrite causality