Description 
1 online resource (xi, 449 pages) : illustrations 
Series 
Lecture notes in computer science ; 880 

Lecture notes in computer science ; 880.

Contents 
Efficient resolution of singularities of plane curves  On the interactive complexity of graph reliability  Matching upper and lower bounds for simulations of several tapes on one multidimensional tape  The complexity of computing over quasigroups  Noncommutative computation, depth reduction, and skew circuits (extended abstract)  Inductive definitions and type theory an introduction (preliminary version)  Interpreter verification for a functional language  An epistemic foundation for logic programming with uncertainty  On typed calculi with a merge operator  Incremental algorithms for the singlesource shortest path problem  An O(n) algorithm for realizing degree sequences  Coloring semirandom graphs in polynomial expected time  Finitestate strategies in regular infinite games  Location of the largest empty rectangle among arbitrary obstacles  Efficient parallel and linear time sequential split decomposition (extended abstract)  Algorithms for convex visibility problems  Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems  Localities and failures (extended summary)  Priority and abstraction in process algebra  On the computational power of operators in ICSP with fairness  Decidability of timed languageinclusion for networks of realtime communicating sequential processes  My favorite ten complexity theorems of the past decade  Solving a unification problem under constrained substitutions using tree automata  Automatadriven efficient subterm unification  Randomized approximation algorithms in combinatorial optimization  A limitedbacktrack greedy schema for approximation algorithms  On approximation scheme preserving reductibility and its applications  Approximation schemes using Lreductions  An explanation of splaying  Proving nonreachability by moduloplaceinvariants  Soundness and completeness of UNITY logic  Efficient algorithms for the transformation between different types of binary decision diagrams  Extending the limits of sequentially phased reasoning  Foundations for faster external sorting  Branching rules for satisfiability  Using linear arithmetic procedure for generating induction schemes 
Summary 
This volume presents the proceedings of the 14th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FST & TCS14, held in Madras, India in December 1994. Besides the five invited papers by wellknown 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 
Bibliography 
Includes bibliographical references and index 
Notes 
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL 

digitized 2012 HathiTrust Digital Library committed to preserve pda MiAaHDL 

Print version record 
Subject 
Computer software  Congresses


Computer software


Informatik


Software Basico.


Teoria Da Computacao.


Logiciels  Congrès.


Informatique  Congrès.


Madras <1994>

Genre/Form 
Conference papers and proceedings


Madras (1994)

Form 
Electronic book

Author 
Thiagarajan, P. S.

ISBN 
9783540490548 

354049054X 
