Work

Communication-space tradeoffs for unrestricted protocols

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/fscs.1990.89562

Authors: P. Beame, M. Tompa, P. Yan

Institutions: University of Washington, IBM Research - Thomas J. Watson Research Center, Lycoming College

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2154951200

FWCI: 0.246

Cites: 27

Cited by: 5

Related to: 10