Остановите войну!
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 111 matches
- 1992
- Filip Van Aelten, Stan Y. Liao, Jonathan Allen, Srinivas Devadas:
Automatic generation and verification of sufficient correctness properties for synchronous processors. ICCAD 1992: 183-187 - Venkatesh Akella, Ganesh Gopalakrishnan:
SHILPA: a high-level synthesis system for self-timed circuits. ICCAD 1992: 587-591 - M. Murat Alaybeyi, John Y. Lee, Ronald A. Rohrer:
Numerical integration algorithms and asymptotic waveform evaluation (AWE). ICCAD 1992: 76-79 - Roger P. Ang, Nikil D. Dutt:
Equivalent design representations and transformations for interactive scheduling. ICCAD 1992: 332-335 - Robert C. Armstrong, Jonathan Allen:
FICOM: a framework for incremental consistency maintenance in multi-representation, structural VLSI databases. ICCAD 1992: 336-343 - Pranav Ashar, Sujit Dey, Sharad Malik:
Exploiting multi-cycle false paths in the performance optimization of sequential circuits. ICCAD 1992: 510-517 - Toru Awashima, Wataru Yamamoto, Masao Sato, Tatsuo Ohtsuki:
An optimal chip compaction method based on shortest path algorithm with automatic jog insertion. ICCAD 1992: 162-165 - Abdulla Bataineh, Füsun Özgüner, Imre Szauter:
Parallel logic and fault simulation algorithms for shared memory vector machines. ICCAD 1992: 369-372 - Peter A. Beerel, Teresa H.-Y. Meng:
Automatic gate-level synthesis of speed-independent circuits. ICCAD 1992: 581-586 - Peter Bingley, K. Olav ten Bosch, Pieter van der Wolf:
Incorporating design flow management in a framework based CAD system. ICCAD 1992: 538-545 - J. Eric Bracken, Vivek Raghavan, Ronald A. Rohrer:
Extension of the asymptotic waveform evaluation technique with the method of characteristics. ICCAD 1992: 71-75 - Daniel Brand:
Exhaustive simulation need not require an exponential number of tests. ICCAD 1992: 98-101 - Ronn B. Brashear, Douglas R. Holberg, M. Ray Mercer, Lawrence T. Pillage:
ETA: electrical-level timing analysis. ICCAD 1992: 258-262 - Jerry R. Burch, David E. Long:
Efficient Boolean function matching. ICCAD 1992: 408-411 - Richard Burch, Farid N. Najm, Ping Yang, Timothy N. Trick:
McPOWER: a Monte Carlo approach to power estimation. ICCAD 1992: 90-97 - Timothy M. Burks, Karem A. Sakallah, Trevor N. Mudge:
Identification of critical paths in circuits with level-sensitive latches. ICCAD 1992: 137-141 - Surendra Burman, Chandar Kamalanathan, Naveed A. Sherwani:
New channel segmentation model and associated routing algorithm for high performance FPGAs. ICCAD 1992: 22-25 - Anantha P. Chandrakasan, Miodrag Potkonjak, Jan M. Rabaey, Robert W. Brodersen:
HYPER-LP: a system for power minimization using architectural transformations. ICCAD 1992: 300-303 - Chuan-Hua Chang, Edward S. Davidson, Karem A. Sakallah:
Using constraint geometry to determine maximum rate pipeline clocking. ICCAD 1992: 142-148 - Yu-Hsu Chang, Andrew T. Yang:
Analytic macromodeling and simulation fo tightly-coupled mixed analog-digital circuits. ICCAD 1992: 244-247 - Pao-Chuan Chen, Bin-Da Liu, Jhing-Fa Wang:
Overall consideration of scan design and test generation. ICCAD 1992: 9-12 - De-Sheng Chen, Majid Sarrafzadeh:
A wire-length minimization algorithm for single-layer layouts. ICCAD 1992: 390-393 - Chung-Hsing Chen, Daniel G. Saab:
Behavioral synthesis for testability. ICCAD 1992: 612-615 - Kwang-Ting Cheng:
Test generation for delay faults in non-scan and partial scan sequential circuits. ICCAD 1992: 554-559 - Vivek Chickermane, Jaushin Lee, Janak H. Patel:
A comparative study of design for testability methods using high-level and gate-level descriptions. ICCAD 1992: 620-624 - Massimiliano Chiodo, Thomas R. Shiple, Alberto L. Sangiovanni-Vincentelli, Robert K. Brayton:
Automatic compositional minimization in CTL model checking. ICCAD 1992: 172-178 - Yoon-Hwa Choi, Taechul Jung:
Configuration of a boundary scan chain for optimal testing of clusters of non boundary scan devices. ICCAD 1992: 13-16 - Pai H. Chou, Ross B. Ortega, Gaetano Borriello:
Synthesis fo the hardware/software interface in microcontroller-based systems. ICCAD 1992: 488-495 - Jason Cong, Yuzheng Ding:
An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. ICCAD 1992: 48-53 - Kaushik De, Balkrishna Ramkumar, Prithviraj Banerjee:
ProperSYN: a portable parallel algorithm for logic synthesis. ICCAD 1992: 412-416
skipping 81 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-04-25 10:02 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