SIGN IN
SIGN UP
Abstract state machines capture parallel algorithms: Correction and extension
Full Text:
PDF
Buy this Article
Authors:
Andreas Blass
University of Michigan, Ann Arbor, MI
Yuri Gurevich
Microsoft Research, Redmond, WA
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL)
TOCL Homepage
archive
Volume 9 Issue 3, June 2008
Article No. 19
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1352582.1352587
2008 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 22
· Downloads (cumulative): 235
· Citation Count: 4
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
abstract state machine
algorithms
alternation and nondeterminism
asm thesis
languages
parallel
parallel algorithm
parallel programming
parallel programming
parallelism and concurrency
postulates for parallel computation
theory
unbounded-action devices
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder