Foundations of Software Technology and Theoretical Computer Science

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

AvP.S. Thiagarajan

Häftad, Engelska, 1994

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1994-11-23
Mått:155 x 235 x 26 mm
Vikt:709 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:460
Upplaga:1994
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540587156

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Innehållsförteckning

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.- Non-commutative 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 single-source shortest path problem.- An O(n) algorithm for realizing degree sequences.- Coloring semi-random graphs in polynomial expected time.- Finite-state 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 language-inclusion for networks of real-time communicating sequential processes.- My favorite ten complexity theorems of the past decade.- Solving a unification problem under constrained substitutions using tree automata.- Automata-driven efficient subterm unification.- Randomized approximation algorithms in combinatorial optimization.- A limited-backtrack greedy schema for approximation algorithms.- On approximation scheme preserving reductibility and its applications.- Approximation schemes using L-reductions.- An explanation of splaying.- Proving non-reachability by modulo-place-invariants.- 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.

Du kanske också är intresserad av

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Lilla svenskan a

Barbro Lindell

Häftad, 1994

147 kr

Bernd Kleinjohann, Lisa Kleinjohann, Ricardo J. Machado, Carlos Pereira, P.S. Thiagarajan - From Model-Driven Design to Resource Management for Distributed Embedded Systems, Häftad

Del 225

From Model-Driven Design to Resource Management for Distributed Embedded Systems

Bernd Kleinjohann, Lisa Kleinjohann, Ricardo J. Machado, Carlos Pereira, P.S. Thiagarajan

Häftad, 2010

1 139 kr

Was kostet uns die Mobilität?

Peter Bickel, Rainer Friedrich

Häftad, 1994

572 kr

Ethnography Of Empowerment: The Transformative Power Of Classroom interaction

Helja Antola Robinson

Inbunden, 1994

2 041 kr

Rehabilitation in Kardiologie und Angiologie

Rainer Buchwalsky, Gerhard Blümchen

Häftad, 1994

589 kr

Gogol

Nikolai Vasilievich Gogol, Milton Ehre

Häftad, 1994

232 kr

Parallel, Distributed and Multiagent Production Systems

Toru Ishida

Häftad, 1994

392 kr

Children's Childhoods

Berry Mayall

Häftad, 1994

810 kr

Aufgaben zur Bioreaktionstechnik

K.-H. Wolf

Häftad, 1994

521 kr

Foundations of Software Technology and Theoretical Computer Science

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

AvP.S. Thiagarajan

Häftad, Engelska, 1994

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:1994-11-23
Mått:155 x 235 x 26 mm
Vikt:709 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:460
Upplaga:1994
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540587156

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Innehållsförteckning

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.- Non-commutative 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 single-source shortest path problem.- An O(n) algorithm for realizing degree sequences.- Coloring semi-random graphs in polynomial expected time.- Finite-state 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 language-inclusion for networks of real-time communicating sequential processes.- My favorite ten complexity theorems of the past decade.- Solving a unification problem under constrained substitutions using tree automata.- Automata-driven efficient subterm unification.- Randomized approximation algorithms in combinatorial optimization.- A limited-backtrack greedy schema for approximation algorithms.- On approximation scheme preserving reductibility and its applications.- Approximation schemes using L-reductions.- An explanation of splaying.- Proving non-reachability by modulo-place-invariants.- 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.