|
Journals in DBLP
- Ton Kloks, Dieter Kratsch
Listing All Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:605-613 [Journal]
- Hisao Tamaki
Efficient Self-Embedding of Butterfly Networks with Random Faults. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:614-636 [Journal]
- Harry Buhrman, Albrecht Hoene, Leen Torenvliet
Splittings, Robustness, and Structure of Complete Sets. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:637-653 [Journal]
- Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:654-667 [Journal]
- Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:668-681 [Journal]
- Susanne Albers
Improved Randomized On-Line Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:682-693 [Journal]
- Dima Grigoriev, Marek Karpinski
Computing the Additive Complexity of Algebraic Circuits with Root Extracting. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:694-701 [Journal]
- Eyal Kushilevitz, Yishay Mansour
An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:702-712 [Journal]
- Paolo Ferragina, Roberto Grossi
Optimal On-Line Search and Sublinear Time Update in String Matching. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:713-736 [Journal]
- Shafi Goldwasser
Introduction to Special Section on Probabilistic Proof Systems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:737-738 [Journal]
- Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson
On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:739-762 [Journal]
- Ran Raz
A Parallel Repetition Theorem. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:763-803 [Journal]
- Mihir Bellare, Oded Goldreich, Madhu Sudan
Free Bits, PCPs, and Nonapproximability-Towards Tight Results. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:804-915 [Journal]
|