Sold Out
Book Categories |
External Memory Algorithms | 1 | |
Design and Analysis of Dynamic Processes: A Stochastic Approach | 26 | |
Car-Pooling as a Data Structuring Device: The Soft Heap | 35 | |
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property | 43 | |
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures | 55 | |
Augmenting Suffix Trees, with Applications | 67 | |
Longest Common Subsequence from Fragments via Sparse Dynamic Programming | 79 | |
Computing the Edit-Distance Between Unrooted Ordered Trees | 91 | |
Analogs and Duals of the MAST Problem for Sequences and Trees | 103 | |
Complexity Estimates Depending on Condition and Round-Off Error | 115 | |
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting | 127 | |
Fast Algorithms for Linear Algebra Modulo N | 139 | |
A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers | 151 | |
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time | 163 | |
A Robust Region Approach to the Computation of Geometric Graphs | 175 | |
Positioning Guards at Fixed Height above a Terrain - An Optimum Inapproximability Result | 187 | |
Two-Center Problems for a Convex Polygon | 199 | |
Constructing Binary Space Partitions for Orthogonal Rectangles in Practice | 211 | |
A Fast Random Greedy Algorithm for the Component Commonality Problem | 223 | |
Maximizing Job Completions Online | 235 | |
A Randomized Algorithm for Two Servers on the Line | 247 | |
On Nonblocking Properties of the Benes Network | 259 | |
Adaptability and the Usefulness of Hints | 271 | |
Fault-Tolerant Broadcasting in Radio Networks | 283 | |
New Bounds for Oblivious Mesh Routing | 295 | |
Evaluating Server-Assisted Cache Replacement in the Web | 307 | |
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights | 320 | |
A Functional Approach to External Graph Algorithms | 332 | |
Minimal Triangulations for Graphs with "Few" Minimal Separators | 344 | |
Finding an Optimal Path without Growing the Tree | 356 | |
An Experimental Study of Dynamic Algorithms for Directed Graphs | 368 | |
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme | 381 | |
[Delta]-Stepping : A Parallel Single Source Shortest Path Algorithm | 393 | |
Improved Deterministic Parallel Padded Sorting | 405 | |
Analyzing an Infinite Parallel Job Allocation Process | 417 | |
Nearest Neighbor Load Balancing on Graphs | 429 | |
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves | 441 | |
Moving-Target TSP and Related Problems | 453 | |
Fitting Points on the Real Line and Its Application to RH Mapping | 465 | |
Approximate Coloring of Uniform Hypergraphs | 477 | |
Techniques for Scheduling with Rejection | 490 | |
Computer-Aided Way to Prove Theorems in Scheduling | 502 | |
Author Index | 515 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionAlgorithms - ESA '98, Vol. 146
X
This Item is in Your InventoryAlgorithms - ESA '98, Vol. 146
X
You must be logged in to review the productsX
X
X
Add Algorithms - ESA '98, Vol. 146, , Algorithms - ESA '98, Vol. 146 to the inventory that you are selling on WonderClubX
X
Add Algorithms - ESA '98, Vol. 146, , Algorithms - ESA '98, Vol. 146 to your collection on WonderClub |