On the expressive power of data dependencies Johann A. MakowskyMoshe Y. Vardi OriginalPaper Pages: 231 - 244
A workload model representative of static and dynamic characteristics M. CalzarossaM. ItalianiG. Serazzi OriginalPaper Pages: 255 - 266
Constructing maximal slicings from geometry M. TamminenW. K. LukC. K. Wong OriginalPaper Pages: 267 - 288
Graph theoretic closure properties of the family of boundary NLC graph languages Grzegorz RozenbergEmo Welzl OriginalPaper Pages: 289 - 309
NP-hard problems in hierarchical-tree clustering Mirko KřivánekJaroslav Morávek OriginalPaper Pages: 311 - 323
The complexity of combinatorial problems with succinct input representation Klaus W. Wagner OriginalPaper Pages: 325 - 356
