Algorithms - ESA '98

9

Texte du rabat

9

Contenu

Invited Lectures External Memory Algorithms Jeffrey S. Vitter Design and Analysis of Dynamic Processes: A Stochastic Approach Eli Upfal Data Structures Car-Pooling as a Data Structuring Device: The Soft Heap Bernard Chazelle Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property Wojciech Rytter Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures Enrico Nardelli, Guido Proietti, Peter Widmayer Strings and Biology Augmenting Suffix Trees, with Applications Yossi Matias, S. Muthukrishnan, Sueleyman C. Sahinalp, Jacob Ziv Longest Common Subsequence from Fragments via Sparse Dynamic Programming Brenda S. Baker, Raffaele Giancarlo Computing the Edit-Distance Between Unrooted Ordered Trees Philip N. Klein Analogs and Duals of the MAST Problem for Sequences and Trees Michael Fellows, Michael Hallett, Chantal Korostensky, Ulrike Stege Numerical Algorithms Complexity Estimates Depending on Condition and Round-Off Error Felipe Cucker, Steve Smale Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting J. Maurice Rojas Fast Algorithms for Linear Algebra Modulo N Arne Storjohann, Thom Mulders A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers Johannes Bloemer Geometry Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time Matthias Fischer, Tamas Lukovszki, Martin Ziegler A Robust Region Approach to the Computation of Geometric Graphs Fabrizio d'Amore, Paolo G. Franciosa, Giuseppe Liotta Positioning Guards at Fixed Height above a Terrain -- An Optimum Inapproximability Result Stephan Eidenbenz, Christoph Stamm, Peter Widmayer Two-Center Problems for a Convex Polygon Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa Constructing Binary Space Partitions for Orthogonal Rectangles in Practice T.M. Murali, Pankaj K. Agarwal, Jeffrey S. Vitter Randomized and On-Line Algorithms A Fast Random Greedy Algorithm for the Component Commonality Problem Ravi Kannan, Andreas Nolte Maximizing Job Completions Online Bala Kalyanasundaram, Kirk Pruhs A Randomized Algorithm for Two Servers on the Line Yair Bartal, Marek Chrobak, Lawrence L. Larmore Parallel and Distributed Algorithms I On Nonblocking Properties of the Benes Network Petr Kolman Adaptability and the Usefulness of Hints Piotr Berman, Juan A. Garay Fault-Tolerant Broadcasting in Radio Networks Evangelos Kranakis, Danny Krizanc, Andrzej Pelc New Bounds for Oblivious Mesh Routing Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano Evaluating Server-Assisted Cache Replacement in the Web Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford Graph Algorithms Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni A Functional Approach to External Graph Algorithms James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook Minimal Triangulations for Graphs with 'Few'Minimal Separators Vincent Bouchitté, Ioan Todinca Finding an Optimal Path without Growing the Tree Danny Z. Chen, Ovidiu Daescu, Xiaobo (Sharon) Hu, Jinhui Xu An Experimental Study of Dynamic Algorithms for Directed Graphs Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schaefer, Christos Zaroliagis Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme Robert W. Irving Parallel and Distributed Algorithms II Delta-Stepping : A Parallel Single Source Shortest Path Algorithm Ulrich Meyer, Peter Sanders Improved Deterministic Parallel Padded Sorting Ka Wong Chong, Edgar A. Ramos Analyzing an Infinite Parallel Job Allocation Process Micah Adler, Petra Berenbrink, Klaus Schroeder Nearest Neighbor Load Balancing on Graphs Ralf Diekmann, Andreas Frommer, Burkhard Monien Optimization 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves Roberto Solis-Oba Moving-Target TSP and Related Problems C. S. Helvig,