AAAAAA

   
Results: 1-8 |
Results: 8
TRANSFORMING ROOTED AGREEMENT INTO UNROOTED AGREEMENT
Authors: PRZYTYCKA TM
Citation: Tm. Przytycka, TRANSFORMING ROOTED AGREEMENT INTO UNROOTED AGREEMENT, Journal of computational biology, 5(2), 1998, pp. 335-349
THE OPTIMAL ALPHABETIC TREE PROBLEM REVISITED
Authors: LARMORE LL PRZYTYCKA TM
Citation: Ll. Larmore et Tm. Przytycka, THE OPTIMAL ALPHABETIC TREE PROBLEM REVISITED, Journal of algorithms, 28(1), 1998, pp. 1-20
PARALLEL ALGORITHMS FOR THE HAMILTONIAN CYCLE AND HAMILTONIAN PATH PROBLEMS IN SEMICOMPLETE BIPARTITE DIGRAPHS
Authors: BANGJENSEN J ELHADDAD M MANOUSSAKIS Y PRZYTYCKA TM
Citation: J. Bangjensen et al., PARALLEL ALGORITHMS FOR THE HAMILTONIAN CYCLE AND HAMILTONIAN PATH PROBLEMS IN SEMICOMPLETE BIPARTITE DIGRAPHS, Algorithmica, 17(1), 1997, pp. 67-87
A PARALLEL ALGORITHM FOR OPTIMUM HEIGHT-LIMITED ALPHABETIC BINARY-TREES
Authors: LARMORE LL PRZYTYCKA TM
Citation: Ll. Larmore et Tm. Przytycka, A PARALLEL ALGORITHM FOR OPTIMUM HEIGHT-LIMITED ALPHABETIC BINARY-TREES, Journal of parallel and distributed computing, 35(1), 1996, pp. 49-56
PARALLEL MAXIMUM INDEPENDENT SET IN CONVEX BIPARTITE GRAPHS
Authors: CZUMAJ A DIKS K PRZYTYCKA TM
Citation: A. Czumaj et al., PARALLEL MAXIMUM INDEPENDENT SET IN CONVEX BIPARTITE GRAPHS, Information processing letters, 59(6), 1996, pp. 289-294
CONSTRUCTING HUFFMAN TREES IN PARALLEL
Authors: LARMORE LL PRZYTYCKA TM
Citation: Ll. Larmore et Tm. Przytycka, CONSTRUCTING HUFFMAN TREES IN PARALLEL, SIAM journal on computing, 24(6), 1995, pp. 1163-1169
ON THE AGREEMENT OF MANY TREES
Authors: FARACH M PRZYTYCKA TM THORUP M
Citation: M. Farach et al., ON THE AGREEMENT OF MANY TREES, Information processing letters, 55(6), 1995, pp. 297-301
A FAST ALGORITHM FOR OPTIMUM HEIGHT-LIMITED ALPHABETIC BINARY-TREES
Authors: LARMORE LL PRZYTYCKA TM
Citation: Ll. Larmore et Tm. Przytycka, A FAST ALGORITHM FOR OPTIMUM HEIGHT-LIMITED ALPHABETIC BINARY-TREES, SIAM journal on computing, 23(6), 1994, pp. 1283-1312
Risultati: 1-8 |