Sciweavers

RANDOM
1998
Springer
13 years 11 months ago
Randomized Lower Bounds for Online Path Coloring
Stefano Leonardi, Andrea Vitaletti
RANDOM
1998
Springer
13 years 11 months ago
On Balls and Bins with Deletions
Richard Cole, Alan M. Frieze, Bruce M. Maggs, Mich...
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
RANDOM
1998
Springer
13 years 11 months ago
A Derandomization Using Min-Wise Independent Permutations
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
Andrei Z. Broder, Moses Charikar, Michael Mitzenma...
RANDOM
1998
Springer
13 years 11 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
RANDOM
1998
Springer
13 years 11 months ago
The "Burnside Process" Converges Slowly
Leslie Ann Goldberg, Mark Jerrum
MFCS
1998
Springer
13 years 11 months ago
Deadlocking States in Context-Free Process Algebra
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
Jirí Srba
MFCS
1998
Springer
13 years 11 months ago
Blockwise Variable Orderings for Shared BDDs
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
Harry Preuß, Anand Srivastav