Foundations of software technology and theoretical computer science : 16th conference, Hyderabad, India, December 18-20, 1996 : proceedings
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 submiss...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
1180 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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, 16th conference, Hyderabad, India, December 18-20, 1996, proceedings, V. Chandru, V. Vinay, eds, 1996, Berlin, Springer, 1 vol. (XI-386 p.), Lecture notes in computer science, 3-540-62034-6 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662206706 |
Table des matières:
- 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 andtheir use in groundness analysis
- Graph types for monadic mobile processes.