STACS 91 : 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991. Proceedings. 1st ed. 1991

種類:

電子ブック

責任表示:

edited by Christian Choffrut, Matthias Jantzen

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1991

著者名:

• Choffrut, Christian.
• Jantzen, Matthias.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 480

ISBN:

9783540470021 [3540470026]    

注記:

Polymorphism, parameterization and typing: An algebraic specification perspective -- Executable higher-order algebraic specifications -- Efficient memory access in large-scale computation -- l-occurrences of avoidable patterns -- Rational relations with bounded delay -- On the power of several queues -- On aperiodic trace languages -- Recognizable and rational languages of finite and infinite traces -- On the concatenation of infinite traces -- Tight RNC approximations to Max Flow -- A natural metric for curves — Computing the distance for polygonal chains and approximation algorithms -- The worst case complexity of MC Diarmid and Reed's variant of BOTTOM-UP-HEAT SORT is less than n log n+1.1n -- Decision problems for term rewriting systems and recognizable tree languages -- Decidable sentences for context-free groups -- The owner concept for PRAMs -- Actors as a parallel programming model -- Average case analysis of unification algorithms -- Methodology for proving the termination of logic programs -- Polyno

ローカル注記:

学内専用E-BOOKS (local access only)