| ESA'99 Program |
| Adaptively-Secure Distributed Public-Key Systems / Yair Frankel ; Moti Yung ; Philip MacKenzie |
| How Long Does a Bit Live in a Computer? / Bernhard Korte |
| Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design / R. Ravi ; F. S. Salman |
| The Impact of Knowledge on Broadcasting Time in Radio Networks (Extended Abstract) / Krzysztof Diks ; Danny Krizanc ; Evangelos Kranakis ; Andrzej Pelc |
| Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing / Kazuo Iwama ; Eiji Miyano |
| IP Address Lookup Made Fast and Simple / Pierluigi Crescenzi ; Leandro Dardini ; Roberto Grossi |
| On-Line Load Balancing in a Hierarchical Server Topology / Amotz Bar-Noy ; Ari Freund ; Joseph Naor |
| Provably Good and Practical Strategies for Non-uniform Data Management in Networks / Friedhelm Meyer auf der Heide ; Matthias Westermann ; Berthold Vöcking |
| Approximation Algorithms for Restoration Capacity Planning / Steven J. Phillips ; JefferyR. Westbrook |
| Efficient Algorithms for Integer Programs with Two Variables per Constraint (Extended Abstract) / Reuven Bar-Yehuda ; Dror Rawitz |
| Convex Quadratic Programming Relaxations for Network Scheduling Problems / Martin Skutella |
| Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems / RolfH. Möhring ; Frederik Stork ; Marc Uetz ; Andreas S. Schulz |
| Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines / Leah Epstein ; Jiří Sgall |
| Off-Line Temporary Tasks Assignment / Yossi Azar ; Oded Regev |
| Load Balancing Using Bisectors - A Tight Average-Case Analysis / Stefan Bischof ; Thomas Schickinger ; Angelika Steger |
| On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help / Thomas Jansen ; Ingo Wegener |
| Motif Statistics / Pierre Nicodème ; Bruno Salvy ; Philippe Flajolet |
| Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstract) / Volker Heun |
| On Constructing Suffix Arrays in External Memory / Andreas Crauser ; Paolo Ferragina |
| Strategies for Searching with Different Access Costs / Eduardo Sany Laber ; Ruy Luiz Milidiú ; Artur Alves Pessoa |
| On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees / Ting Chen ; Ming-Yang Kao |
| Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness / Ferdinando Cicalese ; Daniele Mundici |
| Improving Mergesort for Linked Lists / Salvador Roura |
| Efficient Algorithms for On-Line Symbol Ranking Compression (Extended Abstract) / Giovanni Manzini |
| On List Update and Work Function Algorithms / Eric J. Anderson ; Anna R. Karlin ; Kris Hildrum ; April Rasala ; Michael Saks |
| The 3-Server Problem in the Plane (Extended Abstract) / Wolfgang W. Bein ; Lawrence L. Larmore ; Marek Chrobak |
| Quartet Cleaning: Improved Algorithms and Simulations / Vincent Berry ; Tao Jiang ; Paul Kearney ; Ming Li ; Todd Wareham |
| Fast and Robust Smallest Enclosing Balls / Bernd Gärtner |
| Efficient Searching for Multi-dimensional Data Made Simple (Extended Abstract) / Enrico Nardelli ; Maurizio Talamo ; Paola Vocca |
| Geometric Searching over the Rationals / Bernard Chazelle |
| On Computing the Diameter of a Point Set in High Dimensional Euclidean Space / Daniele V. Finocchiaro ; Marco Pellegrini |
| A Nearly Linear-Time Approximation Scheme for the Euclidean k-median Problem / Stavros G. Kolliopoulos ; Satish Rao |
| Sum Multi-coloring of Graphs / Magnús M. Halldórsson ; Guy Kortsarz ; Ravit Salman ; Hadas Shachnai |
| Efficient Approximation Algorithms for the Achromatic Number / Piotr Krysta ; Krzysztof Loryś |
| Augmentinga (k - 1)-Vertex-Connected Multigraph to an l-Edge-Connected and k-Vertex-Connected Multigraph / Toshimasa Ishii ; Hiroshi Nagamochi ; Toshihide Ibaraki |
| An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling / Bram Verweij ; Karen Aardal |
| A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees / Tak-Wah Lam ; Wing-Kin Sung ; Hing-Fung Ting |
| Faster Exact Solutions for Some NP-Hard Problems (Extended Abstract) / Limor Drori ; David Peleg |
| A Polyhedral Algorithm for Packings and Designs / Lucia Moura |
| Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms / Ali Akhavi |
| On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs / Alexander A. Ageev |
| Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis / András A. Benczúr ; Jörg Förster ; Zoltán Király |
| On 2-Coverings and 2-Packings of Laminar Families / Joseph Cheriyan ; Tibor Jordán |
| Random Cayley Graphs with 0(log|G|) Generators Are Expanders / Igor Pak |
| A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / Pavol Hell ; Ron Shamir ; Roded Sharan |
| A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs / Xin He ; Hsueh-I Lu |
| Author Index |
| ESA'99 Program |
| Adaptively-Secure Distributed Public-Key Systems / Yair Frankel ; Moti Yung ; Philip MacKenzie |
| How Long Does a Bit Live in a Computer? / Bernhard Korte |
図書
