Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
routing complexity
Description:
The computational or structural difficulty of determining paths through a network or arranging connections in a physical design.
Related topics:
Interconnection Networks and Systems (18%),
VLSI and FPGA Design Techniques (13%),
Network Traffic and Congestion Control (8%),
Complexity and Algorithms in Graphs (7%)
OpenAlex ID:
keywords/routing-complexity
Sorting on a mesh-connected parallel computer
1977
·
C. D. Thompson
, H. T. Kung
·
Communications of the ACM
·
521
PDF
Dynamic and leakage power reduction in MTCMOS circuits using an automated efficient gate clustering technique
2002
·
Mohab Anis
, Mohamed Mahmoud
, et al.
·
ACM/IEEE Design Automation Conference (DAC)
·
147
An optimal routing algorithm for mesh-connected Parallel computers
1980
·
David Nassimi
, Sartaj Sahni
·
Journal of the ACM
·
141
PDF
Revisiting IP multicast
2006
·
Sylvia Ratnasamy
, Andrey Ermolinskiy
, et al.
·
ACM SIGCOMM Computer Communication Review
·
139
Communication in multicomputers with nonconvex faults
1997
·
S. Chalasani
, R.V. Boppana
·
IEEE Transactions on Computers
·
122
Dynamic and leakage power reduction in MTCMOS circuits using an automated efficient gate clustering technique
2002
·
M. Anis
, S. Areibi
, et al.
·
ACM/IEEE Design Automation Conference (DAC)
·
111
Revisiting IP multicast
2006
·
Sylvia Ratnasamy
, Andrey Ermolinskiy
, et al.
·
ACM SIGCOMM Conference (SIGCOMM)
·
99
A routing methodology for achieving fault tolerance in direct networks
2006
·
M.E. Gomez
, N.A. Nordbotten
, et al.
·
IEEE Transactions on Computers
·
96
Scalable and modular algorithms for floating-point matrix multiplication on FPGAs
2004
·
Ling Zhuo
, V.K. Prasanna
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
96
Scalable and Modular Algorithms for Floating-Point Matrix Multiplication on Reconfigurable Computing Systems
2007
·
Ling Zhuo
, Viktor K. Prasanna
·
IEEE Transactions on Parallel and Distributed Systems
·
88
Tight bounds for oblivious routing in the hypercube
1990
·
C. Kaklamanis
, D. Krizanc
, et al.
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
82
River Routing Every Which Way, But Loose
1984
·
R. Cole
, A. Siegel
·
Annual Symposium on Foundations of Computer Science
·
73
Name independent routing for growth bounded networks
2005
·
Ittai Abraham
, Dahlia Malkhi
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
58
Distributed, scalable routing based on link-state vectors
1994
·
Jochen Behrens
, J. J. Garcia-Luna-Aceves
·
ACM SIGCOMM Computer Communication Review
·
54
PDF
Greedy Routing in Tree-Decomposed Graphs
2005
·
Pierre Fraigniaud
·
Lecture notes in computer science
·
46
Reconfigurable content-addressable memory (CAM) on FPGAs: A tutorial and survey
2021
·
Muhammad Irfan
, Abdurrashid Ibrahim Sanka
, et al.
·
Future Generation Computer Systems
·
45
Common-Centroid Layouts for Analog Circuits: Advantages and Limitations
2021
·
Arvind K. Sharma
, Meghna Madhusudan
, et al.
·
Design, Automation, and Test in Europe
·
44
Low Computational-Complexity SOMS-Algorithm and High-Throughput Decoder Architecture for QC-LDPC Codes
2022
·
Anuj Verma
, Rahul Shrestha
·
IEEE Transactions on Vehicular Technology
·
41
Wire-routing machines—New tools for VLSI physical design
1983
·
Se June Hong
, R. Nair
·
Proceedings of the IEEE
·
38
Distributed, scalable routing based on link-state vectors
1994
·
Jochen Behrens
, J. J. Garcia-Luna-Aceves
·
ACM SIGCOMM Conference (SIGCOMM)
·
37
PDF
Optical network scaling: roles of spectral and spatial aggregation
2014
·
Sercan Ö. Arık
, Keang-Po Ho
, et al.
·
Optics Express
·
36
Sorting on a mesh-connected parallel computer
1976
·
C. D. Thompson
, H. T. Kung
·
ACM Symposium on Theory of Computing (STOC)
·
36
Matrix-Based Nonblocking Routing Algorithm for Beneš Networks
2009
·
Amitabha Chakrabarty
, Martin Collier
, et al.
·
Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns
·
34
PDF
Almost Optimal Decentralized Routing in Long-Range Contact Networks
2004
·
Emmanuelle Lebhar
, Nicolas Schabanel
·
Lecture notes in computer science
·
34
Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance
2006
·
L. Ritchie
, H.S. Yang
, et al.
·
IEEE Transactions on Mobile Computing
·
32
Show more works
View as search
Works count:
331
Citation count:
3,726
Year
Topic
Type