I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
2D Greedy Algorithm for overlap removal for Mixed-Size Plac..:
, In:
2021 19th OITS International Conference on Information Technology (OCIT)
,
Dash, Akshaya Kumar
;
Ray, B N B
- p. 26-31 , 2021
Link:
https://doi.org/10.1109/OCIT53463.2021.00017
RT T1
2021 19th OITS International Conference on Information Technology (OCIT)
: T1
2D Greedy Algorithm for overlap removal for Mixed-Size Placement in VLSI
UL https://suche.suub.uni-bremen.de/peid=ieee-9719397&Exemplar=1&LAN=DE A1 Dash, Akshaya Kumar A1 Ray, B N B YR 2021 K1 Greedy algorithms K1 Three-dimensional displays K1 Law K1 Wires K1 Very large scale integration K1 Benchmark testing K1 Information technology K1 Cell Placement K1 Greedy K1 Cell Overlap K1 Whitespace SP 26 OP 31 LK http://dx.doi.org/https://doi.org/10.1109/OCIT53463.2021.00017 DO https://doi.org/10.1109/OCIT53463.2021.00017 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)