Reference List of Indexed Articles

More documents

Recommendations

Info

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

384 Reference List / Information Processing Letters 78 (2001) 337–448 1833. N. Francez, Cooperating proofs for distributed programs with multiparty interactions 32 (5) (1989) 235– 242 1834. H. Everett and A. Gupta, Acyclic directed hypercubes may have exponential diameter 32 (5) (1989) 243–245 1835. G.A. Cheston, A. Farley, S.T. Hedetniemi and A. Proskurowski, Centering a spanning tree of a biconnected graph 32 (5) (1989) 247–250 1836. D.A.M. Barrington and J. Corbett, On the relative complexity of some languages in NC 1 32 (5) (1989) 251–256 1837. A. Clouâtre, N. Laliberté and T.H. Merrett, A general implementation of relational recursion with speedup techniques for programmers 32 (5) (1989) 257–262 1838. G.H. Roberts, Another note on recursive ascent 32 (5) (1989) 263–266 1839. G. Baron and F. Urbanek, Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities 32 (5) (1989) 267–269 1840. E. Mäkinen, On the subtree isomorphism problem for ordered trees 32 (5) (1989) 271–273 1841. P.P. Chakrabarti, S. Ghose, A. Pandey and S.C. De Sarkar, Increasing search efficiency using multiple heuristics (Corrigendum) 32 (5) (1989) 275 1842. S. Shiraishi, A parallel algorithm for the maximum 2-chain edge packing problem 32 (6) (1989) 277–279 1843. S. Abiteboul, Boundedness is undecidable for Datalog programs with a single recursive rule 32 (6) (1989) 281–287 1844. H. Alblas, Optimal incremental simple multi-pass attribute evaluation 32 (6) (1989) 289–295 1845. M. Padberg and A. Sassano, The complexity of matching with bonds 32 (6) (1989) 297–300 1846. R.L. Drysdale III and J.W. Jaromczyk, A note on lower bounds for the maximum area and maximum perimeter k-gon problems 32 (6) (1989) 301–303 1847. A.M. Gibbons and Y.N. Srikant, A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation 32 (6) (1989) 305–311 1848. R. Demolombe and A. Illarramendi, Heuristics for syntactical optimization of relational queries 32 (6) (1989) 313–316 1849. S. Abiteboul, M. Gyssens and D. van Gucht, An alternative way to represent the cogroup of a relation in the context of nested databases 32 (6) (1989) 317–324 1850. Y. Toyama, Fast Knuth–Bendix completion with a term rewriting system compiler 32 (6) (1989) 325–328 1851. B.S. Veroy, Optimal search algorithm for a minimum of a discrete periodic bimodal function (Corrigendum) 32 (6) (1989) 329 1852. B.S. Veroy, Average complexity of divide-and-conquer algorithms (Corrigendum) 32 (6) (1989) 329 1853. Z. Fülöp and S. Vágvölgyi, Top-down tree transducers with deterministic top-down look-ahead 33 (1) (1989) 3–5 1854. S.J. Wan and S.K.M. Wong, An adaptive algorithm for finding a covering hypersphere 33 (1) (1989) 7–10 1855. D.-L. Lee, On access and alignment of data in a parallel processor 33 (1) (1989) 11–14 1856. M.E. Majster-Cederbaum, The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces 33 (1) (1989) 15–19 1857. J. Misra, A simple proof of a simple consensus algorithm 33 (1) (1989) 21–24 1858. G. Taubenfeld, Leader election in the presence of n − 1 initial failures 33 (1) (1989) 25–28 1859. A. Srinivasa Rao and C. Pandu Rangan, Linear algorithm for domatic number problem in interval graphs 33 (1) (1989) 29–33 1860. B. Dasgupta and C.E. Veni Madhavan, An approximate algorithm for the minimal vertex nested polygon problem 33 (1) (1989) 35–44 1861. K.-F. Wong, Comments on “A comparison of concatenated and superimposed code word surrogate files for very large data/knowledge bases” 33 (1) (1989) 45–52 1862. M. Raynal, Prime numbers as a tool to design distributed algorithms 33 (1) (1989) 53–58 1863. D. Avis, J.M. Robert and R. Wenger, Lower bounds for line stabbing 33 (2) (1989) 59–62 1864. C. Buchta, On the average number of maxima in a set of vectors 33 (2) (1989) 63–65 1865. K.-L. Chung, W.-C. Chen and F.-C. Lin, Fast computation of periodic continued fractions 33 (2) (1989) 67–72 1866. A. Szepietowski, Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space 33 (2) (1989) 73–78
Reference List / Information Processing Letters 78 (2001) 337–448 385 1867. W. Thome and R. Wilhelm, Simulating circular attribute grammars through attribute reevaluation 33 (2) (1989) 79–81 1868. M. Dietzfelbinger, The speed of copying on one-tape off-line Turing machines 33 (2) (1989) 83–89 1869. A.A. Schäffer, Optimal node ranking of trees in linear time 33 (2) (1989) 91–96 1870. S. Ceri, G. Gottlob, L. Tanca and G. Wiederhold, Magic semi-joins 33 (2) (1989) 97–107 1871. A. Szepietowski, Some notes on strong and weak log log n space complexity 33 (2) (1989) 109–112 1872. R. Grossi and F. Luccio, Simple and efficient string matching with k mismatches 33 (3) (1989) 113–120 1873. T. Shoudai, The lexicographically first topological order problem is NLOG-complete 33 (3) (1989) 121– 124 1874. L. Lopriore, Software-controlled cache coherence protocol for multicache systems 33 (3) (1989) 125– 130 1875. E.R. McCurley, Auxiliary variables in partial correctness programming logics 33 (3) (1989) 131–133 1876. S.G. Akl, D. Gries and I. Stojmenović, An optimal parallel algorithm for generating combinations 33 (3) (1989) 135–139 1877. R.V. Book and S. Tang, A note on sparse sets and the polynomial-time hierarchy 33 (3) (1989) 141–143 1878. R.B. Boppana, The average-case parallel complexity of sorting 33 (3) (1989) 145–146 1879. A. Srinivasa Rao and C. Pandu Rangan, Optimal parallel algorithms on circular-arc graphs 33 (3) (1989) 147–156 1880. B. Parker and I. Parberry, Constructing sorting networks from k-sorters 33 (3) (1989) 157–162 1881. R. Berghammer, G. Schmidt and H. Zierer, Symmetric quotients and domain constructions 33 (3) (1989) 163–168 1882. J. Hershberger, Finding the upper envelope of n line segments in O(n log n) time 33 (4) (1989) 169–174 1883. D.T. Lee and F.P. Preparata, Parallel batched planar point location on the CCC 33 (4) (1989) 175–179 1884. T. Hagerup and C. Rüb, Optimal merging and sorting on the EREW PRAM 33 (4) (1989) 181–185 1885. C. Levcopoulos and O. Petersson, A note on adaptive parallel sorting 33 (4) (1989) 187–191 1886. E. Wanke and M. Wiegers, Undecidability of the bandwidth problem on linear graph languages 33 (4) (1989) 193–197 1887. J.D.P. Rolim, On the polynomial IO-complexity 33 (4) (1989) 199–204 1888. J. Boreddy and R.N. Mukherjee, An algorithm to find polygon similarity 33 (4) (1989) 205–206 1889. R. Zippel, An explicit separation of relativised random polynomial time and relativised deterministic polynomial time 33 (4) (1989) 207–212 1890. J. Žerovnik, A randomised heuristical algorithm for estimating the chromatic number of a graph 33 (4) (1989) 213–219 1891. P. Crescenzi and R. Silvestri, Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems 33 (5) (1990) 221–226 1892. H. Suzuki, N. Takahashi and T. Nishizeki, A linear algorithm for bipartition of biconnected graphs 33 (5) (1990) 227–231 1893. Y. Han and Y. Igarashi, Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays 33 (5) (1990) 233–238 1894. J. Kämper, A result relating disjunctive self-reducibility to P-immunity 33 (5) (1990) 239–242 1895. C.S. Kannan and H.Y.H. Chuang, Fast Hough transform on a mesh connected processor array 33 (5) (1990) 243–248 1896. L. Boxer and R. Miller, Common intersections of polygons 33 (5) (1990) 249–254 1897. D. Agrawal and A. El Abbadi, Exploiting logical structures in replicated databases 33 (5) (1990) 255–260 1898. V. Shoup, On the deterministic complexity of factoring polynomials over finite fields 33 (5) (1990) 261– 267 1899. R.J. Anderson and G.L. Miller, A simple randomized parallel algorithm for list-ranking 33 (5) (1990) 269–273 1900. A.A. Bertossi and S. Moretti, Parallel algorithms on circular-arc graphs 33 (6) (1990) 275–281 1901. M.B. Dillencourt, Realizability of Delaunay triangulations 33 (6) (1990) 283–287 1902. N.J. Gunther and J.G. Shaw, Path integral evaluation of ALOHA network transients 33 (6) (1990) 289– 295 1903. T. Altman and B.S. Chlebus, Sorting roughly sorted sequences in parallel 33 (6) (1990) 297–300 1904. S. Olariu, A generalization of Chvátal’s Star-Cutset Lemma 33 (6) (1990) 301–303 1905. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds 33 (6) (1990) 305–308
Page 1 and 2: Information Processing Letters 78 (
Page 3 and 4: Reference List / Information Proces
Page 47: Reference List / Information Proces
Page 99 and 100:
Reference List / Information Proces
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?