Sciweavers

7773 search results - page 1252 / 1555
» On generalized Frame-Stewart numbers
Sort
View
149
Voted
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
15 years 11 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
FOCS
1989
IEEE
15 years 11 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
ESE
1990
128views Database» more  ESE 1990»
15 years 11 months ago
Characterizing Diagnoses
Most approaches to model-based diagnosis describe a diagnosis for a system as a set of failing components that explains the symptoms. In order to characterize the typically very l...
Johan de Kleer, Alan K. Mackworth, Raymond Reiter
PODC
1990
ACM
15 years 10 months ago
Composite Registers
We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is...
James H. Anderson
SPAA
1990
ACM
15 years 10 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy
« Prev « First page 1252 / 1555 Last » Next »