Reference List of Indexed Articles

More documents

Recommendations

Info

$res://C:\Program Files\Microsoft ACT\act.exe/RPTSUMMARY.HTM$

364 Reference List / Information Processing Letters 78 (2001) 337–448 1066. M. Chrobak and B.S. Chlebus, Probabilistic Turing machines and recursively enumerable Dedekind cuts 19 (4) (1984) 167–171 1067. Ph. Darondeau and L. Kott, Towards a formal proof system for ω-rational expressions 19 (4) (1984) 173–177 1068. M. Chrobak, A note on bounded-reversal multipushdown machines 19 (4) (1984) 179–180 1069. D. Grune, How to produce all sentences from a two-level grammar 19 (4) (1984) 181–185 1070. A. Carpi, On the centers of the set of weakly square-free words on a two letter alphabet 19 (4) (1984) 187–190 1071. J. Král, On software equations 19 (4) (1984) 191–196 1072. M. Kallay, The complexity of incremental convex hull algorithms in R d 19 (4) (1984) 197 1073. C.H.C. Leung, Approximate storage utilisation of B-trees: A simple derivation and generalisations 19 (4) (1984) 199–201 1074. T.R. Walsh, How evenly should one divide to conquer quickly? 19 (4) (1984) 203–208 1075. L.W. Dowdy, D.L. Eager, K.D. Gordon and L.V. Saxton, Throughput concavity and response time convexity 19 (4) (1984) 209–212 1076. J. Karhumäki and D. Wood, Inverse morphic equivalence on languages 19 (5) (1984) 213–218 1077. G.N. Frederickson, On linear-time algorithms for five-coloring planar graphs 19 (5) (1984) 219–224 1078. E. Mäkinen, On derivation preservation 19 (5) (1984) 225–228 1079. D. Wood, The contour problem for rectilinear polygons 19 (5) (1984) 229–236 1080. P. Bourret, How to estimate the sizes of domains 19 (5) (1984) 237–243 1081. G. Tourlakis, An inductive number-theoretic characterization of NP 19 (5) (1984) 245–247 1082. J. Vyskoč, A note on Boolean matrix multiplication 19 (5) (1984) 249–251 1083. P. McKenzie, Permutations of bounded degree generate groups of polynomial diameter 19 (5) (1984) 253–254 1084. G. Gursel and P. Scheuermann, Asserting the optimality of serial SJRPs processing simple queries in chain networks 19 (5) (1984) 255–260 1085. C. Duboc, Some properties of commutation in free partially commutative monoids 20 (1) (1985) 1–4 1086. R.V. Book and F. Otto, Cancellation rules and extended word problems 20 (1) (1985) 5–11 1087. A. Mirzaian and E. Arjomandi, Selection in X + Y and matrices with sorted rows and columns 20 (1) (1985) 13–17 1088. E. Mäkinen, A note on undercover relation 20 (1) (1985) 19–21 1089. G.P. McKeown, A special purpose MIMD parallel processor 20 (1) (1985) 23–27 1090. S. Upendra Rao and A.K. Majumdar, An algorithm for local compaction of horizontal microprograms 20 (1) (1985) 29–33 1091. S. Passy and T. Tinchev, PDL with data constants 20 (1) (1985) 35–41 1092. S.L. Meira, A linear applicative solution for the Set Union Problem 20 (1) (1985) 43–45 1093. A.C. Bounas, Direct determination of a ‘seed’ binary matrix 20 (1) (1985) 47–50 1094. S. Jajodia, On equivalence of relational and network database models 20 (1) (1985) 51–54 1095. G. Bilardi and F.P. Preparata, The VLSI optimality of the AKS sorting network 20 (2) (1985) 55–59 1096. D.A. Plaisted, The undecidability of self-embedding for term rewriting systems 20 (2) (1985) 61–64 1097. J.L.A. van de Snepscheut, Evaluating expressions with a queue 20 (2) (1985) 65–66 1098. J. McLean, A comment on the ‘Basic Security Theorem’ of Bell and LaPadula 20 (2) (1985) 67–70 1099. K. Noshita, Translation of turner combinators in O(n log n) space 20 (2) (1985) 71–74 1100. P. Widmayer and C.K. Wong, An optimal algorithm for the maximum alignment of terminals 20 (2) (1985) 75–82 1101. S.R. Thatte, On the correspondence between two classes of reduction systems 20 (2) (1985) 83–85 1102. D. Harel and D. Peleg, More on looping vs. repeating in dynamic logic 20 (2) (1985) 87–90 1103. A.J. Auzins and E.B. Kinber, On separation of the emptiness and equivalence problems for program schemes 20 (2) (1985) 91–93 1104. D. Beauquier and D. Perrin, Codeterministic automata on infinite words 20 (2) (1985) 95–98 1105. E. Ukkonen, Upper bounds on the size of LR(k) parsers 20 (2) (1985) 99–103 1106. M.G. Main, An infinite square-free co-CFL 20 (2) (1985) 105–107 1107. S.C. Kak, How to detect tampering of data 20 (2) (1985) 109–110 1108. E.C. Njau, Details of distortions in the computed Fourier transforms of signals. Part I: Short periodic signals 20 (3) (1985) 111–113
Reference List / Information Processing Letters 78 (2001) 337–448 365 1109. E.D. Sontag, Real addition and the polynomial hierarchy 20 (3) (1985) 115–120 1110. M.Y. Chan, A note on redundant Disk Modulo allocation 20 (3) (1985) 121–123 1111. A.J. Martin, The probe: An addition to communication primitives 20 (3) (1985) 125–130 1112. E. Lodi and F. Luccio, Split sequence hash search 20 (3) (1985) 131–136 1113. R. Cole and C.K. Yap, A parallel median algorithm 20 (3) (1985) 137–139 1114. E. Mäkinen, An undecidable problem for context-free grammars 20 (3) (1985) 141–142 1115. Y.H. Tsin, An optimal parallel processor bound in strong orientation of an undirected graph 20 (3) (1985) 143–146 1116. B. Awerbuch, A new distributed depth-first-search algorithm 20 (3) (1985) 147–150 1117. J. Shallit and A. Shamir, Number-theoretic functions which are equivalent to number of divisors 20 (3) (1985) 151–153 1118. H. Volger, Some results on addition/subtraction chains 20 (3) (1985) 155–160 1119. W.M. Beynon and C.S. Iliopoulos, Computing a basis for a finite abelian p-group 20 (3) (1985) 161–163 1120. P.K. Srimani, Comments on “Another solution of the mutual exclusion problem” (Letter to the Editor) 20 (3) (1985) 165 1121. E. Welzl, Constructing the visibility graph for n-line segments in O(n 2 ) time 20 (4) (1985) 167–171 1122. M. Joseph, On a problem in real-time computing 20 (4) (1985) 173–177 1123. N. Santoro and J.B. Sidney, Interpolation-binary search 20 (4) (1985) 179–181 1124. K. Rangarajan and S. Arun-Kumar, Fair derivations in E0L systems 20 (4) (1985) 183–188 1125. C. Morgan, Global and logical time in distributed algorithms 20 (4) (1985) 189–194 1126. D.S. Wise, Representing matrices as quadtrees for parallel processors 20 (4) (1985) 195–199 1127. J.M. Keil, Finding Hamiltonian circuits in interval graphs 20 (4) (1985) 201–206 1128. W.J. van Gils, How to cope with faulty processors in a completely connected network of communicating processors 20 (4) (1985) 207–213 1129. C.S. Iliopoulos, Analysis of algorithms on problems in general abelian groups 20 (4) (1985) 215–220 1130. A. Yehudai, A note on chains of deterministic pushdown transducers 20 (4) (1985) 221–222 1131. M. Ślusarek, A note on the dynamic storage allocation problem 20 (5) (1985) 223–227 1132. J.H. Reif, Depth-first search is inherently sequential 20 (5) (1985) 229–234 1133. U. Vishkin, On efficient parallel strong orientation 20 (5) (1985) 235–240 1134. J. Hartmanis, Independence results about context-free languages and lower bounds 20 (5) (1985) 241– 248 1135. J.R. Bitner, Storing matrices on disk for efficient row and column retrieval 20 (5) (1985) 249–254 1136. L. Devroye, A note on the expected time required to construct the outer layer 20 (5) (1985) 255–257 1137. C.H. Papadimitriou, An algorithm for shortest-path motion in three dimensions 20 (5) (1985) 259–263 1138. H. Samet, Bidirectional coroutines 21 (1) (1985) 1–6 1139. J. Hromkovič, Alternating multicounter machines with constant number of reversals 21 (1) (1985) 7–9 1140. M. Negri and G. Pelagatti, Join during merge: An improved sort based algorithm 21 (1) (1985) 11–16 1141. G. Guralnik, C. Zemach and T. Warnock, An algorithm for uniform random sampling of points in and on a hypersphere 21 (1) (1985) 17–21 1142. L. Pagli, Self-adjusting hash tables 21 (1) (1985) 23–25 1143. D. Kapur and M.S. Krishnamoorthy, Worst-case choice for the stable marriage problem 21 (1) (1985) 27–30 1144. S.M. Oh and J.C.H. Park, A note on removing loops from table-driven code generators 21 (1) (1985) 31–34 1145. M.M. Yung, A secure and useful “keyless cryptosystem” 21 (1) (1985) 35–38 1146. H. Edelsbrunner and H.A. Maurer, Finding extreme points in three dimensions and solving the post-office problem in the plane 21 (1) (1985) 39–47 1147. I. Wegener, Optimal search with positive switch cost is NP-hard 21 (1) (1985) 49–52 1148. T. Yokomori, D. Wood and K.-J. Lange, A three-restricted normal form theorem for ETOL languages (Erratum) 21 (1) (1985) 53 1149. V.J. Lumelsky, On fast computation of distance between line segments 21 (2) (1985) 55–61 1150. T. Räuchle and S. Toueg, Exposure to deadlock for communicating processes is hard to detect 21 (2) (1985) 63–68 1151. A. Kaldewaij, On the decomposition of sequences into ascending subsequences 21 (2) (1985) 69 1152. J. Hromkovič, Linear lower bounds on unbounded fan-in Boolean circuits 21 (2) (1985) 71–74
Page 1 and 2: Information Processing Letters 78 (
Page 3 and 4: Reference List / Information Proces
Page 27: Reference List / Information Proces
Page 79 and 80:
Reference List / Information Proces
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
show all

Reference List of Indexed Articles

Create successful ePaper yourself

Delete template?

Save as template?