![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Kent D. Wilken
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j7]Ghassan Shobaki
, Kent D. Wilken, Mark Heffernan:
Optimal trace scheduling using enumeration. ACM Trans. Archit. Code Optim. 5(4): 19:1-19:32 (2009) - 2006
- [c11]Christopher Lupo
, Kent D. Wilken:
Post Register Allocation Spill Code Optimization. CGO 2006: 245-255 - [c10]Mark Heffernan, Kent D. Wilken, Ghassan Shobaki
:
Data-Dependency Graph Transformations for Superblock Scheduling. MICRO 2006: 77-88 - 2005
- [j6]Changqing Fu, Kent D. Wilken, David W. Goodwin:
A Faster Optimal Register Allocator. J. Instr. Level Parallelism 7 (2005) - [j5]Mark Heffernan, Kent D. Wilken:
Data-Dependency Graph Transformations for Instruction Scheduling. J. Sched. 8(5): 427-451 (2005) - 2004
- [c9]Ghassan Shobaki, Kent D. Wilken:
Optimal Superblock Scheduling Using Enumeration. MICRO 2004: 283-293 - 2002
- [c8]Changqing Fu, Kent D. Wilken:
A faster optimal register allocator. MICRO 2002: 245-256 - 2001
- [c7]Peter van Beek, Kent D. Wilken:
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies. CP 2001: 625-639 - 2000
- [c6]Kent D. Wilken, Jack Liu, Mark Heffernan:
Optimal instruction scheduling using integer programming. PLDI 2000: 121-133
1990 – 1999
- 1998
- [c5]Timothy Kong, Kent D. Wilken:
Precise Register Allocation for Irregular Architectures. MICRO 1998: 297-307 - 1997
- [j4]Kent D. Wilken, Timothy Kong:
Concurrent Detection of Software and Hardware Data-Access Faults. IEEE Trans. Computers 46(4): 412-424 (1997) - 1996
- [j3]David W. Goodwin, Kent D. Wilken:
Optimal and Near-Optimal Global Register Allocation Using 0-1 Integer Programming. Softw. Pract. Exp. 26(8): 929-965 (1996) - 1993
- [j2]Kent D. Wilken:
An Optimal Graph-Construction Approach to Placing Program Signatures for Signature Monitoring. IEEE Trans. Computers 42(11): 1372-1381 (1993) - [c4]Kent D. Wilken, Timothy Kong:
Efficient Memory Access Checking. FTCS 1993: 566-575 - 1992
- [c3]Kent D. Wilken, David W. Goodwin:
Toward zero-cost branches using instruction registers. MICRO 1992: 214-217 - 1991
- [c2]Kent D. Wilken:
Optimal Signature Placement for Process-Error Detection Using Signature Monitoring. FTCS 1991: 326-333 - 1990
- [j1]Kent D. Wilken, John Paul Shen:
Continuous signature monitoring: low-cost concurrent detection of processor control errors. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(6): 629-641 (1990)
1980 – 1989
- 1988
- [c1]Kent D. Wilken, John Paul Shen:
Continuous Signature Monitoring: Efficient Concurrent-Detection of Processor Control Errors. ITC 1988: 914-925
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint