Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Inspections can be used to identify defects in software artifacts. In this way, inspection methods help to improve software quality, especially when used early in software develop...
Guilherme Travassos, Forrest Shull, Michael Freder...
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
There have been innumerable glowing reports of the way hypermedia systems allow users to explore and use vast amounts of information in ways not possible using traditional informa...