Journal: Algorithmica

Volume 22, Issue 4

366 -- 387Helmut Prodinger, Wojciech Szpankowski. Philippe Flajolet s Research in Analysis of Algorithms and Combinatorics
388 -- 412David Aldous. A. Metropolis-Type Optimization Algorithm on the Infinite Tree
413 -- 447F. T. Bruss, Michael Drmota, Guy Louchard. The Complete Solution of the Competitive Rank Selection Problem
448 -- 476Edward G. Coffman Jr., Leopold Flatto, Predrag R. Jelenkovic, Bjorn Poonen. Packing Random Intervals On-Line
477 -- 482Luc Devroye, Ernst P. Mücke, Binhai Zhu. A Note on Point Location in Delaunay Triangulations of Random Points
483 -- 489Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha. Average-Case Analysis of the Merging Algorithm of Hwang and Lin
490 -- 515Philippe Flajolet, Patricio V. Poblete, Alfredo Viola. On the Analysis of Linear Probing Hashing
516 -- 528Micha Hofri, Philippe Jacquet. Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms
529 -- 546Hsien-Kuei Hwang. Asymptotics of Divide-and-Conquer Recurrences: Batcher s Sorting Algorithm and a Minimum Euclidean Matching Heuristic
547 -- 560Charles Knessl. A Note on the Asymptotic Behavior of the Depth of Tries
561 -- 568Donald E. Knuth. Linear Probing and Graphs
569 -- 584Hosam M. Mahmoud, Robert T. Smythe. Probabilistic Analysis of MULTIPLE QUICK SELECT
585 -- 599Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri. Average-Case Analysis for a Simple Compression Algorithm
600 -- 630Alois Panholzer, Helmut Prodinger. Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration
631 -- 649Mireille Régnier, Wojciech Szpankowski. On Pattern Frequency Occurrences in a Markovian Sequence
650 -- 659Hadas Shachnai, Micha Hofri. The List Update Problem: Improved Bounds for the Counter Scheme
660 -- 685Brigitte Vallée. Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators

Volume 22, Issue 3

235 -- 249Philip N. Klein, Sairam Subramanian. A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
250 -- 274Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees
275 -- 304Giuseppe F. Italiano, Rajiv Ramaswami. Maintaining Spanning Trees of Small Diameter
305 -- 329Bala Swaminathan, Kenneth J. Goldman. An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs
330 -- 350Greg N. Frederickson. Maintaining Regular Properties Dynamically in ::::k::::-Terminal Graphs
351 -- 362Monika Rauch Henzinger, Michael L. Fredman. Lower Bounds for Fully Dynamic Connectivity Problems in Graphs

Volume 22, Issue 1/2

3 -- 17Shai Ben-David. Can Finite Samples Detect Singularities of Reao-Valued Functions?
18 -- 34Douglas A. Cenzer, William R. Moser. A Good Oracle Is Hard to Beat
35 -- 52Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala. A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions
53 -- 75Stephen Kwek, Leonard Pitt. PAC Learning Intersections of Halfspaces with Membership Queries
76 -- 90Amos Beimel, Eyal Kushilevitz. Learning Boxes in High Dimension
91 -- 111Nader H. Bshouty, Christino Tamon, David K. Wilson. Learning Matrix Functions over Rings
112 -- 137Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza. On Bayes Methods for On-Line Boolean Prediction
138 -- 156K. Hiraoka, Shun-ichi Amari. Strategy Under the Unknown Stochastic Environment: The Nonparametric Lob-Pass Problem
157 -- 172John Shawe-Taylor. Classification Accuracy Based on Observed Margin
173 -- 197R. Kamimura. Minimizing alpha-Information for Generalization and Interpretation
198 -- 210Stefan M. Rüger. A Class of Asymptotically Stable Algorithms for Learning-Rate Adaptation
211 -- 231Alex J. Smola, Bernhard Schölkopf. On a Kernel-Based Method for Pattern Recognition, Regression, Approximation, and Operator Inversion