2095 search results - page 338 / 419 » Improved pebbling bounds |
COCO
1998
Springer
14 years 2 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
SIGCOMM
1998
ACM
14 years 2 months ago
1998
ACM
In recent years, a number of link scheduling algorithms have been proposed that greatly improve upon traditional FIFO scheduling in being able to assure rate and delay bounds for ...
ESA
1998
Springer
14 years 2 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
IRREGULAR
1998
Springer
14 years 2 months ago
1998
Springer
To achieve scalable parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is ...
SWAT
1998
Springer
14 years 2 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...