We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order...
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the ver...
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...
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...