default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Burger 0001
Person information
- affiliation: Darmstadt University of Technology, Germany
Other persons with the same name
- Michael Burger 0002 — Fraunhofer-Institut für Techno- und Wirtschaftsmathematik (ITWM), Kaiserslautern, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j2]Michael Burger
, Giang Nam Nguyen, Christian H. Bischof:
SimAnMo - A parallelized runtime model generator. Concurr. Comput. Pract. Exp. 34(20) (2022)- 2021
- [i2]Michael Burger, Christian H. Bischof, Juliane Krämer:
A new Parallelization for p3Enum and Parallelized Generation of Optimized Pruning Functions. IACR Cryptol. ePrint Arch. 2021: 1136 (2021) - [i1]Michael Burger, Juliane Krämer, Christian H. Bischof:
qTESLA: Practical Implementations of a Quantum Attack Resistant Signature Scheme. IACR Cryptol. ePrint Arch. 2021: 1137 (2021) - 2020
- [c10]Michael Burger, Giang Nam Nguyen, Christian H. Bischof:
Developing Models for the Runtime of Programs With Exponential Runtime Behavior. PMBS@SC 2020: 109-125
2010 – 2019
- 2019
- [c9]Michael Burger, Christian H. Bischof, Juliane Krämer:
p3Enum: A New Parameterizable and Shared-Memory Parallelized Shortest Vector Problem Solver. ICCS (5) 2019: 535-542 - [c8]Michael Burger, Christian H. Bischof, Juliane Krämer:
A new Parallelization for p3Enum and Parallelized Generation of Optimized Pruning Functions. HPCS 2019: 931-939 - 2018
- [c7]Michael Burger, Christian H. Bischof, Alexandru Calotoiu, Thomas Wunderer, Felix Wolf:
Exploring the Performance Envelope of the LLL Algorithm. CSE 2018: 36-43 - [c6]Thomas Wunderer, Michael Burger, Giang Nam Nguyen:
Parallelizing the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack. CSE 2018: 185-193 - 2017
- [b1]Michael Burger:
Memory-Efficient and Parallel Simulation of Super Carbon Nanotubes. Darmstadt University of Technology, Germany, 2017, pp. 1-184 - [j1]Michael Burger, Christian H. Bischof, Christian Schröppel, Jens Wackerfuß:
Methods to model and simulate super carbon nanotubes of higher order. Concurr. Comput. Pract. Exp. 29(7) (2017) - [c5]Michael Burger, Giang Nam Nguyen, Christian H. Bischof:
Extending Perfect Spatial Hashing to Index Tuple-based Graphs Representing Super Carbon Nanotubes. ICCS 2017: 435-444 - 2016
- [c4]Michael Burger, Christian H. Bischof, Jens Wackerfuß:
Compressed symmetric graphs for the simulation of super carbon nanotubes. HPCS 2016: 286-293 - 2015
- [c3]Michael Burger, Christian H. Bischof, Christian Schröppel, Jens Wackerfuß:
An Improved Algorithm for Simulating the Mechanical Behavior of Super Carbon Nanotubes. CSE 2015: 286-293 - [c2]Michael Burger, Christian H. Bischof, Christian Schröppel, Jens Wackerfuß:
A Unified and Memory Efficient Framework for Simulating Mechanical Behavior of Carbon Nanotubes. ICCS 2015: 413-422 - [c1]Michael Burger, Christian H. Bischof, Christian Schröppel, Jens Wackerfuß:
Exploiting Structural Properties During Carbon Nanotube Simulation. ICCSA (2) 2015: 339-354
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-06-07 20:01 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:
