default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKristofer Vorwerk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c12]Nima Karimpour Darav, Andrew A. Kennings, Kristofer Vorwerk, Arun Kundu:
Multi-Commodity Flow-Based Spreading in a Commercial Analytic Placer. FPGA 2019: 122-131- 2014
- [c11]Wenyi Feng, Jonathan W. Greene, Kristofer Vorwerk, Val Pevzner, Arun Kundu:
Rent's rule based FPGA packing for routability optimization. FPGA 2014: 31-34 - 2011
- [j4]Andrew A. Kennings, Kristofer Vorwerk, Arun Kundu, Val Pevzner, Andy Fox:
FPGA technology mapping with encoded libraries and staged priority cuts. ACM Trans. Reconfigurable Technol. Syst. 4(4): 35:1-35:17 (2011) - 2010
- [j3]Kristofer Vorwerk, Andrew A. Kennings, Val Pevzner, Arun Kundu, Madhu Raman, Julien Dunoyer, Yaun-shung Hsu:
Power minimisation during field programmable gate array placement. IET Comput. Digit. Tech. 4(3): 170-183 (2010) - [c10]Andrew A. Kennings, Alan Mishchenko, Kristofer Vorwerk, Val Pevzner, Arun Kundu:
Efficient FPGA Resynthesis Using Precomputed LUT Structures. FPL 2010: 532-537
2000 – 2009
- 2009
- [j2]Kristofer Vorwerk, Andrew A. Kennings, Jonathan W. Greene:
Improving Simulated Annealing-Based FPGA Placement With Directed Moves. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(2): 179-192 (2009) - [c9]Andrew A. Kennings, Kristofer Vorwerk, Arun Kundu, Val Pevzner, Andy Fox:
FPGA technology mapping with encoded libraries andstaged priority cuts. FPGA 2009: 143-150 - 2008
- [c8]Kristofer Vorwerk, Madhu Raman, Julien Dunoyer, Yaun-Chung Hsu, Arun Kundu, Andrew A. Kennings:
A technique for minimizing power during FPGA placement. FPL 2008: 233-238 - [r1]Andrew A. Kennings, Kristofer Vorwerk:
Force-Directed and Other Continuous Placement Methods. Handbook of Algorithms for Physical Design Automation 2008 - 2007
- [c7]Doris T. Chen, Kristofer Vorwerk, Andrew A. Kennings:
Improving Timing-Driven FPGA Packing With Physical Information. FPL 2007: 117-123 - [c6]Kristofer Vorwerk, Andrew A. Kennings, Jonathan W. Greene, Doris T. Chen:
Improving Annealing Via Directed Moves. FPL 2007: 363-370 - [c5]Kristofer Vorwerk, Andrew A. Kennings, Doris T. Chen, Laleh Behjat
:
Floorplan repair using dynamic whitespace management. ACM Great Lakes Symposium on VLSI 2007: 552-557 - 2006
- [j1]Andrew A. Kennings, Kristofer Vorwerk:
Force-Directed Methods for Generic Placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(10): 2076-2087 (2006) - 2005
- [c4]Kristofer Vorwerk, Andrew A. Kennings:
An Improved Multi-Level Framework for Force-Directed Placement. DATE 2005: 902-907 - [c3]Kristofer Vorwerk, Andrew A. Kennings:
Mixed-size placement via line search. ICCAD 2005: 899-904 - 2004
- [c2]Kristofer Vorwerk, Andrew A. Kennings, Anthony Vannelli:
Engineering details of a stable force-directed placer. ICCAD 2004: 573-580 - 2002
- [c1]Kristofer Vorwerk, G. N. Paulley:
On Implicate Discovery and Query Optimization. IDEAS 2002: 2-11
Coauthor Index
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.
last updated on 2025-01-09 13:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
