Mathematical Foundations of Computer Science 1994

19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994. Proceedings

AvIgor Privara,Branislav Rovan

Häftad, Engelska, 1994

Del i serien Lecture Notes in Computer Science

1 094 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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 in order to stimulate mathematical research in theoretical computer science. Besides 12 papers based on invited talks by renowned experts, the book contains 42 research contributions selected from a total of 112 submissions. All areas of theoretical computer science are presented, some from a particular mathematical point of view.

Produktinformation

Utgivningsdatum:1994-08-03
Mått:155 x 233 x 35 mm
Vikt:961 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:633
Upplaga:1994
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540583387

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Models, languages, and compiler technology for high performance computers.- On NC-real complexity classes for additive circuits and their relations with NC.- E-complete 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.- On-line 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.- A proof system for asynchronously communicating deterministic processes.- Embedding complete binary trees into star networks.- Inductive counting below logspace.- Decision problems for edge grammars.- “The big sweep”: On the power of the wavefront approach to Voronoi diagrams.- Reliable minimum finding comparator networks.- On parallel complexity of maximum f-matching 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 andreducibilities of easy tally sets.- MSO definable text languages.- Two lower bounds on distributive generation of languages.- Rational rewriting.- On the size of independent systems of equations in semigroups.- On a sublinear time parallel construction of optimal binary search trees.- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems.- The relationship between gossiping in vertex-disjoint 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 Min-k-overlap problems using the principal lattice of partitions approach.- A completeness theorem for nondeterministic Kleene algebras.- How a rainbow coloring function can simulate wait-free handshaking.- Critical pairs in term graph rewriting.- Read-write causality.- 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 ALGOL-like language.- The finest homophonic partition and related code concepts.