LOWER BOUNDS ON GRAPH THREADING BY PROBABILISTIC MACHINES.

Piotr Berman, Janos Simon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)
Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages304-311
Number of pages8
ISBN (Print)0818605081
StatePublished - Dec 1 1983

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Berman, P., & Simon, J. (1983). LOWER BOUNDS ON GRAPH THREADING BY PROBABILISTIC MACHINES. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 304-311). (Annual Symposium on Foundations of Computer Science (Proceedings)). IEEE.
Berman, Piotr ; Simon, Janos. / LOWER BOUNDS ON GRAPH THREADING BY PROBABILISTIC MACHINES. Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1983. pp. 304-311 (Annual Symposium on Foundations of Computer Science (Proceedings)).
@inproceedings{f7f6bc6408fc44a9b3e3875ae4228c1f,
title = "LOWER BOUNDS ON GRAPH THREADING BY PROBABILISTIC MACHINES.",
author = "Piotr Berman and Janos Simon",
year = "1983",
month = "12",
day = "1",
language = "English (US)",
isbn = "0818605081",
series = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "IEEE",
pages = "304--311",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

}

Berman, P & Simon, J 1983, LOWER BOUNDS ON GRAPH THREADING BY PROBABILISTIC MACHINES. in Annual Symposium on Foundations of Computer Science (Proceedings). Annual Symposium on Foundations of Computer Science (Proceedings), IEEE, pp. 304-311.

LOWER BOUNDS ON GRAPH THREADING BY PROBABILISTIC MACHINES. / Berman, Piotr; Simon, Janos.

Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1983. p. 304-311 (Annual Symposium on Foundations of Computer Science (Proceedings)).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - LOWER BOUNDS ON GRAPH THREADING BY PROBABILISTIC MACHINES.

AU - Berman, Piotr

AU - Simon, Janos

PY - 1983/12/1

Y1 - 1983/12/1

UR - http://www.scopus.com/inward/record.url?scp=0020881175&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020881175&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0020881175

SN - 0818605081

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 304

EP - 311

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -

Berman P, Simon J. LOWER BOUNDS ON GRAPH THREADING BY PROBABILISTIC MACHINES. In Annual Symposium on Foundations of Computer Science (Proceedings). IEEE. 1983. p. 304-311. (Annual Symposium on Foundations of Computer Science (Proceedings)).