Searching without Communicating: Tradeoffs between Performance and Selection 
Complexity

Lenzen, Christoph; Lynch, Nancy A.; Newport, Calvin; Radeva, Tsvetomira

doi:10.1007/s00446-016-0283-x

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Searching without Communicating: Tradeoffs between Performance and Selection Complexity

MPS-Authors

/persons/resource/persons123371

Lenzen, Christoph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Lenzen, C., Lynch, N. A., Newport, C., & Radeva, T. (2017). Searching without Communicating: Tradeoffs between Performance and Selection Complexity. Distributed Computing, 30(3), 169-191. doi:10.1007/s00446-016-0283-x.

引用: https://hdl.handle.net/11858/00-001M-0000-002D-8AA7-9

要旨

要旨はありません