Algorithmica, Volume 34, 2002

Volume 34, Number 1, 2002

• Timothy M. Chan:
  A Near-Linear Area Bound for Drawing Binary Trees. 1-13
  
• Peter C. Fishburn, J. C. Lagarias:
  Pinwheel Scheduling: Achievable Densities. 14-38
  
• Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud:
  Splitting a Delaunay Triangulation in Linear Time. 39-46
  
• Thomas Jansen, Ingo Wegener:
  The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. 47-66
  
• Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
  Testing and Spot-Checking of Data Streams. 67-80
  
• Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz:
  Realistic Input Models for Geometric Algorithms. 81-97
  
• R. Ravi, David P. Williamson:
  Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. 98-107
  

Volume 34, Number 2, 2002

• Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard:
  An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. 109-156
  
• Nadia Pisanti, Marie-France Sagot:
  Further Thoughts on the Syntenic Distance between Genomes. 157-180
  
• Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein:
  Fair versus Unrestricted Bin Packing. 181-196
  
• Matthew Andrews, Lisa Zhang:
  Approximation Algorithms for Access Network Design. 197-215
  

Volume 34, Number 3, 2002

• Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert:
  Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. 217-239
  
• Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
  Max- and Min-Neighborhood Monopolies. 240-260
  
• Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastava, Majid Sarrafzadeh:
  Budget Management with Applications. 261-275
  
• Adnan Agbaria, Yosi Ben-Asher, Ilan Newman:
  Communication - Processor Tradeoffs in a Limited Resources PRAM. 276-297
  
• Surender Baswana, Sandeep Sen:
  Planar Graph Blocking for External Searching. 298-308
  

Volume 34, Number 4, 2002

• Michele Mosca, Alain Tapp:
  Introduction. 309-313
  
• Gerald Gilbert, Michael Hamrick:
  Secrecy, Computational Loads and Rates in Practical Quantum Cryptography. 314-339
  
• Hitoshi Inamori:
  Security of Practical Time-Reversed EPR Quantum Key Distribution. 340-365
  
• Hitoshi Inamori:
  Security of Practical BB84 Quantum Key Distribution. 366-371
  
• Eli Biham, Michel Boyer, Gilles Brassard, Jeroen van de Graaf, Tal Mor:
  Security of Quantum Key Distribution against All Collective Attacks. 372-388
  
• Nicolas Gisin, Renato Renner, Stefan Wolf:
  Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement? 389-412
  
• Wim van Dam:
  Quantum Algorithms for Weighing Matrices and Quadratic Residues. 413-428
  
• Peter Høyer, Jan Neerbek, Yaoyun Shi:
  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. 429-448
  
• J. Niel de Beaudrap, Richard Cleve, John Watrous:
  Sharp Quantum versus Classical Query Complexity Separations. 449-461
  
• Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh:
  The Quantum Complexity of Set Membership. 462-479
  
• Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek:
  The Quantum Black-Box Complexity of Majority. 480-501
  
• Todd A. Brun:
  Remotely Prepared Entanglement: a Quantum Web Page. 502-511
  
• Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani P. Roychowdhury, Farrokh Vatan:
  A New Proof for the Existence of Mutually Unbiased Bases. 512-528
  
• Paul Benioff:
  The Representation of Numbers in Quantum Mechanics. 529-559