English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A Time-Randomness Tradeoff for Communication Complexity

Fleischer, R., Jung, H., & Mehlhorn, K. (1991). A Time-Randomness Tradeoff for Communication Complexity. In Distributed Algorithms, 4th International Workshop (pp. 390-401). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE2E-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE2F-B
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Fleischer, Rudolf1, Author           
Jung, Hermann2, Author
Mehlhorn, Kurt1, Author           
van Leeuwen, Jan2, Editor
Santoro, Nicola2, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2005-09-161991
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344539
Other: Local-ID: C1256428004B93B8-D70E11179581E87DC125707E00478E5E-Mehlhorn91d
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Bari, Italy
Start-/End Date: 1990-09-24

Legal Case

show

Project information

show

Source 1

show
hide
Title: Distributed Algorithms, 4th International Workshop
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 390 - 401 Identifier: ISBN: 3-540-54099-7

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -