+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Foundations of Software Technology and Theoretical Computer Science : 14th Conference, Madras, India, December 15 - 17, 1994. Proceedings - P. S. Thiagarajan

Foundations of Software Technology and Theoretical Computer Science

14th Conference, Madras, India, December 15 - 17, 1994. Proceedings

By: P. S. Thiagarajan (Editor)

Paperback Published: 23rd November 1994
ISBN: 9783540587156
Number Of Pages: 460

Share This Book:


or 4 easy payments of $39.60 with Learn more
Ships in 15 business days

Earn 317 Qantas Points
on this Book

This volume presents the proceedings of the 14th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FST&TCS-14, held in Madras, India in December 1994.
Besides the five invited papers by well-known researchers, it includes 31 full refereed research papers selected out of a total of 140 submissions. The papers contribute to the whole area of theoretical computer science with an emphasis on algorithms and complexity. Other topics covered are program semantics, program verification, formal logic, computational geometry, concurrency, unification, and discrete mathematics.

Efficient Resolution of Singularities of Plane Curvesp. 1
On the Interactive Complexity of Graph Reliabilityp. 12
Matching Upper and Lower Bounds for Simulations of Several Tapes on One Multidimensional Tapep. 24
The Complexity of Computing over Quasigroupsp. 36
Non-commutative Computation, Depth Reduction and Skew Circuitsp. 48
Inductive Definitions and Type Theory an Introductionp. 60
Interpreter Verification for a Functional Languagep. 77
An Epistemic Foundation for Logic Programming with Uncertaintyp. 89
On Typed Calculi with a Merge Operatorp. 101
Incremental Algorithms for the Single-Source Shortest Path Problemp. 113
An O(n) Algorithm for Realizing Degree Sequencesp. 125
Coloring Semi-Random Graphs in Polynomial Expected Timep. 137
Finite-State Strategies in Regular Infinite Gamesp. 149
Location of the Largest Empty Rectangle among Arbitrary Obstaclesp. 159
Efficient Parallel and Linear Time Sequential Split Decompositionp. 171
Algorithms for Convex Visibility Problemsp. 181
Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problemsp. 193
Localities and Failuresp. 205
Priority and Abstraction in Process Algebrap. 217
On the Computational Power of Operators in ICSP with Fairnessp. 231
Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processesp. 243
My Favorite Ten Complexity Theorems of the Past Decadep. 256
Solving a Unification Problem under Constrained Substitutions Using Tree Automatap. 276
Automata-Driven Efficient Subterm Unificationp. 288
Randomized Approximation Algorithms in Combinatorial Optimizationp. 300
A Limited-Backtrack Greedy Schema for Approximation Algorithmsp. 318
On Approximation Scheme Preserving Reducibility and its Applicationsp. 330
Approximation Schemes Using L-Reductionsp. 342
An Explanation of Splayingp. 354
Proving Non-Reachability by Modulo-Place-Invariantsp. 366
Soundness and Completeness of UNITY Logicp. 378
Efficient Algorithms for the Transformation between Different Types of Binary Decision Diagramsp. 390
Extending the Limits of Sequentially Phased Reasoningp. 402
Foundations for Faster External Sortingp. 414
Branching Rules for Satisfiabilityp. 426
Using Linear Arithmetic Procedure for Generating Induction Schemesp. 438
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540587156
ISBN-10: 3540587152
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 460
Published: 23rd November 1994
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.41
Weight (kg): 0.65

Earn 317 Qantas Points
on this Book