Korean
Foundations of Software Technology and Theoretical Computer Science
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 33 Circuit complexity before the dawn of the new millennium
-
Altmetric BadgeChapter 34 A lambda calculus with letrecs and barriers
-
Altmetric BadgeChapter 35 Tables
-
Altmetric BadgeChapter 36 Mechanized formal methods: Progress and prospects
-
Altmetric BadgeChapter 37 The parameter space of the d -step conjecture
-
Altmetric BadgeChapter 38 On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
-
Altmetric BadgeChapter 39 Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles
-
Altmetric BadgeChapter 40 Weak bisimulation and model checking for Basic Parallel Processes
-
Altmetric BadgeChapter 41 Testing processes for efficiency
-
Altmetric BadgeChapter 42 Regularity is decidable for normed PA processes in polynomial time
-
Altmetric BadgeChapter 43 Dynamic maintenance of shortest path trees in simple polygons
-
Altmetric BadgeChapter 44 Close approximations of minimum rectangular coverings
-
Altmetric BadgeChapter 45 A new competitive algorithm for agent searching in unknown streets
-
Altmetric BadgeChapter 46 On the design of hybrid control systems using automata models
-
Altmetric BadgeChapter 47 Constraint retraction in FD
-
Altmetric BadgeChapter 48 Winskel is (almost) right
-
Altmetric BadgeChapter 49 An optimal deterministic algorithm for online b-matching
-
Altmetric BadgeChapter 50 Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
-
Altmetric BadgeChapter 51 Complexity of the gravitational method for linear programming
-
Altmetric BadgeChapter 52 Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errors
-
Altmetric BadgeChapter 53 Minimal relative normalization in orthogonal expression reduction systems
-
Altmetric BadgeChapter 54 Trace consistency and inevitability
-
Altmetric BadgeChapter 55 Finite state implementations of knowledge-based programs
-
Altmetric BadgeChapter 56 Higher-order proof by consistency
-
Altmetric BadgeChapter 57 Advocating ownership
-
Altmetric BadgeChapter 58 Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits
-
Altmetric BadgeChapter 59 Limitations of the QRQW and EREW PRAM models
-
Altmetric BadgeChapter 60 Pinpointing computation with modular queries in the Boolean hierarchy
-
Altmetric BadgeChapter 61 Characterization of the principal type of normal forms in an intersection type system
-
Altmetric BadgeChapter 62 Correcting type errors in the Curry System
-
Altmetric BadgeChapter 63 Immediate fixpoints and their use in groundness analysis
-
Altmetric BadgeChapter 64 Graph types for monadic mobile processes