STACS 84 : Symposium of Theoretical Aspects of Computer Science, Paris [April] 11-13, 1984

sponsored by AFCET (Association Francaise pour la Cybernétique Economique et Technique) and GI (Gesellschaft für Informatik) ; edited by M. Fontet and K. Mehlhorn

Sponsored by AFCET (Association Francaise pour la Cybern; tique Economique et Technique) and GI (Gesellschaft fur Informatik)"

「Nielsen BookData」より

[目次]

  • Key-problems and key-methods in computational geometry.- Some recent results on squarefree words.- Transformations realizing fairness assumptions for parallel programs.- Computing the largest empty rectangle.- Approximation schemes for covering and packing problems in robotics and vlsi.- Covering polygons with minimum number of rectangles.- On expressive interpretations of a Hoare-logic for Clarke's language L4.- Towards executable specifications using conditional axioms.- Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible.- On a general weight of trees.- From expanders to better superconcentrators without cascading.- Locally synchronous complexity in the light of the trans-box method.- A new definition of morphism on Petri nets.- Blocage et vivacite dans les reseaux a pile-file.- Denotational semantics of concurrent programs with shared memory.- Higher order data structures.- Computability in higher types and the universal domain P?.- On the structure of polynomial time degrees.- Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region.- Efficient simulations among several models of parallel computers (extended abstract).- Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres.- Adherence equivalence is decidable for DOL languages.- Pusdown space complexity and related full-A.F.L.s..- Automates a pile sur des alphabets infinis.- Logic programs and many-valued logic.- Algebre de machines et logique temporelle.- Algebraic and topological theory of languages and computation.- A property of three-element codes.- Polynomial time inference of general pattern languages.- On extendibility of unavoidable sets.

「Nielsen BookData」より

この本の情報

書名 STACS 84 : Symposium of Theoretical Aspects of Computer Science, Paris [April] 11-13, 1984
著作者等 Association française pour la cybernétique économique et technique
Fontet, M.
Gesellschaft für Informatik
Mehlhorn, Kurt
Symposium on Theoretical Aspects of Computer Science
Fontet M.
シリーズ名 Lecture notes in computer science
出版元 Springer-Verlag
刊行年月 1984
ページ数 vi, 338 p.
大きさ 25 cm
ISBN 0387129200
3540129200
NCID BA01346525
※クリックでCiNii Booksを表示
言語 フランス語
英語
出版国 ドイツ
この本を: 
このエントリーをはてなブックマークに追加

Yahoo!ブックマークに登録
この記事をクリップ!
Clip to Evernote
このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想