<電子ブック>
Foundations of Software Technology and Theoretical Computer Science : 16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings / edited by Vijay Chandru, V. Vinay
(Lecture Notes in Computer Science. ISSN:16113349 ; 1180)
版 | 1st ed. 1996. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1996 |
本文言語 | 英語 |
大きさ | XIII, 395 p : online resource |
著者標目 | Chandru, Vijay editor Vinay, V editor SpringerLink (Online service) |
件 名 | LCSH:Computer science LCSH:Software engineering LCSH:Algorithms LCSH:Machine theory LCSH:Computer graphics FREE:Theory of Computation FREE:Software Engineering FREE:Computer Science Logic and Foundations of Programming FREE:Algorithms FREE:Formal Languages and Automata Theory FREE:Computer Graphics |
一般注記 | Circuit complexity before the dawn of the new millennium -- A lambda calculus with letrecs and barriers -- Tables -- Mechanized formal methods: Progress and prospects -- The parameter space of the d-step conjecture -- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees -- Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles -- Weak bisimulation and model checking for Basic Parallel Processes -- Testing processes for efficiency -- Regularity is decidable for normed PA processes in polynomial time -- Dynamic maintenance of shortest path trees in simple polygons -- Close approximations of minimum rectangular coverings -- A new competitive algorithm for agent searching in unknown streets -- On the design of hybrid control systems using automata models -- Constraint retraction in FD -- Winskel is (almost) right -- An optimal deterministic algorithm for online b-matching -- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems -- Complexity of the gravitational method for linear programming -- Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errors -- Minimal relative normalization in orthogonal expression reduction systems -- Trace consistency and inevitability -- Finite state implementations of knowledge-based programs -- Higher-order proof by consistency -- Advocating ownership -- Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits -- Limitations of the QRQW and EREW PRAM models -- Pinpointing computation with modular queries in the Boolean hierarchy -- Characterization of the principal type of normal forms in an intersection type system -- Correcting type errors in the Curry System -- Immediate fixpoints and their use in groundness analysis -- Graph types for monadic mobile processes This book constitutes the refereed proceedings of the 16th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS '96, held in Hyderabad, India, in December 1996. The volume presents 28 revised full papers selected from a total of 98 submissions; also included are four invited contributions. The papers are organized in topical sections on computational geometry, process algebras, program semantics, algorithms, rewriting and equational-temporal logics, complexity theory, and type theory HTTP:URL=https://doi.org/10.1007/3-540-62034-6 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540496311 |
|
電子リソース |
|
EB00225846 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA75.5-76.95 DC23:004.0151 |
書誌ID | 4001090620 |
ISBN | 9783540496311 |