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