✦ LIBER ✦

Constructing real-time multi-channel protocols

✍ Scribed by M. Kapus-Kolar

Book ID: 107910357
Publisher: Elsevier Science
Year: 1990
Weight: 461 KB
Volume: 30
Category: Article
ISSN: 0165-6074
DOI: 10.1016/0165-6074(90)90287-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Real-time wormhole channels

✍ Sunggu Lee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 233 KB

For real-time communication, we must be able to guarantee timely delivery of messages. In recent years, improvements in technology have made possible switch-based local area networks (LANs) and system area networks (SANs) that use wormhole switching, a pipelined switching technique which permits sig

Multichannel protocols for real-time mic

Multichannel protocols for real-time microcomputer networks

✍ Marco Ajmone Marsan; Pietro Camarda; Fabio Neri 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 689 KB

On Using Real-Time Static Locking Protoc

On Using Real-Time Static Locking Protocols for Distributed Real-Time Databases

✍ Kam-Yiu Lam; Sheung-Lun Hung; Sang H. Son 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 212 KB

Multi-hop cellular networks: Architectur

Multi-hop cellular networks: Architecture and protocols for best-effort and real-time communication

✍ B.S. Manoj; R. Ananthapadmanabha; C. Siva Ram Murthy 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Real-time cell electrophysiology using a

Real-time cell electrophysiology using a multi-channel dielectrophoretic-dot microelectrode array

✍ Henry O. Fatoyinbo; Nahrizul A. Kadri; David H. Gould; Kai F. Hoettges; Fatima H 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 397 KB

Fully Parallelized Multi-prover Protocol

Fully Parallelized Multi-prover Protocols for NEXP-Time

✍ Dror Lapidot; Adi Shamir 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 691 KB

A major open problem in the theory of multi-prover interactive proofs is to characterize the languages which can be accepted by fully parallelized multi-prover protocols with an exponentially low probability of cheating. In this paper we solve this problem by proving that any language which can be a