Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             10 results found
no title author magazine year volume issue page(s) type
1 A randomized algorithm for finding maximum with O((log n)2) polynomial tests Ting, Hing F.
 1994
 49 1 p. 39-43
5 p.
 article
2 A shortest-path algorithm for Manhattan graphs Kanchanasut, Kanchana
 1994
 49 1 p. 21-25
5 p.
 article
3 Computing values of a polynomial with only few multiplications Veljan, D.
 1994
 49 1 p. 33-37
5 p.
 article
4 Distributed termination detection in reducible communication graphs Gianuzzi, Vittoria
 1994
 49 1 p. 1-8
8 p.
 article
5 Editorial Board 1994
 49 1 p. ii-
1 p.
 article
6 Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs Rhee, C.
 1994
 49 1 p. 45-50
6 p.
 article
7 On average time hierarchies Goldmann, Mikael
 1994
 49 1 p. 15-20
6 p.
 article
8 On finding the strongly connected components in a directed graph Nuutila, Esko
 1994
 49 1 p. 9-14
6 p.
 article
9 On generating B-trees with constant average delay and in lexicographic order Belbaraka, Mounir
 1994
 49 1 p. 27-32
6 p.
 article
10 The domatic number problem on some perfect graph families Kaplan, Haim
 1994
 49 1 p. 51-56
6 p.
 article
                             10 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands