Journal article

Three−Processor Tasks Are Undecidable

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Gafni, E., & Koutsoupias, E. (1999). Three−Processor Tasks Are Undecidable. SIAM Journal on Computing, 28(3), 970–983.

MLA Style

Gafni, E., and E. Koutsoupias. “Three−Processor Tasks Are Undecidable.” SIAM Journal on Computing, vol. 28, no. 3, 1999, pp. 970–83.

Chicago Style

Gafni, E, and E Koutsoupias. 1999. “Three−Processor Tasks Are Undecidable.” SIAM Journal on Computing 28 (3): 970–83.
Share
Print

Authors

+ Gafni, E More by this author

Role:: Author

+ Koutsoupias, E More by this author

Role:: Author

Journal:: SIAM Journal on Computing More from this journal
Volume:: 28
Issue:: 3
Pages:: 970-983
Publication date:: 1999-01-01

UUID:: uuid:ac44831b-13c8-4a43-ade7-b1a630205687
Local pid:: cs:7887
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 1999

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP