1. A time-space hierarchy between polynomial time and polynomial space

   • P. Clote

   OriginalPaper Pages: 77 - 92

2. Efficient distributed algorithms for single-source shortest paths and related problems on plane networks

   • Ravi Janardan
   • Siu Wing Cheng

   OriginalPaper Pages: 93 - 122

3. A note on weighted distributed match-making

   • Evangelos Kranakis
   • Paul M. B. Vitányi

   OriginalPaper Pages: 123 - 140

4. On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?

   • Sandy Irani
   • Moni Naor
   • Ronitt Rubinfeld

   OriginalPaper Pages: 141 - 159