Остановите войну!
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 31 matches
- 1992
- Imtiaz Ahmad, C. Y. Roger Chen:
A heuristic for data path synthesis using multiport memories. Great Lakes Symposium on VLSI 1992: 44-51 - Ahmed Riadh Baba-Ali:
A new algorithm for signal flow determination in CMOS VLSI. Great Lakes Symposium on VLSI 1992: 138-141 - S. Bapat, James P. Cohoon, Patrick L. Heck, A. Ju, L. J. Randall:
Examining routing solutions. Great Lakes Symposium on VLSI 1992: 24-29 - Sourav Bhattacharya, Shekhar H. Kirani, Wei-Tek Tsai:
Quadtree interconnection network layout. Great Lakes Symposium on VLSI 1992: 74-81 - Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi:
Cutwidth approximation in linear time. Great Lakes Symposium on VLSI 1992: 70-73 - Tsin-Yuan Chang, Jean-Bean Hsu, Cheng-Chi Wang, Yu-Shen Lin:
A design for concurrent error detections in FPLAs. Great Lakes Symposium on VLSI 1992: 9-15 - Tae Won Cho, Sam S. Pyo, J. Robert Heath:
A new conflict resolving switchbox router. Great Lakes Symposium on VLSI 1992: 95-102 - John Compton, Alexander Albicki:
Self-timed pipeline with adder. Great Lakes Symposium on VLSI 1992: 109-113 - Jack Greenbaum, Forrest Brewer:
Interface constrained processor specification and scheduling. Great Lakes Symposium on VLSI 1992: 168-175 - Oliver F. Haberl, Thomas Kropf:
A chip solution to hierarchical and boundary-scan compatible board level BIST. Great Lakes Symposium on VLSI 1992: 16-21 - Jon Hamkins, Donna J. Brown:
Routing in a rectangle with k-ary overlap. Great Lakes Symposium on VLSI 1992: 144-151 - Reza Hashemian:
An alternative algorithm for high speed multiplication and addition using growing technique. Great Lakes Symposium on VLSI 1992: 124-129 - Jan-Ming Ho, Ren-Song Tsay:
Clock tree regeneration. Great Lakes Symposium on VLSI 1992: 198-203 - Xin Hua, Hantao Zhang:
Axiomatic semantics of a hardware specification language. Great Lakes Symposium on VLSI 1992: 183-190 - Glenn Jennings:
On the detection and elimination of superfluous level-sensitive latches. Great Lakes Symposium on VLSI 1992: 176-182 - P. Johannes, Luc J. M. Claesen, Hugo De Man:
On the use of hierarchy in timing verification with statically sensitizable paths. Great Lakes Symposium on VLSI 1992: 4-8 - Antonije D. Jovanovic, Yee Yolk Yeng:
Interactive optimal channel router for critical nets. Great Lakes Symposium on VLSI 1992: 84-90 - Asjad M. T. Khan, Sadiq M. Sait, Gerhard F. Beckhoff:
VLSI implementation of controllers for communication protocols from their Petri net models. Great Lakes Symposium on VLSI 1992: 114-121 - Forbes D. Lewis, Wang Chia-Chi Pong, Nancy K. Van Cleave:
Optimum Steiner tree generation. Great Lakes Symposium on VLSI 1992: 207-212 - Kuo-Feng Liao:
Two-layer via-free routing in channels and switchboxes. Great Lakes Symposium on VLSI 1992: 91-94 - Andrew Lim, Yeow Meng Chee, Ching-Ting Wu:
Performance driven placement with global routing for macro cells. Great Lakes Symposium on VLSI 1992: 35-41 - Brenda Luderman, Alexander Albicki:
An asynchronous multiplier. Great Lakes Symposium on VLSI 1992: 104-108 - Kia Makki, Niki Pissinou:
The Steiner tree problem with minimum number of vertices in graphs. Great Lakes Symposium on VLSI 1992: 204-206 - Dee Parks, Miroslaw Truszczynski:
An algorithm for embedding a class of non-even routing problems in even routing problems. Great Lakes Symposium on VLSI 1992: 152-158 - Marc Pauwels, Dirk Lanneer, Francky Catthoor, Gert Goossens, Hugo De Man:
Models for bit-true simulation and high-level synthesis of DSP applications. Great Lakes Symposium on VLSI 1992: 52-59 - John E. Savage, Markus G. Wloka:
The parallel complexity of minimizing column conflicts. Great Lakes Symposium on VLSI 1992: 30-34 - Andrew Seawright, Forrest Brewer:
High performance data-path synthesis via communication metrics. Great Lakes Symposium on VLSI 1992: 60-67 - C.-J. Richard Shi:
A signed hypergraph model of constrained via minimization. Great Lakes Symposium on VLSI 1992: 159-166 - S. Sundaram, Lalit M. Patnaik:
T-algorithm-based logic simulation on distributed systems. Great Lakes Symposium on VLSI 1992: 191-195 - Chang N. Zhang, Alen George Law, Ali Rezazadeh:
A systematic approach for designing systolic arrays. Great Lakes Symposium on VLSI 1992: 130-137
skipping 1 more match
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-19 19:14 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