Journals in DBLP

Theory Comput. Syst.
1998, volume: 31, number: 5

1. Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
   Competitive Analysis of On-Line Disk Scheduling. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:5, pp:491-506 [Journal]
   
2. Andrzej Lingas, V. Soltan
   Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:5, pp:507-538 [Journal]
   
3. Eric Allender, Klaus-Jörn Lange
   RUSPACE(log n) $\subseteq$ DSPACE (log² n / log log n). [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:5, pp:539-550 [Journal]
   
4. Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff
   Periodic Merging Networks. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:5, pp:551-578 [Journal]
   
5. Kazuyoshi Hayase, Hiroshi Imai
   OBDDs of a Monotone Function and Its Prime Implicants. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:5, pp:570-591 [Journal]
   
6. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
   Efficient List Ranking on the Reconfigurable Mesh with Applications. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:5, pp:593-611 [Journal]
   
7. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud
   Computing the Maximum Overlap of Two Convex Polygons under Translations. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:5, pp:613-628 [Journal]