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
 
                             12 results found
no title author magazine year volume issue page(s) type
1 A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results Vikas, Narayan
 2005
 71 4 p. 406-439
34 p.
 article
2 An n 2 -bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet Honkala, Juha
 2005
 71 4 p. 506-519
14 p.
 article
3 An optimal self-stabilizing strarvation-free alternator Hakan Karaata, Mehmet
 2005
 71 4 p. 480-494
15 p.
 article
4 Approximation algorithms for covering/packing integer programs Kolliopoulos, Stavros G.
 2005
 71 4 p. 495-505
11 p.
 article
5 A refined search tree technique for Dominating Set on planar graphs Alber, Jochen
 2005
 71 4 p. 385-405
21 p.
 article
6 Bounds on the OBDD-size of integer multiplication via universal hashing Woelfel, Philipp
 2005
 71 4 p. 520-534
15 p.
 article
7 C2 - Ed. Board 2005
 71 4 p. CO2-
1 p.
 article
8 C4 - TOC 2005
 71 4 p. CO4-
1 p.
 article
9 Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons Dubhashi, Devdatt
 2005
 71 4 p. 467-479
13 p.
 article
10 Measuring nondeterminism in pushdown automata Goldstine, Jonathan
 2005
 71 4 p. 440-466
27 p.
 article
11 On the verification of finite failure Gori, Roberta
 2005
 71 4 p. 535-575
41 p.
 article
12 Papers to Appear 2005
 71 4 p. 576-
1 p.
 article
                             12 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands