skip to content
On the existence of delay-insensitive fair arbiters : trace theory and its limitations Preview this item
ClosePreview this item
Checking...

On the existence of delay-insensitive fair arbiters : trace theory and its limitations

Author: David L Black
Publisher: Pittsburgh, Pa. : Carnegie-Mellon University, Dept. of Computer Science, 1985.
Series: Carnegie-Mellon University.; Computer Science Department.; Research papers.
Edition/Format:   Book : English
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: David L Black
OCLC Number: 13514515
Description: ii, 33 pages : illustrations ; 28 cm.
Series Title: Carnegie-Mellon University.; Computer Science Department.; Research papers.
Responsibility: David L. Black.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/13514515>
library:oclcnum"13514515"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/975545>
rdf:typeschema:Intangible
schema:name"Integrated circuits--Design and construction."@en
schema:about
schema:creator
schema:datePublished"1985"
schema:exampleOfWork<http://worldcat.org/entity/work/id/7054724>
schema:inLanguage"en"
schema:isPartOf
schema:name"On the existence of delay-insensitive fair arbiters : trace theory and its limitations"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.