Routing with Polynomial Communication-space Tradeoff

Bibliographic Details
Main Authors: Awercuch, Baruch, Peleg, David
Published: 2023
Online Access:https://hdl.handle.net/1721.1/149153
_version_ 1826215426399404032
author Awercuch, Baruch
Peleg, David
author_facet Awercuch, Baruch
Peleg, David
author_sort Awercuch, Baruch
collection MIT
first_indexed 2024-09-23T16:28:23Z
id mit-1721.1/149153
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T16:28:23Z
publishDate 2023
record_format dspace
spelling mit-1721.1/1491532023-03-30T03:05:24Z Routing with Polynomial Communication-space Tradeoff Awercuch, Baruch Peleg, David 2023-03-29T14:33:20Z 2023-03-29T14:33:20Z 1989-09 https://hdl.handle.net/1721.1/149153 MIT-LCS-TM-411 application/pdf
spellingShingle Awercuch, Baruch
Peleg, David
Routing with Polynomial Communication-space Tradeoff
title Routing with Polynomial Communication-space Tradeoff
title_full Routing with Polynomial Communication-space Tradeoff
title_fullStr Routing with Polynomial Communication-space Tradeoff
title_full_unstemmed Routing with Polynomial Communication-space Tradeoff
title_short Routing with Polynomial Communication-space Tradeoff
title_sort routing with polynomial communication space tradeoff
url https://hdl.handle.net/1721.1/149153
work_keys_str_mv AT awercuchbaruch routingwithpolynomialcommunicationspacetradeoff
AT pelegdavid routingwithpolynomialcommunicationspacetradeoff