Back to Results
First PageMeta Content



Stanford University Concurrent VLSI Architecture Memo 121 Stanford University Computer Systems Laboratory Finding Worst-case Permutations for
Add to Reading List

Open Document

File Size: 169,13 KB

Share Result on Facebook

Company

Computer Systems Laboratory / /

Currency

pence / /

/

Facility

Stanford University / Computer Systems Laboratory / /

IndustryTerm

non-relative routing algorithm / interconnection network / oblivious routing algorithms / size networks / actual network / maximum-weight matching algorithm / torus network / interconnection networks / typical fixed-degree networks / polynomial-time algorithm / oblivious routing algorithm / relative routing algorithm / particular routing algorithm / overall algorithm / dimension order routing algorithm / maximum weight matching algorithm / oblivous routing algorithms / /

Organization

National Science Foundation / Stanford University / Department of Electrical Engineering / MARCO Interconnect Focus Research Center / /

Position

designer / system designer / representative / /

SportsLeague

Stanford University / /

Technology

maximum weight matching algorithm / non-relative routing algorithm / oblivous routing algorithms / randomized algorithm / ROMM routing algorithm / maximum-weight matching algorithm / overall algorithm / routing algorithms / relative routing algorithm / polynomial-time algorithm / 4 4.1 Algorithm / particular routing algorithm / dimension order routing algorithm / two minimal / oblivious routing algorithms / oblivious routing algorithms / oblivious routing algorithm / second algorithm / same algorithm / routing algorithm / two algorithms / /

SocialTag