✦ LIBER ✦

The time complexity of updating snapshot memories

✍ Scribed by Amos Israeli; Asaf Shirazi

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 851 KB
Volume: 65
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00189-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the memory overhead of distributed sn

On the memory overhead of distributed snapshots

✍ Shabtay, Lior; Segall, Adrian 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 60 KB 👁 3 views

This paper shows that the memory overhead of distributed snapshots is unbounded. Several techniques are suggested for bounding it: bounded memory-overhead versions of distributed snapshots for specific problems, like termination detection and deadlock detection; use of alternative protocols; or use

The complexity of belief update

✍ Paolo Liberatore 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Probabilistic analysis of the time compl

Probabilistic analysis of the time complexity of quicksort

✍ Tadashi Mizoi; Shunji Osaki 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 460 KB

## Abstract Quicksort is a well‐known sorting algorithm based on the divided control. the array to be sorted is divided into two sets as follows. an element in the array is specified, and the set of values larger than the value of that element and the set of values smaller than that value are const

Complexity preserving increase of the ca

Complexity preserving increase of the capacity of bidirectional associative memories by dilation and translation

✍ Burkhard Lenze 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

In this paper, we show how to increase the capacity of Kosko-type bidirectional associative memories by introducing dilation and translation parameters in the pattern space. The essential point of this approach is that the increase of the capacity of the networks almost doesn't affect their complexi

On the Time Complexity of Partial Real F

On the Time Complexity of Partial Real Functions

✍ Armin Hemmerling 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 143 KB

On the metric complexity of continuous-t

On the metric complexity of continuous-time systems

✍ Le Yi Wang; Lin Lin 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 531 KB

In this paper, metric complexities of certain classes of continuous-time systems are studied, using the time-domain sampling approach and the concepts of Kolmogorov, Gel'fand and sampling n-widths for certain classes of Sobolev space. A sampling theorem is obtained which extends Shannon's sampling t