- Email: [email protected]
Subject index volume 67 (1998)
ELSEVIER
Information
Processing
Letters 67 (1998) 323-324
Subject Index Volume 67 (1998) Abelian monoids Algebraic complexity theory Algorithms 21, 57,75, Alphabetic trees Analysis of algorithms Anti-factorial language Approximate algorithms Approximate binary search Approximation algorithms Arbitrary CRCW PRAM Arrangements Asymptotic bound Automata Automatic theorem proving Avoiding a word
91, 177,227,231,
Backwards analysis Binary search Bisimulation Bottleneck traveling salesman problem Cache CAD Circuit complexity Combinatorial problems Communication complexity Competitive analysis Competitiveness Complexity of finite functions Composite moduli Computational complexity Computational geometry Concept learning Concurrency Coterie Counterfeit coin problem Cover-free families Cutting Planes proof Data strucmres Data-parallel algorithms Declarative programming Definitional trees Elsevier Science B.V.
43 81 239,255,261, 303 137 71, 125,137,295 111 261 261 267 141 273 227 221 43,215 111 303 137 119 105
305 267 87 57, 199,239,295 37,87 9 131 87 87 29, 37, 87, 105, 131, 141, 151, 205, 215,227,239,305,317 273 75 95,119, 185,277 191 131 57 37 163 21 1 1
Design of algorithms Dijkstra’s algorithm Disjoint paths Distributed computing Distributed systems EREW Error detection Euclidean TSP Event structures External memory Factor automaton Factor code Factorial language Failure detector Failure function Fault tolerance Fixed priority dispatching Forbidden word Force-directed algorithm Formal languages Formal semantics Formal series
9,31,95,295 317 283 191,289,295 151,157,191 21 151 231 119 305 111 111 111 289 111 51,289 65 111 177 91,95,111,221,277 119 221
Galois connections Global snapshot Graph coloring Graph drawing Group testing Group testing problem Guarded command
169 151 71 177 57 131 95
Hahn graph Hierarchical memory Hoare’s logic
105 305 145
Identity orientation Imprecise computation Instruction level parallelism Interactive computing Interconnection networks Interface equation Isometrical embeddings
227 311 305 13 283 185 199
324
k-mutual exclusion Knapsack problem Kolmogorov complexity
Subject Index Volume 67 (1998)
191 261 75,81
Learning Least cost paths Linear time algorithms Logic programming Longest detour Loop networks
131 317 267 145 51 157
Maximum cliques Maximum traveling salesman Minimize congestion Minimum spanning trees Modular arithmetic Monge matrix Monotone circuit Most critical edge Multiset sorting
255 125 267 303 157 231 37 51 141
Neededness Neural networks
1,245 177
Off-line routing algorithm On-line algorithms
283 9
Paging
9 267 305 163 31 65 105
Parallel computation Parallel random permutation generation Parity OBDDs Perfect graphs Performance evaluation Polynomird algorithms Polynomial time solvability Post Correspondence Problem PRAM Process algebra Program correctness Programming languages Prolog Pyramidally solvable case
29 13 21 95 145 1 145 231
Query learning Quorum
75 191
Random graphs Randomized algorithm
71 305
Randomized algorithms Randomized strategy Range searching Real computation Real time Real Turing machines Real-time systems Reduction algorithm Root-neededness Routing
87, 141,303 131 317 81 65 81 311 163 245 317
Sandwich problems Scheduling Scheduling analysis Self-organizing maps Semirings Sequentiality Shortest path Shortest paths Straight-line complexity Strategies Stretchability Strong sequentiality Submodule construction Syntactic congruences Syntactic nuclei
31 311 65 177 221 245 51,157 317 81 245 273
Term rewriting Termination Theory of computation Three-valued logic Threshold dimension 2 graphs Traces of set systems Transient edge failures Transition systems Traveling salesman problem Tree layout Turn constraints Two-way comparison search Visual languages Weakest liberal preconditions Weakest preconditions Weighted voting Zero-one law
185 221 221 1,43,245 43 91,163,205 95 255 199 51 119 231 21 317 137 13 145 145 191 29
Information
Processing
Letters 67 (1998) 323-324
Subject Index Volume 67 (1998) Abelian monoids Algebraic complexity theory Algorithms 21, 57,75, Alphabetic trees Analysis of algorithms Anti-factorial language Approximate algorithms Approximate binary search Approximation algorithms Arbitrary CRCW PRAM Arrangements Asymptotic bound Automata Automatic theorem proving Avoiding a word
91, 177,227,231,
Backwards analysis Binary search Bisimulation Bottleneck traveling salesman problem Cache CAD Circuit complexity Combinatorial problems Communication complexity Competitive analysis Competitiveness Complexity of finite functions Composite moduli Computational complexity Computational geometry Concept learning Concurrency Coterie Counterfeit coin problem Cover-free families Cutting Planes proof Data strucmres Data-parallel algorithms Declarative programming Definitional trees Elsevier Science B.V.
43 81 239,255,261, 303 137 71, 125,137,295 111 261 261 267 141 273 227 221 43,215 111 303 137 119 105
305 267 87 57, 199,239,295 37,87 9 131 87 87 29, 37, 87, 105, 131, 141, 151, 205, 215,227,239,305,317 273 75 95,119, 185,277 191 131 57 37 163 21 1 1
Design of algorithms Dijkstra’s algorithm Disjoint paths Distributed computing Distributed systems EREW Error detection Euclidean TSP Event structures External memory Factor automaton Factor code Factorial language Failure detector Failure function Fault tolerance Fixed priority dispatching Forbidden word Force-directed algorithm Formal languages Formal semantics Formal series
9,31,95,295 317 283 191,289,295 151,157,191 21 151 231 119 305 111 111 111 289 111 51,289 65 111 177 91,95,111,221,277 119 221
Galois connections Global snapshot Graph coloring Graph drawing Group testing Group testing problem Guarded command
169 151 71 177 57 131 95
Hahn graph Hierarchical memory Hoare’s logic
105 305 145
Identity orientation Imprecise computation Instruction level parallelism Interactive computing Interconnection networks Interface equation Isometrical embeddings
227 311 305 13 283 185 199
324
k-mutual exclusion Knapsack problem Kolmogorov complexity
Subject Index Volume 67 (1998)
191 261 75,81
Learning Least cost paths Linear time algorithms Logic programming Longest detour Loop networks
131 317 267 145 51 157
Maximum cliques Maximum traveling salesman Minimize congestion Minimum spanning trees Modular arithmetic Monge matrix Monotone circuit Most critical edge Multiset sorting
255 125 267 303 157 231 37 51 141
Neededness Neural networks
1,245 177
Off-line routing algorithm On-line algorithms
283 9
Paging
9 267 305 163 31 65 105
Parallel computation Parallel random permutation generation Parity OBDDs Perfect graphs Performance evaluation Polynomird algorithms Polynomial time solvability Post Correspondence Problem PRAM Process algebra Program correctness Programming languages Prolog Pyramidally solvable case
29 13 21 95 145 1 145 231
Query learning Quorum
75 191
Random graphs Randomized algorithm
71 305
Randomized algorithms Randomized strategy Range searching Real computation Real time Real Turing machines Real-time systems Reduction algorithm Root-neededness Routing
87, 141,303 131 317 81 65 81 311 163 245 317
Sandwich problems Scheduling Scheduling analysis Self-organizing maps Semirings Sequentiality Shortest path Shortest paths Straight-line complexity Strategies Stretchability Strong sequentiality Submodule construction Syntactic congruences Syntactic nuclei
31 311 65 177 221 245 51,157 317 81 245 273
Term rewriting Termination Theory of computation Three-valued logic Threshold dimension 2 graphs Traces of set systems Transient edge failures Transition systems Traveling salesman problem Tree layout Turn constraints Two-way comparison search Visual languages Weakest liberal preconditions Weakest preconditions Weighted voting Zero-one law
185 221 221 1,43,245 43 91,163,205 95 255 199 51 119 231 21 317 137 13 145 145 191 29