- Email: [email protected]
Subject Index — Volume 99 (2006)
Information Processing Letters 99 (2006) 252–253 www.elsevier.com/locate/ipl
Subject Index — Volume 99 (2006)
Acyclic dominating set 139 Acyclic edge colouring 227 Algorithms 87, 96, 130, 139, 158, 175, 181, 199, 203 Analysis of algorithms 54, 87, 119, 158, 181, 227, 246 Approximation algorithms 87, 119, 125, 187, 195, 230, 234 Automata 27
Diffie–Hellman problem Discrete logarithm problem Dominating set
145 145 139
Elias code Empirical entropy
175 246
Binding-time improvement Bipartite permutation graph Birthday paradox Blocking Bounded static variation Boundedness Boyer–Moore string-matching algorithm BSS-machines
Fast generators Fast matrix multiplication Fault tolerance Feature Fixed priority scheduling Formal languages Formal methods Functional programming
158 139 246 83 158 208 158 72
Caching 96 Choosability 68 Chromatic number 59 Circle packing 125 Classical natural deduction 163 Closure system 199 Coding 175 Coloring 7, 68 Combinatorial problems 13, 33, 47, 68, 92 Communication complexity 149 Competitive ratio 102 Compression 175 Computational complexity 13, 72, 87, 149, 171, 192, 215, 239 Computational geometry 59, 125 Concurrency 208 Connectivity 41 Continuation passing style translation 163 Contour integration 19 Covering problems 195 Cryptography 135, 145, 154 Data compression Data structures de Bruijn sequences Decidability Degree sequence Descendant of a tree language Design of algorithms Determinization 0020-0190/2006 Published by Elsevier B.V. doi:10.1016/S0020-0190(06)00189-X
246 19, 158 246 208, 222 41 111 158 222
Game theory Graph algorithms Graph colorability Graph divisibility Graph products
145 130 41, 92 106 83 27, 33, 111 222 158 239 1, 54, 64, 119, 192, 234 215 59 7
Halin graph Hamming codes Hamming distance Helly hypergraphs Helly property Horspool string-matching algorithm Huffman code Hypergraphs
47 7 149 13 13 158 175 130
Index Information rate Information retrieval Interconnection networks Intersecting sets Intersection graphs Interval-filament graph
19 154 175 7 13 59 59
Kolmogorov complexity
246
Lattice List-coloring Locally adaptive code
199 68 175
Information Processing Letters 99 (2006) 252–253
Longest common subsequence Longest increasing subsequence
203 203
Map labeling Markov processes Maximum degree Maximum weight matching Minimum degree Minimum implicational basis Minimum-redundancy code Monadic term rewrite system Multi-machine scheduling
125 246 41 119 41 199 175 111 102
Normal numbers NP-completeness
246 171
Online algorithms Optimality Oriented coloring
102 83 47
Parallel algorithms Parametric-search method Partial evaluation Path factor Perfect graph Permutative conversion Planar graph Polygon-circle graph Priority assignment Priority ceiling protocol Probabilistic analysis Probabilistic queues Program correctness Program derivation Program specification Programming calculi Programming languages Projective Turing machines Pure strategy Nash equilibrium
119 187 158 230 59 163 1 59 83 83 19 96 158 158 158 163 158 72 239
Randomized algorithms Real-time systems Recognizability Relative entropy Retrieval Reuse Safe recursion Secret sharing Selection Self-information Self-reducibility Separability Shannon’s entropy Shortest paths Signature files Signature identifiers Signature trees Signcryption Simultaneous embedding Software design and implementation Software engineering Software product line Specification languages Strong normalization Subcubic graph Synchronized nets T ETRAVEX Theory of computation Threshold phenomena Timed automata Trapdoor Tree-automata Tree automaton Trees
253
92, 96 83 27 246 106 106 72 154 181 246 215 27 246 192 19 19 19 135 1 158 106 106 222 163 230 208 171 72, 87, 158 246 222 145 33 111 7
Uniform machines
102
Variation point
106
Subject Index — Volume 99 (2006)
Acyclic dominating set 139 Acyclic edge colouring 227 Algorithms 87, 96, 130, 139, 158, 175, 181, 199, 203 Analysis of algorithms 54, 87, 119, 158, 181, 227, 246 Approximation algorithms 87, 119, 125, 187, 195, 230, 234 Automata 27
Diffie–Hellman problem Discrete logarithm problem Dominating set
145 145 139
Elias code Empirical entropy
175 246
Binding-time improvement Bipartite permutation graph Birthday paradox Blocking Bounded static variation Boundedness Boyer–Moore string-matching algorithm BSS-machines
Fast generators Fast matrix multiplication Fault tolerance Feature Fixed priority scheduling Formal languages Formal methods Functional programming
158 139 246 83 158 208 158 72
Caching 96 Choosability 68 Chromatic number 59 Circle packing 125 Classical natural deduction 163 Closure system 199 Coding 175 Coloring 7, 68 Combinatorial problems 13, 33, 47, 68, 92 Communication complexity 149 Competitive ratio 102 Compression 175 Computational complexity 13, 72, 87, 149, 171, 192, 215, 239 Computational geometry 59, 125 Concurrency 208 Connectivity 41 Continuation passing style translation 163 Contour integration 19 Covering problems 195 Cryptography 135, 145, 154 Data compression Data structures de Bruijn sequences Decidability Degree sequence Descendant of a tree language Design of algorithms Determinization 0020-0190/2006 Published by Elsevier B.V. doi:10.1016/S0020-0190(06)00189-X
246 19, 158 246 208, 222 41 111 158 222
Game theory Graph algorithms Graph colorability Graph divisibility Graph products
145 130 41, 92 106 83 27, 33, 111 222 158 239 1, 54, 64, 119, 192, 234 215 59 7
Halin graph Hamming codes Hamming distance Helly hypergraphs Helly property Horspool string-matching algorithm Huffman code Hypergraphs
47 7 149 13 13 158 175 130
Index Information rate Information retrieval Interconnection networks Intersecting sets Intersection graphs Interval-filament graph
19 154 175 7 13 59 59
Kolmogorov complexity
246
Lattice List-coloring Locally adaptive code
199 68 175
Information Processing Letters 99 (2006) 252–253
Longest common subsequence Longest increasing subsequence
203 203
Map labeling Markov processes Maximum degree Maximum weight matching Minimum degree Minimum implicational basis Minimum-redundancy code Monadic term rewrite system Multi-machine scheduling
125 246 41 119 41 199 175 111 102
Normal numbers NP-completeness
246 171
Online algorithms Optimality Oriented coloring
102 83 47
Parallel algorithms Parametric-search method Partial evaluation Path factor Perfect graph Permutative conversion Planar graph Polygon-circle graph Priority assignment Priority ceiling protocol Probabilistic analysis Probabilistic queues Program correctness Program derivation Program specification Programming calculi Programming languages Projective Turing machines Pure strategy Nash equilibrium
119 187 158 230 59 163 1 59 83 83 19 96 158 158 158 163 158 72 239
Randomized algorithms Real-time systems Recognizability Relative entropy Retrieval Reuse Safe recursion Secret sharing Selection Self-information Self-reducibility Separability Shannon’s entropy Shortest paths Signature files Signature identifiers Signature trees Signcryption Simultaneous embedding Software design and implementation Software engineering Software product line Specification languages Strong normalization Subcubic graph Synchronized nets T ETRAVEX Theory of computation Threshold phenomena Timed automata Trapdoor Tree-automata Tree automaton Trees
253
92, 96 83 27 246 106 106 72 154 181 246 215 27 246 192 19 19 19 135 1 158 106 106 222 163 230 208 171 72, 87, 158 246 222 145 33 111 7
Uniform machines
102
Variation point
106