1. Relational database constraints as counterexamples

   • Levent V. Orman

   Pages: 167 - 189

2. Using graph coloring in an algebraic compiler

   • Teodor Rus
   • Sriram Pemmaraju

   Pages: 191 - 209

3. A generalized distribution model for random recursive trees

   • Alexander Shapiro

   Pages: 211 - 216

4. On the system of word equations x ⁱ ₁ x ⁱ ₂…x ⁱ _m=y ⁱ ₁ y ⁱ ₂…y ⁱ _n (i=1, 2, …) in a free monoid

   • Ismo Hakala
   • Juha Kortelainen

   Pages: 217 - 230

5. Reduced constants for simple cycle graph separation

   • Hristo N. Djidjev
   • Shankar M. Venkatesan

   Pages: 231 - 243