Abstract is missing.
- Adaptively-Secure Distributed Public-Key SystemsYair Frankel, Philip D. MacKenzie, Moti Yung. 4-27 [doi]
- How Long Does a Bit Live in a Computer? (abstract)Bernhard Korte. 28 [doi]
- Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network DesignR. Ravi, F. Sibel Salman. 29-40 [doi]
- The Impact of Knowledge on Broadcasting Time in Radio NetworksKrzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc. 41-52 [doi]
- Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant RoutingKazuo Iwama, Eiji Miyano. 53-64 [doi]
- IP Address Lookup Made Fast and SimplePierluigi Crescenzi, Leandro Dardini, Roberto Grossi. 65-76 [doi]
- On-Line Load Banancing in a Hierarchical Server TopologyAmotz Bar-Noy, Ari Freund, Joseph Naor. 77-88 [doi]
- Provably Good and Practical Strategies for Non-Uniform Data Management in NetworksFriedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann. 89-100 [doi]
- Approximation Algorithms for Restoration Capacity PlanningSteven J. Phillips, Jeffery Westbrook. 101-115 [doi]
- Efficient Algorithms for Integer Programs with Two Variables per ConstraintReuven Bar-Yehuda, Dror Rawitz. 116-126 [doi]
- Convex Quadratic Programming Relaxations for Network Scheduling ProblemsMartin Skutella. 127-138 [doi]
- Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut ProblemsRolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz. 139-150 [doi]
- Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel MachinesLeah Epstein, Jiri Sgall. 151-162 [doi]
- Off-Line Temporary Tasks AssignmentYossi Azar, Oded Regev. 163-171 [doi]
- Load Balancing Using Bisectors - A Tight Average-Case AnalysisStefan Bischof, Thomas Schickinger, Angelika Steger. 172-183 [doi]
- On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can HelpThomas Jansen, Ingo Wegener. 184-193 [doi]
- Motif StatisticsPierre Nicodème, Bruno Salvy, Philippe Flajolet. 194-211 [doi]
- Approximate Protein Folding in the HP Side Chain Model on Extended Cubic LatticesVolker Heun. 212-223 [doi]
- On Constructing Suffix Arrays in External MemoryAndreas Crauser, Paolo Ferragina. 224-235 [doi]
- Strategies for Searching with Different Access CostsEduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa. 236-247 [doi]
- On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary TreesTing Chen, Ming-Yang Kao. 248-256 [doi]
- Optimal Binary Search with Two Unreliable Tests and Minimum AdaptivenessFerdinando Cicalese, Daniele Mundici. 257-266 [doi]
- Improving Mergesort for Linked ListsSalvador Roura. 267-276 [doi]
- Efficient Algorithms foe On-Line Symbol Ranking CompressionGiovanni Manzini. 277-288 [doi]
- On List Update and Work Function AlgorithmsEric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks. 289-300 [doi]
- The 3-Server Problem in the PlaneWolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore. 301-312 [doi]
- Quartet Cleaning: Improved Algorithms and SimulationsVincent Berry, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham. 313-324 [doi]
- Fast and Robust Smallest Enclosing BallsBernd Gärtner. 325-338 [doi]
- Efficient Searching for Multi-dimensional Data Made SimpleEnrico Nardelli, Maurizio Talamo, Paola Vocca. 339-353 [doi]
- Geometric Searching over the RationalsBernard Chazelle. 354-365 [doi]
- On Computing the Diameter of a Point Set in High Dimensional Euclidean SpaceDaniele V. Finocchiaro, Marco Pellegrini. 365-377 [doi]
- A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median ProblemStavros G. Kolliopoulos, Satish Rao. 378-389 [doi]
- Sum Multi-coloring of GraphsAmotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai. 390-401 [doi]
- Efficient Approximation Algorithms for the Achromatic NumberPiotr Krysta, Krzysztof Lorys. 402-413 [doi]
- Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected MultigraphToshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki. 414-425 [doi]
- An Optimisation Algorithm for Maximum Independent Set with Applications in Map LabellingBram Verweij, Karen Aardal. 426-437 [doi]
- A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary TreesMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. 438-449 [doi]
- Faster Exact Solutions for Some NP-Hard ProblemsLimor Drori, David Peleg. 450-461 [doi]
- A Polyhedral Algorithm for Packings and DesignsLucia Moura. 462-475 [doi]
- Threshold Phenomena in Random Lattices and Efficient Reduction AlgorithmsAli Akhavi. 476-489 [doi]
- On Finding the Maximum Number of Disjoint Cuts in Seymour GraphsAlexander A. Ageev. 490-497 [doi]
- Dilworth s Theorem and Its Application for Path Systems of a Cycle - Implementation and AnalysisAndrás A. Benczúr, Jörg Förster, Zoltán Király. 498-509 [doi]
- On 2-Coverings and 2-Packings of Laminar FamiliesJoseph Cheriyan, Tibor Jordán, R. Ravi. 510-520 [doi]
- Random Cayley Graphs with O(log[G]) Generators Are ExpandersIgor Pak. 521-526 [doi]
- A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval GraphsPavol Hell, Ron Shamir, Roded Sharan. 527-539 [doi]
- A Fast General Methodology for Information - Theoretically Optimal Encodings of GraphsXin He, Ming-Yang Kao, Hsueh-I Lu. 540-549 [doi]