ICALP
1999
Springer
13 years 8 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
We present a calculus of mobile processes without prefix or summation, and using two different encodings we show that it can express both action prefix and guarded summation. O...
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
ICALP
1999
Springer
13 years 8 months ago
1999
Springer
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...