No coin nor oath required. For personal study only.
Index -Volumes 71-80 1-factorization (77) 269 1-Hamiltonian (72) 55 i-triangulated graph (76) 141 k-ary trees (76) 169, (77) 231 k-compaction problem (71) 43 k-median problem (74) 81 k-mutual exclusion (80) 205 k-nearest neighbor query (80) 195 k-selective family (79) 53 k-server problem (74) 73 µCRL (80) 33, (80) 59 ω-automaton minimization (79) 105 ω-trajectory (80) 139
Abstract interpretation (75) 17 Acyclic orientations (72) 71, (73) 221 Adaptive task scheduling (79) 65 Adjustments (77) 23, (77) 27 Admissible orders (74) 15 Aggregate query (72) 205 Agreement (73) 69, (79) 99 Algebraic degree (74) 191 Algebraic specifications (76) 19 Algorithm (72) 37 Algorithmic invariant theory (74) 15 Algorithmical approximation (77) 13, (80) 171 Algorithms (71) 9, (71) 49, (71) 87, (71) 91, (71) 187, (71) 199, (71) 205, (72) 47, (72) 71, (72) 119, (72) 143, (72) 149, (73) 17, (73) 87, (73) 111, (73) 119, (73) 125, (73) 145, (73) 199, (74) 7, (74) 19, (74) 41, (74) 81, (74) 97, (74) 103, (74) 107, (74) 123, (74) 157, (74) 215, (74) 229, (75) 29, (75) 65, (75) 95, (75) 133, (75) 159, (75) 165, (75) 217, (75) 225, (75) 231, (75) 265, (75) 275, (76) 7, (76) 45, (76) 101, (76) 141, (76) 149, (76) 175, (77) 17, (77) 27, (77) 151, (77) 231, (77) 261, (79) 1, (79) 17, (79) 45, (79) 53, (79) 87, (79) 105, (79) 111, (79) 121, (79) 147, (79) 203, (79) 237, (79) 281, (79) 285, (80) 87, (80) 171, Boolean functions (71) 149, (74) 91, (74) 191, (75) 79, (77) 1, (79) 135, (79) 167 Boxes (73) 213 Branching-linear spectrum (80) 51 Breadth-first search (76) 141 Breakthrough (77) 85 Broadcast (79) 99 Broadcasting (71) 81,(73) 131,(75) 71,(79) 53 Broadcasting with selective reduction (71) 71 BSP model (74) 141 BSR PRAM model (71) 43 Butterfly networks (75) 25 Byzantine failures (71) 35 Calculational mathematics (77) 137 Calculational proofs (77) 173 Calculational reasoning (77) 89 Case grammar (71) 29 Catastrophic faults (73) 199 Category theory (79) 249 Causal ordering (73) 169 Cayley graph (72) 131, (75) 25 Cells (71) 179 Center (71) 205 Chain code (80) 119 Checkpoint (80) 105 Chordal graph (73) 181 Circular-arc graph (73) 181 Claw-free graph (74) 115 Clique polynomials (75) 127 Clock synchronization (80) 151 Closure properties (75) 91 Clustering (76) 175 Clustering algorithms (80) 87 Clusters of points (79) 115 CMOS (77) 181 Code migration (79) 249 Codes (76) 1 Cographs (74) 129 Collapse (76) 61 Collection fusion (75) 35 Coloring (80) 159 Combinatorial designs (71) 35 Combinatorial optimization (74) 123, (75) 237 Combinatorial optimization problems (79) 261 Combinatorial problems (71) 97, (71) 107, (71) 149, (71) 183, (73) 29, (73) 77, (73) 153, (73) 163, (74) 81, (74) 191, (75) 29, (75) 133, (75) 265, (76) 1, (76) 39, (76) 51, (76) 113, (76) 169, (77) 43, (77) 197, (79) 155, (79) 173, (79) 203, (79) 281, (79) 285, (80) 213 Combinatorics (72) 47 Commit (79) 99 Common-multiplicand multiplication (76) 105 Communication-induced checkpointing protocol (80) 105 Communication networks (76) 83 Compact suffix automaton (80) 165 Comparison based dictionaries (80) 243 Competitive analysis (73) 61, (74) 73 Competitive ratio (76) 149 Compilers (72) 189, (75) 17, (77) 53 Complement representation (71) 159 Complexity (74) 97, (74) 129 Complexity analysis (72) 125 Components (77) 159 Compressed image (79) 1 Computational biology (80) 81 Computational complexity (71) 5, (71) 55, (71) 63, (71) 75, (71) 127, (71) 159, (72) 3, (72) 113, (72) 197, (73) 153, (73) 167, (73) 213, (74) 1, (74) 41, (74) 91, (74) 123, (74) 157, (74) 197, (75) 51, (75) 61, (75) 71, (75) 79, (75) 91, (75) 145, (76) 61, (76) 75, (76) 91, (77) 225, (79) 93, (79) 105, (79) 111, (79) 173, (79) 211, (79) 243, (79) 273, (79) 297, (80) 257 Computational complexity over the reals (72) 83 Computational geometry (71) 179, (71) 221, (72) 143, (72) 177, (73) 33, (74) 103, (74) 183, (74) 253, (75) 95, (75) 169, (76) 163, (77) 23, (77) 27, (79) 115, (79) 121, (79) 215, (79) 229, (79) 237, (80) 81, (80) 311 Computational learning (73) 213 Computational learning theory (75) 109, (79) 267 Computational power (75) 119 Computational problems in integer lattices (71) 55 Computer architecture (73) 189 Computer representation (77) 231 Computing with real numbers (77) 277 Concentration of measure (73) 47 Concurrency (71) 229, (72) 9, (73) 169, (76) 131, (77) 53, (77) 219, (77) 283, (79) 189, (80) 15, (80) 51, (80) 159, (80) 189 Conditional composition (80) 41 Conditional events (79) 155 Connected components (72) 83 Connectivity (72) 105, (73) 5, (77) 35 Consecutive-2 system (75) 231 Consensus (71) 155, (73) 207, (77) 63 Constraint Logic Programming (74) 147 Constraint programming (75) 17 Constraint propagation (74) 141 Constraints (72) 47 Continuous media (80) 225 Convex polygon (73) 33 Convexification of polygons (80) 81 Convexity (77) 225 Correlation immunity (71) 149, (74) 191 Counter machine (71) 193 Counting (76) 113 Counting classes (75) 91 Crash failure (73) 207 Cryptanalysis (75) 187, (80) 67, (80) 239, (80) 295 Cryptographic algorithm (71) 141 Cryptography (71) 1, (71) 149, (72) 3, (72) 77, (72) 169, (73) 93, (73) 97, (74) 175, (74) 191, (74) 243, (75) 187, (75) 211, (75) 255, (76) 67, (76) 95, (76) 101, (76) 105, (76) 135, (77) 209, (79) 93, (79) 135, (79) 167, (80) 113, (80) 239, (80) 261, (80) 295
📜 SIMILAR VOLUMES
Chung, K.-L., On finding medians of weighted discrete points 74 (2000) 103 Chung, K.-L. and W.-M. Yan, On the number of spanning trees of a multi-complete/star related graph 76 (2000) 113 Chung, K.-L. and W.-M. Yan, An efficient algorithm for the Fourier transform on a compressed image in restricted
the consecutive ones property for sparse matrices Averbakh, I. and O. Berman, (p -l)/(p + Ij-approximate algorithms for p-travelling salesmen problems on a tree with minmax objective 79 (1997) 63-66 73 (1997) 69-79 Bauer, D., J. van de n Heuvel, A. Morgana a nd E. Schmeichel, The complexity of recog
## Barendregt, H., Enumerators of lambda terms are reducing constructively Barendsen, E. and Bezem, M., Polymorphic extensions of simple type structures. With an application to a bar recursive minimization Barker, E.J., Back and forth relations for reduced abelian p-groups