default search action
Christian Hakert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [b1]Christian Hakert:
Software exploitation of traditional interfaces for modern technologies. Technical University of Dortmund, Germany, 2024 - [c15]Christian Hakert, Kuan-Hsun Chen, Jian-Jia Chen:
FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference. DATE 2024: 1-2 - [c14]Jannik Malcher
, Daniel Biebert
Language-Based Deployment Optimization for Random Forests (Invited Paper). LCTES 2024: 58-61 - [i5]Daniel Biebert, Christian Hakert, Kuan-Hsun Chen
Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation. CoRR abs/2404.06846 (2024) - [i4]Lena Schmid, Daniel Biebert, Christian Hakert, Kuan-Hsun Chen, Michel Lang, Markus Pauly, Jian-Jia Chen:
TREE: Tree Regularization for Efficient Execution. CoRR abs/2406.12531 (2024) - 2023
- [j6]Lokesh Siddhu
Swift-CNN: Leveraging PCM Memory's Fast Write Mode to Accelerate CNNs. IEEE Embed. Syst. Lett. 15(4): 234-237 (2023) - [j5]Christian Hakert
ROLLED: Racetrack Memory Optimized Linear Layout and Efficient Decomposition of Decision Trees. IEEE Trans. Computers 72(5): 1488-1502 (2023) - [j4]Nils Hölscher
Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(8): 2527-2539 (2023) - [c13]Jörg Henkel
Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications. CASES 2023: 11-20 - [c12]Roland Kühn
Towards Data-Based Cache Optimization of B+-Trees. DaMoN 2023: 63-69 - [c11]Nils Hölscher, Minh Duy Truong, Christian Hakert, Tristan Taylan Seidl, Kuan-Hsun Chen
Rapid NVM Simulation and Analysis on Single Bit Granularity Featuring Gem5 and NVMain. NVMSA 2023: 50-55 - 2022
- [j3]Christian Hakert, Kuan-Hsun Chen
Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory. ACM Trans. Embed. Comput. Syst. 21(1): 5:1-5:24 (2022) - [j2]Kuan-Hsun Chen
Efficient Realization of Decision Trees for Real-Time Inference. ACM Trans. Embed. Comput. Syst. 21(6): 68:1-68:26 (2022) - [c10]Christian Hakert, Kuan-Hsun Chen
Immediate Split Trees: Immediate Encoding of Floating Point Split Values in Random Forests. ECML/PKDD (5) 2022: 531-546 - [i3]Christian Hakert, Kuan-Hsun Chen, Jian-Jia Chen
FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference. CoRR abs/2209.04181 (2022) - 2021
- [j1]Mario Günzel
HEART: Hybrid Memory and Energy-Aware Real-Time Scheduling for Multi-Processor Systems. ACM Trans. Embed. Comput. Syst. 20(5s): 88:1-88:23 (2021) - [c9]Christian Hakert, Asif Ali Khan, Kuan-Hsun Chen
BLOwing Trees to the Ground: Layout Optimization of Decision Trees on Racetrack Memory. DAC 2021: 1111-1116 - [c8]Hsiang-Yun Cheng, Chun-Feng Wu
Future Computing Platform Design: A Cross-Layer Design Approach. DATE 2021: 312-317 - [c7]Sebastian Buschjäger, Jian-Jia Chen
Margin-Maximization in Binarized Neural Networks for Optimizing Bit Error Tolerance. DATE 2021: 673-678 - [c6]Christian Hakert, Roland Kühn, Kuan-Hsun Chen
OCTO+: Optimized Checkpointing of B+ Trees for Non-Volatile Main Memory Wear-Leveling. NVMSA 2021: 1-6 - 2020
- [c5]Christian Hakert
Software-Based Memory Analysis Environments for In-Memory Wear-Leveling. ASP-DAC 2020: 651-658 - [c4]Yunfeng Huang, Fang-Jing Wu, Christian Hakert, Georg von der Brüggen
Demo Abstract: Perception vs. Reality - Never Believe in What You See. IPSN 2020: 363-364 - [c3]Christian Hakert
Can Wear-Aware Memory Allocation be Intelligent? MLCAD 2020: 83-88 - [c2]Christian Hakert, Kuan-Hsun Chen
Split'n Trace NVM: Leveraging Library OSes for Semantic Memory Tracing. NVMSA 2020: 1-6 - [i2]Sebastian Buschjäger, Jian-Jia Chen, Kuan-Hsun Chen
Towards Explainable Bit Error Tolerance of Resistive RAM-Based Binarized Neural Networks. CoRR abs/2002.00909 (2020) - [i1]Christian Hakert, Kuan-Hsun Chen
SoftWear: Software-Only In-Memory Wear-Leveling for Non-Volatile Main Memory. CoRR abs/2004.03244 (2020)
2010 – 2019
- 2019
- [c1]Thomas Lindemann, Patrick Brinkmann, Fadi Dalbah, Christian Hakert, Philipp-Jan Honysz, Daniel Matuszczyk, Nikolas Müller, Alexander Schmulbach, Stefan Petyov Todorinski, Oliver Tüselmann, Shimon Wonsak, Jens Teubner:
MAGPIE: Scalable Data Storage System for Efficient High Volume Data Queries. BTW 2019: 543-546
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:20 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: