Остановите войну!
for scientists:
default search action
Bruce M. Maggs
- > Home > Persons > Bruce M. Maggs
Publications
- 1999
- [j20]Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa:
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. Comb. 19(3): 375-401 (1999) - [j17]Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman:
Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. 29(1): 29-64 (1999) - 1998
- [j14]Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman:
On the Fault Tolerance of Some Popular Bounded-Degree Networks. SIAM J. Comput. 27(5): 1303-1333 (1998) - 1997
- [j13]Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe:
Work-preserving emulations of fixed-connection networks. J. ACM 44(1): 104-147 (1997) - 1996
- [j8]Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs:
On-Line Algorithms for Path Selection in a Nonblocking Network. SIAM J. Comput. 25(3): 600-625 (1996) - 1995
- [c19]Frank Thomson Leighton, Bruce M. Maggs:
Fast algorithms for finding O(congestion+dilation) packet routing schedules. HICSS (2) 1995: 555-563 - [c18]Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman:
Tight analyses of two local load balancing algorithms. STOC 1995: 548-558 - 1994
- [j7]Frank Thomson Leighton, Bruce M. Maggs, Satish Rao:
Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps. Comb. 14(2): 167-186 (1994) - [j6]Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao:
Randomized Routing and Sorting on Fixed-Connection Networks. J. Algorithms 17(1): 157-205 (1994) - 1992
- [j4]Frank Thomson Leighton, Bruce M. Maggs:
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks. IEEE Trans. Computers 41(5): 578-587 (1992) - [c12]Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman:
On the Fault Tolerance of Some Popular Bounded-Degree Networks. FOCS 1992: 542-552 - [c11]Frank Thomson Leighton, Bruce M. Maggs:
The Role of Randomness in the Design of Interconnection Networks. IFIP Congress (1) 1992: 291-305 - [c10]Frank Thomson Leighton, Bruce M. Maggs:
The Role of Randomness in the Design of Interconnection Networks. Heinz Nixdorf Symposium 1992: 131-145 - 1991
- [j3]William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman:
Fast Algorithms for Bit-Serial Routing on a Hypercube. Math. Syst. Theory 24(4): 253-271 (1991) - 1990
- [c7]Tom Leighton, Derek Linsinski, Bruce M. Maggs:
Empirical evaluation of randomly-wire multistage networks. ICCD 1990: 380-385 - [c6]William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman:
Fast Algorithms for Bit-Serial Routing on a Hypercube. SPAA 1990: 55-64 - [c5]Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs:
On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract). STOC 1990: 149-158 - 1989
- [c4]Frank Thomson Leighton, Bruce M. Maggs:
Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies. FOCS 1989: 384-389 - [c3]Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg:
Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract). STOC 1989: 227-240 - 1988
- [c2]Frank Thomson Leighton, Bruce M. Maggs, Satish Rao:
Universal Packet Routing Algorithms (Extended Abstract). FOCS 1988: 256-269
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint