Reference List of Indexed Articles
Reference List of Indexed Articles
Reference List of Indexed Articles
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
360 <strong>Reference</strong> <strong>List</strong> / Information Processing Letters 78 (2001) 337–448<br />
902. G.N. Frederickson, Scheduling unit-time tasks with integer release times and deadlines 16 (4) (1983)<br />
171–173<br />
903. E.L. Lloyd, On a simple deadlock recovery problem 16 (4) (1983) 175–178<br />
904. M. Crochemore, M. Le Rest and P. Wender, An optimal test on finite unavoidable sets <strong>of</strong> words 16 (4)<br />
(1983) 179–180<br />
905. C.K. Yap, A hybrid algorithm for the shortest path between two nodes in the presence <strong>of</strong> few negative arcs<br />
16 (4) (1983) 181–182<br />
906. T. Tsuda, T. Sato and T. Tatsumi, Generalization <strong>of</strong> Floyd’s model on permuting information in idealized<br />
two-level storage 16 (4) (1983) 183–188<br />
907. M. Fushimi, Increasing the orders <strong>of</strong> equidistribution <strong>of</strong> the leading bits <strong>of</strong> the Tausworthe sequence 16<br />
(4) (1983) 189–192<br />
908. B. Chazelle, An improved algorithm for the fixed-radius neighbor problem 16 (4) (1983) 193–198<br />
909. W. Rytter, A simulation result for two-way pushdown automata 16 (4) (1983) 199–202<br />
910. A. Bossi, N. Cocco and L. Colussi, A divide-and-conquer approach to general context-free parsing 16<br />
(4) (1983) 203–208<br />
911. U. Schöning, On the structure <strong>of</strong> p 2 16 (4) (1983) 209–211<br />
912. F. Lockwood Morris, Letter to the Editor 16 (4) (1983) 215<br />
913. E.W. Dijkstra, W.H.J. Feijen and A.J.M. van Gasteren, Derivation <strong>of</strong> a termination detection algorithm for<br />
distributed computations 16 (5) (1983) 217–219<br />
914. A. Duda, The effects <strong>of</strong> checkpointing on program execution time 16 (5) (1983) 221–229<br />
915. A. Carpi, On the size <strong>of</strong> a square-free morphism on a three letter alphabet 16 (5) (1983) 231–235<br />
916. F. Murtagh, Expected-time complexity results for hierarchic clustering algorithms which use cluster centres<br />
16 (5) (1983) 237–241<br />
917. K. Ozawa, Considerations on the similarity measures between index terms 16 (5) (1983) 243–246<br />
918. J. Cohen, A note on a fast algorithm for sparse matrix multiplication 16 (5) (1983) 247–248<br />
919. J. Zahorjan, B.J. Bell and K.C. Sevcik, Estimating block transfers when record access probabilities are<br />
non-uniform 16 (5) (1983) 249–252<br />
920. R.E. Tarjan, Updating a balanced search tree in O(1) rotations 16 (5) (1983) 253–257<br />
921. H.P. Kriegel and Y.S. Kwong, Insertion-safeness in balanced trees 16 (5) (1983) 259–264<br />
922. R. Freund, Init and Anf operating on ω-languages 16 (5) (1983) 265–269<br />
923. M.C. Er, Computing sums <strong>of</strong> order-k Fibonacci numbers in log time 17 (1) (1983) 1–5<br />
924. M. Willett, Trapdoor knapsacks without superincreasing structure 17 (1) (1983) 7–11<br />
925. F. Cesarini and G. Soda, An algorithm to construct a compact B-tree in case <strong>of</strong> ordered keys 17 (1) (1983)<br />
13–16<br />
926. R.C. Richards, Shape distribution <strong>of</strong> height-balanced trees 17 (1) (1983) 17–20<br />
927. H.R. Tirri, Simulation, reduction and preservation <strong>of</strong> correctness properties <strong>of</strong> parallel systems 17 (1)<br />
(1983) 21–27<br />
928. M. Broy, Denotational semantics <strong>of</strong> communicating processes based on a language for applicative<br />
multiprogramming 17 (1) (1983) 29–35<br />
929. R.E. Tarjan, An improved algorithm for hierarchical clustering using strong components 17 (1) (1983)<br />
37–41<br />
930. S.P. Rana, A distributed solution <strong>of</strong> the distributed termination problem 17 (1) (1983) 43–46<br />
931. M.H. Williams, Is an exit statement sufficient? 17 (1) (1983) 47–51<br />
932. C. Croitoru and E. Suditu, Perfect stables in graphs 17 (1) (1983) 53–56<br />
933. J.R. Nawrocki, Contiguous segmentation with limited compacting 17 (2) (1983) 57–62<br />
934. M.J. Magazine, Optimality <strong>of</strong> intuitive checkpointing policies 17 (2) (1983) 63–66<br />
935. M.-T. Shing, Optimum ordered bi-weighted binary trees 17 (2) (1983) 67–70<br />
936. J. Vyskoč, A note on the power <strong>of</strong> integer division 17 (2) (1983) 71–72<br />
937. P. Tong and E.L. Lawler, A faster algorithm for finding edge-disjoint branchings 17 (2) (1983) 73–76<br />
938. A. Shamir, Embedding cryptographic trapdoors in arbitrary knapsack systems 17 (2) (1983) 77–79<br />
939. D.E. Willard, Log-logarithmic worst-case range queries are possible in space (N) 17 (2) (1983) 81–84<br />
940. Y. Kobuchi, Stability <strong>of</strong> desynchronized 0L systems 17 (2) (1983) 85–90<br />
941. P. De Bra and J. Paredaens, An algorithm for horizontal decompositions 17 (2) (1983) 91–95<br />
942. A.A. Bertossi, Finding Hamiltonian circuits in proper interval graphs 17 (2) (1983) 97–101<br />
943. A. Schorr, Physical parallel devices are not much faster than sequential ones 17 (2) (1983) 103–106
Change language