![](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
William B. Toms
Person information
- affiliation: School of Computer Science, University of Manchester, Manchester, UK
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
2020 – today
- 2023
- [c10]Joshua Lant, Emmanouil Skordalakis, Kyriakos Paraskevas
, William B. Toms, Mikel Luján, John Goodacre:
DiAD - Distributed Acceleration for Datacenter FPGAs. FPL 2023: 166-173 - 2022
- [j6]Eleni Maragkoudaki
, William B. Toms, Vasilis F. Pavlidis
:
Energy-Efficient Encoding for High-Speed Serial Interfaces. IEEE Trans. Very Large Scale Integr. Syst. 30(10): 1484-1496 (2022) - 2021
- [c9]William B. Toms
, John Goodacre
, Mikel Luján
:
Energy Efficient Power-Management for Out-of-Order Processors Using Cyclic Power-Gating. ARCS 2021: 183-198
2010 – 2019
- 2017
- [c8]John Mawer, Oscar Palomar
, Cosmin Gorgovan, Andy Nisbet, Will Toms, Mikel Luján:
The Potential of Dynamic Binary Modification and CPU-FPGA SoCs for Simulation. FCCM 2017: 144-151 - 2016
- [j5]Yaman Cakmaki, Will Toms, Javier Navaridas
, Mikel Luján:
Cyclic Power-Gating as an Alternative to Voltage and Frequency Scaling. IEEE Comput. Archit. Lett. 15(2): 77-80 (2016) - 2015
- [j4]Behram Khan, Daniel Goodman, Salman Khan, Will Toms, Paolo Faraboschi
, Mikel Luján, Ian Watson:
Architectural support for task scheduling: hardware scheduling for dataflow on NUMA systems. J. Supercomput. 71(6): 2309-2338 (2015) - 2014
- [c7]Mahdi Jelodari Mamaghani, Jim D. Garside
, William B. Toms, Doug A. Edwards:
Optimised Synthesis of Asynchronous Elastic Dataflows by Leveraging Clocked EDA. DSD 2014: 607-614 - 2013
- [j3]P. Balasubramanian, David A. Edwards, William B. Toms:
Self-Timed Section-Carry Based Carry Lookahead Adders and the Concept of Alias Logic. J. Circuits Syst. Comput. 22(4) (2013) - 2012
- [j2]P. Balasubramanian, David A. Edwards, William B. Toms:
Redundant Logic Insertion and Latency Reduction in Self-Timed Adders. VLSI Design 2012: 575389:1-575389:13 (2012) - 2011
- [j1]William B. Toms, David A. Edwards:
Indicating combinational logic decomposition. IET Comput. Digit. Tech. 5(4): 331-341 (2011) - 2010
- [c6]William B. Toms, David A. Edwards:
A Complete Synthesis Method for Block-Level Relaxation in Self-Timed Datapaths. ACSD 2010: 24-34 - [c5]William B. Toms, David A. Edwards:
M-of-N Code Decomposition for Indicating Combinational Logic. ASYNC 2010: 15-25
2000 – 2009
- 2009
- [c4]William B. Toms, Doug A. Edwards:
Prime Indicants: A Synthesis Method for Indicating Combinational Logic Blocks. ASYNC 2009: 139-150 - 2006
- [c3]William B. Toms, David A. Edwards, Andrew Bardsley:
Synthesising Heterogeneously Encoded Systems. ASYNC 2006: 138-149 - 2005
- [c2]William B. Toms, David A. Edwards:
Efficient synthesis of speed-independent combinational logic circuits. ASP-DAC 2005: 1022-1026 - 2003
- [c1]W. J. Bainbridge, William B. Toms, David A. Edwards, Stephen B. Furber
:
Delay-Insensitive, Point-to-Point Interconnect Using M-of-N Codes. ASYNC 2003: 132-140
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 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint