Foundations of Software Technology and Theoretical Computer Science de Vijay Chandru

Foundations of Software Technology and Theoretical Computer Science: 16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings: Lecture Notes in Computer Science, cartea 1180

Vijay Chandru

V. Vinay

en Limba Engleză Paperback – 27 noi 1996

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 submissions; also included are four invited contributions. The papers are organized in topical sections on computational geometry, process algebras, program semantics, algorithms, rewriting and equational-temporal logics, complexity theory, and type theory.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1040^.03 lei
20%

Preț: 333^.46 lei
20%

Preț: 335^.08 lei
20%

Preț: 444^.17 lei
20%

Preț: 238^.01 lei
20%

Preț: 333^.46 lei
20%

Preț: 438^.69 lei
Preț: 440^.52 lei
20%

Preț: 336^.71 lei
20%

Preț: 148^.66 lei
20%

Preț: 310^.26 lei
20%

Preț: 256^.27 lei
20%

Preț: 632^.22 lei
17%

Preț: 427^.22 lei
20%

Preț: 641^.78 lei
20%

Preț: 307^.71 lei
20%

Preț: 1053^.45 lei
20%

Preț: 579^.56 lei
Preț: 373^.56 lei
20%

Preț: 330^.23 lei
15%

Preț: 429^.74 lei
20%

Preț: 607^.39 lei
20%

Preț: 538^.29 lei
Preț: 389^.48 lei
20%

Preț: 326^.98 lei
20%

Preț: 1386^.07 lei
20%

Preț: 1003^.66 lei
20%

Preț: 567^.60 lei
20%

Preț: 575^.48 lei
20%

Preț: 571^.63 lei
20%

Preț: 747^.79 lei
15%

Preț: 568^.74 lei
17%

Preț: 360^.19 lei
20%

Preț: 504^.57 lei
20%

Preț: 172^.69 lei
20%

Preț: 369^.12 lei
20%

Preț: 346^.40 lei
20%

Preț: 574^.05 lei
Preț: 402^.62 lei
20%

Preț: 584^.40 lei
20%

Preț: 747^.79 lei
20%

Preț: 809^.19 lei
20%

Preț: 649^.49 lei
20%

Preț: 343^.16 lei
20%

Preț: 309^.90 lei
20%

Preț: 122^.89 lei

Cuprins

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.