A time-space hierarchy between polynomial time and polynomial space P. Clote OriginalPaper Pages: 77 - 92
Efficient distributed algorithms for single-source shortest paths and related problems on plane networks Ravi JanardanSiu Wing Cheng OriginalPaper Pages: 93 - 122
A note on weighted distributed match-making Evangelos KranakisPaul M. B. Vitányi OriginalPaper Pages: 123 - 140
On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? Sandy IraniMoni NaorRonitt Rubinfeld OriginalPaper Pages: 141 - 159