Journals in DBLP
J. Algorithms 1997, volume: 23, number: 2
Martin Loebl , Jaroslav Nesetril Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:207-220 [Journal ] C. Greg Plaxton , Torsten Suel Lower Bounds for Shellsort. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:221-240 [Journal ] Yair Bartal , Adi Rosén The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:241-264 [Journal ] Magnús M. Halldórsson Parallel and On-Line Graph Coloring. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:265-280 [Journal ] Akiyoshi Shioura , Takeaki Uno A Linear Time Algorithm for Finding a k-Tree Core. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:281-290 [Journal ] Lisa Higham , David G. Kirkpatrick , Karl R. Abrahamson , Andrew Adler Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:291-328 [Journal ] Biing-Feng Wang Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:345-358 [Journal ] Xiao Zhou , Hitoshi Suzuki , Takao Nishizeki An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:359-374 [Journal ] David Eppstein Minimum Range Balanced Cuts via Dynamic Subset Sums. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:375-385 [Journal ] Phillip G. Bradford , Rudolf Fleischer , Michiel H. M. Smid More Efficient Parallel Totally Monotone Matrix Searching. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:386-400 [Journal ] Samir Khuller Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:401-403 [Journal ]