Journal of Algorithms, Volume 16

Volume 16, Number 1, January 1994

• U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
  Improving Greedy Algorithms by Lookahead-Search. 1-23
  
• Lajos Rónyai:
  A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q. 24-32
  
• Kaizhong Zhang, Dennis Shasha, Jason Tsong-Li Wang:
  Approximate Tree Matching in the Presence of Variable Length Don't Cares. 33-66
  
• Rakesh M. Verma:
  A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications. 67-79
  
• Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster:
  The Algorithmic Aspects of the Regularity Lemma. 80-109
  
• Jonathan Sorenson:
  Two Fast GCD Algorithms. 110-144
  
• Tze-Heng Ma, Jeremy Spinrad:
  An O(n²) Algorithm for Undirected Split Decompositon. 154-160
  

Volume 16, Number 2, March 1994

• Livio Colussi:
  Fastest Pattern Matching in Strings. 163-189
  
• Kazuo Iwama, Yahiko Kambayashi:
  A Simpler Parallel Algorithm for Graph Conectivity. 190-217
  
• Jean-Paul Doignon, Jean-Claude Falmagne:
  A Polynomial Time Algorithm for Unidimensional Unfolding Representations. 218-233
  
• Marek Chrobak, Lawrence L. Larmore:
  Generosity Helps or an 11-Competitive Algorithm for Three Servers. 234-263
  
• Jeremy Spinrad:
  Recognition of Circle Graphs. 264-282
  
• Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan:
  An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. 283-294
  
• Tal Goldberg, Uri Zwick:
  Faster Parallel String Matching via Larger Deterministic Samples. 295-308
  
• Michael Filaseta, M. L. Robinson, Ferrell S. Wheeler:
  The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable. 309-333
  

Volume 16, Number 3, May 1994

• Wayne Eberly:
  Logarithmic Depth Circuits for Hermite Interpolation. 335-360
  
• Charles U. Martel, Ramesh Subramonian:
  On the Complexity of Certified Write-All Algorithms. 361-387
  
• Tandy Warnow:
  Tree Compatibility and Inferring Evolutionary History. 388-407
  
• David Fernández-Baca, Giora Slutzki:
  Parametric Problems on Graphs of Bounded Tree-Width. 408-430
  
• Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei:
  Minimizing Maximum Weighted Error for Imprecise Computation Tasks. 431-452
  
• Oscar H. Ibarra, Qi Zheng:
  Some Efficient Algorithms for Permutation Graphs. 453-469
  
• Egon Wanke:
  Bounded Tree-Width and LOGCFL. 470-491
  

Last update Mon Feb 13 04:51:16 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page