Computer Science
Approximation Algorithms
6%
Assignment Problem
9%
Benchmark Circuit
10%
Buffer Insertion
19%
Building-Blocks
12%
Channel Density
6%
Coupling Capacitance
9%
Data Structure
6%
Delay Minimization
9%
Dynamic Power
9%
Efficient Algorithm
7%
Elmore Delay Model
8%
Exact Algorithm
13%
Experimental Result
100%
Fast Algorithm
12%
Field Programmable Gate Arrays
11%
Floorplan Area
8%
Floorplan Design
11%
Floorplanning
25%
Global Routing
16%
Integrated Circuits
14%
Lagrangian Relaxation
18%
Machine Learning
10%
Mapping Algorithm
6%
Microarchitecture
7%
Neural Network
6%
Open Source
7%
Optimal Algorithm
36%
Optimization Problem
7%
Performance Requirement
6%
Physical Design
7%
Pin Assignment
10%
Placement Algorithm
6%
Polynomial Time
25%
Polynomial Time Algorithm
7%
Process Variation
8%
Routing Algorithm
31%
Routing Channel
13%
Routing Problem
44%
Routing Resource
13%
Routing Solution
25%
Shortest Path Problem
11%
Simulated Annealing
11%
Slicing Floorplan
11%
Solution Quality
8%
Speed-up
17%
Technology Mapping
12%
Timing Analysis
20%
Timing Constraint
8%
Total Wirelength
6%
Keyphrases
Buffer Insertion
20%
Channel Routing
18%
Circuit Partitioning
13%
Coupling Capacitance
8%
Deep Submicron
10%
Delay Minimization
10%
Directed Self-assembly
11%
Double Patterning Lithography
8%
Elmore Delay Model
11%
Escape Routing
21%
Exact Algorithm
13%
Fast Algorithm
8%
Field Programmable Gate Arrays
11%
Floor Plan Design
12%
Floorplanning
40%
Flow-based
9%
Global Routing
14%
GPU Acceleration
8%
High Performance
15%
Lagrangian Relaxation
13%
Layer Assignment
10%
Lithography
11%
Logic Module
9%
Low Power
9%
Mask Optimization
9%
Maze Routing
13%
Network Flow
12%
Optical Proximity Correction
9%
Optimal Algorithm
21%
Pin Assignment
12%
Polynomial Time
22%
Power Grid
9%
Routability
12%
Router
25%
Routing Algorithm
23%
Routing Problem
22%
Routing Solution
17%
Self-aligned Double Patterning
10%
Simulated Annealing
9%
Slicing Floorplan
9%
Switch Module
9%
Technology Mapping
11%
Time Constraints
10%
Timing Analysis
16%
Timing-driven
8%
Triple Patterning Lithography
9%
Voltage Islands
9%
Wire Segments
9%
Wire Sizing
26%
Wirelength
15%
Engineering
Building Block
6%
Channel Layer
5%
Circuit Performance
5%
Constraint Length
5%
Coupling Capacitance
8%
Critical Cell
5%
Crosstalk
11%
Defects
7%
Design Flow
6%
Design Rule
8%
Electric Power Utilization
6%
Exact Algorithm
11%
Experimental Result
38%
Fast Algorithm
6%
Field Programmable Gate Arrays
17%
Graphics Processing Unit
7%
Integrated Circuit
5%
Interconnects
13%
Lagrangian Relaxation
7%
Linear Programming
8%
Linear Time
8%
Lithography
40%
Manufacturability
10%
Nodes
21%
Pin Assignment
9%
Polynomial Time
20%
Power Grid
6%
Routing Algorithm
9%
Routing Problem
18%
Routing Solution
12%
Supply Voltage
5%
