| 299 | -- | 300 | Roman Smolensky. Well-Known Bound for the VC-Dimension Made Easy |
| 301 | -- | 311 | Victor Shoup, Roman Smolensky. Lower Bounds for Polynomial Evaluation and Interpolation Problems |
| 312 | -- | 340 | Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari. The Electrical Resistance of a Graph Captures its Commute and Cover Times |
| 341 | -- | 356 | Uriel Feige. Collecting Coupons on Trees, and the Cover Time of Random Walks |
| 357 | -- | 375 | Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky. A Lower Bound for Randomized Algebraic Decision Trees |
| 376 | -- | 388 | Dima Grigoriev, Marek Karpinski, Roman Smolensky. Randomization and the Computational Power of Analytic and Algebraic Decision Trees |