Algorithmica, Volume 11, 1994

Volume 11, Number 1, January 1994

• Prabhakar Raghavan:
  Guest Editor's Foreword: Special Issue on On-Line Algorithms. 1
  
• Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson:
  On the Power of Randomization in On-Line Algorithms. 2-14
  
• Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator:
  Randomized Competitive Algorithms for the List Update Problem. 15-32
  
• Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan:
  On-Line Algorithms for Locating Checkpoints. 33-52
  
• Sandy Irani:
  Coloring Inductive Graphs On-Line. 53-72
  
• Shai Ben-David, Allan Borodin:
  A New Measure for the Study of On-Line Algorithms. 73-91
  

Volume 11, Number 2, February 1994

• Vladimir Batagelj, Simona Korenjak-Cerne, Sandi Klavzar:
  Dynamic Programming and Convex Clustering. 93-103
  
• Rudolf Fleischer:
  A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort. 104-115
  
• Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
  Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. 116-132
  
• Reuven Bar-Yehuda, Sergio Fogel:
  Variations on Ray Shooting. 133-145
  
• Johan Jeuring:
  The Derivation of On-Line Algorithms, with an Application To Finding Palindromes. 146-184
  
• Pankaj K. Agarwal, Micha Sharir:
  Planar Geometric Location Problems. 185-195
  

Volume 11, Number 3, March 1994

• Harold N. Gabow:
  Editor's Foreword: Special Issur on Network Flow Algorithms. 197-199
  
• Samir Khuller, Joseph Naor:
  Flow in Planar Graphs with Vertex Capacities. 200-225
  
• Tomasz Radzik, Andrew V. Goldberg:
  Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. 226-242
  
• Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige:
  A New Scaling Algorithm for the Maximum Mean Cut Problem. 243-255
  
• Yaron Pinto, Ron Shamir:
  Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear Convex Costs. 256-276
  
• Dan Gusfield, Éva Tardos:
  A Faster Parametric Minimum-Cut Algorithm. 278-290
  
• Tomás Feder:
  Network Flow and 2-Satisfiability. 291-319
  
• Edith Cohen, Nimrod Megiddo:
  Algorithms and Complexity Analysis for Some Flow Problems. 320-340
  

Volume 11, Number 4, April 1994

• Heather Booth, Jeffery Westbrook:
  A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planar Graphs. 341-352
  
• Levent Tunçel:
  On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems. 353-359
  
• Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman:
  Visibility with a Moving Point of View. 360-378
  
• Peter Eades, Nicholas C. Wormald:
  Edge Crossings in Drawings of Bipartite Graphs. 379-403
  
• Peter Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, Jörg-Rüdiger Sack:
  A Workbench for Computational Geometry. 404-428
  

Volume 11, Number 5, May 1994

• Thomas H. Spencer:
  Provably Good Pattern Generators for a Random Pattern Test. 429-442
  
• Vijaya Ramachandran, Honghua Yang:
  Finding the Closed Partition of a Planar Graph. 443-468
  
• Mark H. Overmars, Micha Sharir:
  An Improved Technique for Output-Sensitive Hidden Surface Removal. 469-484
  
• Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri:
  Designing Secure Communication Protocols from Trust Specification. 485-499
  

Volume 11, Number 6, June 1994

• Mordecai J. Golin:
  A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm. 501-524
  
• Neal E. Young:
  The k-Server Dual and Loose Competitiveness for Paging. 525-541
  
• Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
  Competitive Randomized Algorithms for Nonuniform Problems. 542-571
  
• Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber:
  A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. 572-578
  

Last update Sat May 18 15:50:27 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page