Algorithmica, Volume 46, 2006

Volume 46, Number 1, September 2006

• Rudolf Fleischer:
  Foreword. 1
  Electronic Edition (link) BibTeX
• Kazuyuki Amano, Akira Maruoka:
  The Monotone Circuit Complexity of Quadratic Boolean Functions. 3-14
  Electronic Edition (link) BibTeX
• Amitai Armon, Uri Zwick:
  Multicriteria Global Minimum Cuts. 15-26
  Electronic Edition (link) BibTeX
• Fredrik Bengtsson, Jingsen Chen:
  Efficient Algorithms for k Maximum Sums. 27-41
  Electronic Edition (link) BibTeX
• Jin-yi Cai, Osamu Watanabe:
  Random Access to Advice Strings and Collapsing Results. 43-57
  Electronic Edition (link) BibTeX
• Qi Cheng, Ming-Deh A. Huang:
  Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. 59-68
  Electronic Edition (link) BibTeX
• Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc:
  Deterministic Rendezvous in Graphs. 69-96
  Electronic Edition (link) BibTeX
• John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
  Adaptive Spatial Partitioning for Multidimensional Data Streams. 97-117
  Electronic Edition (link) BibTeX
• Timo von Oertzen:
  Exact Computation of Polynomial Zeros Expressible by Square Roots. 119-136
  Electronic Edition (link) BibTeX
• Joachim von zur Gathen, Igor Shparlinski:
  GCD of Random Linear Combinations. 137-148
  Electronic Edition (link) BibTeX

Volume 46, Number 2, October 2006

• Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad:
  Algorithms for the Homogeneous Set Sandwich Problem. 149-180
  Electronic Edition (link) BibTeX
• Uri Zwick:
  A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths. 181-192
  Electronic Edition (link) BibTeX
• Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
  The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. 193-221
  Electronic Edition (link) BibTeX
• Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy:
  A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment. 223-245
  Electronic Edition (link) BibTeX

Volume 46, Numbers 3-4, November 2006

• Philippe Jacquet, Daniel Panario, Wojciech Szpankowski:
  Preface. 247-248
  Electronic Edition (link) BibTeX
• Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
  Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis. 249-270
  Electronic Edition (link) BibTeX
• Nicolas Broutin, Luc Devroye:
  Large Deviations for the Weighted Height of an Extended Class of Trees. 271-297
  Electronic Edition (link) BibTeX
• Brigitte Chauvin, Michael Drmota:
  The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees. 299-327
  Electronic Edition (link) BibTeX
• Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko:
  A Local Limit Theorem in the Theory of Overpartitions. 329-343
  Electronic Edition (link) BibTeX
• James Allen Fill, Nevin Kapur, Alois Panholzer:
  Destruction of Very Simple Trees. 345-366
  Electronic Edition (link) BibTeX
• Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
  Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. 367-407
  Electronic Edition (link) BibTeX
• Jennie C. Hansen, Eric Schmutz, Li Sheng:
  The Expected Size of the Rule k Dominating Set. 409-418
  Electronic Edition (link) BibTeX
• Svante Janson:
  Left and Right Pathlengths in Random Binary Trees. 419-429
  Electronic Edition (link) BibTeX
• Guy Louchard, Helmut Prodinger:
  Asymptotics of the Moments of Extreme-Value Related Distribution Functions. 431-467
  Electronic Edition (link) BibTeX
• Moritz G. Maaß:
  Average-Case Analysis of Approximate Trie Search. 469-491
  Electronic Edition (link) BibTeX
• Mohamed Omar, Daniel Panario, L. Bruce Richmond, Jacki Whitely:
  Asymptotics of Largest Components in Combinatorial Structures. 493-503
  Electronic Edition (link) BibTeX
• Dominique Poulalhon, Gilles Schaeffer:
  Optimal Coding and Sampling of Triangulations. 505-527
  Electronic Edition (link) BibTeX
• Vlady Ravelomanana:
  The Average Size of Giant Components between the Double-Jump. 529-555
  Electronic Edition (link) BibTeX
• Gadiel Seroussi:
  On the Number of t-Ary Trees with a Given Path Length. 557-565
  Electronic Edition (link) BibTeX