Foundations of software technology and theoretical computer science : 14th Conference, Madras, India, December 15 17, 1994 : proceedings
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 resear...
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
880 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Foundations of software technology and theoretical computer science, 14th conference, Madras, India, December 15-17, 1994, proceedings, P.S. Thiagarajan, ed, Berlin, Springer-Verlag, 1994, 1 vol. (XI-449 p.), Lecture notes in computer science, 3-540-58715-2 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662187265 |
Spis treści:
- 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.