Journals in DBLP

Theory Comput. Syst.
2003, volume: 36, number: 4

1. Eric Allender, Vikraman Arvind, Meena Mahajan
   Arithmetic Complexity, Kleene Closure, and Formal Power Series. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:4, pp:303-328 [Journal]
   
2. Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni
   Dynamic Generation of Discrete Random Variates. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:4, pp:329-358 [Journal]
   
3. Alina Beygelzimer, Mitsunori Ogihara
   The (Non)Enumerability of the Determinant and the Rank. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:4, pp:359-374 [Journal]
   
4. Jörg Rothe, Holger Spakowski, Jörg Vogel
   Exact Complexity of the Winner Problem for Young Elections. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:4, pp:375-386 [Journal]
   
5. Vince Grolmusz, Gábor Tardos
   A Note on Non-Deterministic Communication Complexity with Few Witnesses. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:4, pp:387-391 [Journal]