Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 118 matches
- 2002
- Cristinel Ababei, Navaratnasothie Selvakkumaran, Kia Bazargan, George Karypis:
Multi-objective circuit partitioning for cutsize and path-based delay minimization. ICCAD 2002: 181-185 - Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah:
Generic ILP versus specialized 0-1 ILP: an update. ICCAD 2002: 450-457 - Charles J. Alpert, Gi-Joon Nam, Paul Villarrubia:
Free space management for cut-based placement. ICCAD 2002: 746-751 - Bikram Baidya, Tamal Mukherjee:
Extraction and LVS for mixed-domain integrated MEMS layouts. ICCAD 2002: 361-366 - Florin Balasa, Sarat C. Maruvada, Karthik Krishnamoorthy:
Efficient solution space exploration based on segment trees in analog placement with symmetry constraints. ICCAD 2002: 497-502 - Shabbir H. Batterywala, Narendra V. Shenoy, William Nicholls, Hai Zhou:
Track assignment: a desirable intermediate step between global routing and detailed routing. ICCAD 2002: 59-66 - Reinaldo A. Bergamaschi, John M. Cohn:
The A to Z of SoCs. ICCAD 2002: 790-798 - Sarvesh Bhardwaj, Sarma B. K. Vrudhula, David T. Blaauw:
Estimation of signal arrival times in the presence of delay noise. ICCAD 2002: 418-422 - Giorgio Biagetti, Simone Orcioni, L. Signoracci, Claudio Turchetti, Paolo Crippa, Michele Alessandrini:
SiSMA: a statistical simulator for mismatch analysis of MOS ICs. ICCAD 2002: 490-496 - Armin Biere, Wolfgang Kunz:
SAT and ATPG: Boolean engines for formal hardware verification. ICCAD 2002: 782-785 - Robert W. Brodersen, Mark Horowitz, Dejan Markovic, Borivoje Nikolic, Vladimir Stojanovic:
Methods for true power minimization. ICCAD 2002: 35-42 - Michael Butts, André DeHon, Seth Copen Goldstein:
Molecular electronics: devices, systems and tools for gigagate, gigabit chips. ICCAD 2002: 433-440 - Lipeng Cao:
Circuit power estimation using pattern recognition techniques. ICCAD 2002: 412-417 - Chih-Wei Jim Chang, Malgorzata Marek-Sadowska:
ATPG-based logic synthesis: an overview. ICCAD 2002: 786-789 - Xiaoding Chen, Michael S. Hsiao:
Characteristic faults and spectral information for logic BIST. ICCAD 2002: 294-298 - Pinhong Chen, Yuji Kukimoto, Kurt Keutzer:
Refining switching window by time slots for crosstalk noise calculation. ICCAD 2002: 583-586 - Tsung-Hao Chen, Clement Luk, Hyungsuk Kim, Charlie Chung-Ping Chen:
INDUCTWISE: inductance-wise interconnect simulator and extractor. ICCAD 2002: 215-220 - Kihwan Choi, Karthik Dantu, Wei-Chung Cheng, Massoud Pedram:
Frame-based dynamic voltage and frequency scaling for a MPEG decoder. ICCAD 2002: 732-737 - Pasquale Cocchini:
Concurrent flip-flop and repeater insertion for high performance integrated circuits. ICCAD 2002: 268-273 - Carlos P. Coelho, Joel R. Phillips, Luís Miguel Silveira:
Optimization based passive constrained fitting. ICCAD 2002: 775-780 - Jason Cong, Joey Y. Lin, Wangning Long:
A new enhanced SPFD rewiring algorithm. ICCAD 2002: 672-678 - Jason Cong, Min Xie, Yan Zhang:
An enhanced multilevel routing system. ICCAD 2002: 51-58 - Susan Cotterell, Frank Vahid:
Synthesis of customized loop caches for core-based embedded systems. ICCAD 2002: 655-662 - Luca Daniel, Alberto L. Sangiovanni-Vincentelli, Jacob K. White:
Proximity templates for modeling of skin and proximity effects on packages and high frequency interconnect. ICCAD 2002: 326-333 - Li Ding, David T. Blaauw, Pinaki Mazumder:
Efficient crosstalk noise modeling using aggressor and tree reductions. ICCAD 2002: 595-600 - Rafael Escovar, Roberto Suaya:
Transmission line design of clock trees. ICCAD 2002: 334-340 - Farzan Fallah:
Binary time-frame expansion. ICCAD 2002: 458-464 - Kenneth Francken, Martin Vogels, Ewout Martens, Georges G. E. Gielen:
A behavioral simulation tool for continuous-time delta sigma modulators. ICCAD 2002: 234-239 - Soha Hassoun, Charles J. Alpert, Meera Thiagarajan:
Optimal buffered routing path constructions for single and multiple clock domain systems. ICCAD 2002: 247-253 - Maria del Mar Hershenson:
Design of pipeline analog-to-digital converters via geometric programming. ICCAD 2002: 317-324
skipping 88 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-27 04:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint