Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Piotr Berman, Janos Simon. Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version). In 24th Annual Symposium on Foundations of Computer Science, 7-9 November 1983, Tucson, Arizona, USA. pages 304-311, IEEE, 1983.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version)Ramamohan Paturi, Janos Simon. focs 1983: 343-350
The following publications are possibly variants of this publication: