ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
The mixing properties of several Markov chains to sample from configurations of a hard-core model have been examined. The model is familiar in the statistical physics of the liqui...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
