default search action
Samuel Thomas
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Samuel Thomas 0001
— IBM Research AI, Thomas J. Watson Research Center, NY, USA (and 1 more)
- Samuel Thomas 0002
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Samuel Thomas
Baobab Merkle Tree for Efficient Secure Memory. IEEE Comput. Archit. Lett. 23(1): 33-36 (2024) - [c10]Samuel Thomas
Automatic Generation of Vectorizing Compilers for Customizable Digital Signal Processors. ASPLOS (1) 2024: 19-34 - [c9]Samuel Thomas
A Midsummer Night's Tree: Efficient and High Performance Secure SCM. ASPLOS (3) 2024: 22-37 - [i5]Rajesh Chitnis, Samuel Thomas, Anthony Wirth:
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. CoRR abs/2408.03933 (2024) - 2023
- [i4]Kohav Dey, Krishna Bajaj, K. S. Ramalakshmi, Samuel Thomas, Sriram Radhakrishna:
FisHook - An Optimized Approach to Marine Specie Classification using MobileNetV2. CoRR abs/2304.01524 (2023) - 2022
- [j2]Samuel Thomas, Roxana Hayne, Jonad Pulaj
Using skip graphs for increased NUMA locality. J. Parallel Distributed Comput. 167: 31-49 (2022) - [c8]Samuel Thomas, Jiwon Choe, Ofir Gordon, Erez Petrank, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
Towards Hardware Accelerated Garbage Collection with Near-Memory Processing. HPEC 2022: 1-6 - 2021
- [c7]Rachit Nigam
A compiler infrastructure for accelerator generators. ASPLOS 2021: 804-817 - [i3]Rachit Nigam, Samuel Thomas, Zhijing Li, Adrian Sampson:
A Compiler Infrastructure for Accelerator Generators. CoRR abs/2102.09713 (2021) - 2020
- [c6]Rachit Nigam
Predictable accelerator design with time-sensitive affine types. PLDI 2020: 393-407 - [c5]Samuel Thomas, Roxana Hayne, Jonad Pulaj, Hammurabi Mendes:
Using Skip Graphs for Increased NUMA Locality. SBAC-PAD 2020: 157-166 - [i2]Rachit Nigam, Sachille Atapattu, Samuel Thomas, Zhijing Li, Theodore Bauer, Yuwei Ye, Apurva Koti, Adrian Sampson, Zhiru Zhang:
Predictable Accelerator Design with Time-Sensitive Affine Types. CoRR abs/2004.04852 (2020)
2010 – 2019
- 2019
- [j1]Silvia Paddock
Proof-of-concept study: Homomorphically encrypted data can support real-time learning in personalized cancer medicine. BMC Medical Informatics Decis. Mak. 19(1): 255 (2019) - [c4]Samuel Thomas, Hammurabi Mendes:
Layering Data Structures over Skip Graphs for Increased NUMA Locality. PODC 2019: 422-424 - [i1]Samuel Thomas, Hammurabi Mendes:
Layering Data Structures over Skip Graphs for Increased NUMA Locality. CoRR abs/1902.06891 (2019) - 2015
- [c3]Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas:
Compiling Constraint Networks into Multivalued Decomposable Decision Graphs. IJCAI 2015: 332-338 - 2014
- [c2]Syafizwan Faroque, Ben Horan
Haptic Virtual Reality Training Environment for Micro-robotic Cell Injection. AsiaHaptics 2014: 245-249 - 2013
- [c1]Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas:
Knowledge Compilation for Model Counting: Affine Decision Trees. IJCAI 2013: 947-953
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 2024-10-07 21:21 CEST 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: