default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNiels Gleinig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i5]Niels Gleinig, Tal Ben-Nun, Torsten Hoefler:
A Theory of I/O-Efficient Sparse Neural Network Inference. CoRR abs/2301.01048 (2023)- [i4]Niels Gleinig, Tobias Rohner, Torsten Hoefler:
Approximate Reversible Circuits for NISQ-Era Quantum Computers. CoRR abs/2302.01066 (2023) - 2022
- [b1]Niels Gleinig:
Optimizing the Use of Compute Resources in Classical and Quantum Computing. ETH Zurich, Zürich, Switzerland, 2022 - [c6]Niels Gleinig, Torsten Hoefler:
Circuits for Measurement Based Quantum State Preparation. DATE 2022: 328-333 - [c5]Niels Gleinig, Maciej Besta, Torsten Hoefler:
I/O-Optimal Cache-Oblivious Sparse Matrix-Sparse Matrix Multiplication. IPDPS 2022: 36-46 - [c4]Maciej Besta, Cesare Miglioli
, Paolo Sylos Labini, Jakub Tetek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michal Podstawski, Grzegorz Kwasniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler:
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. SC 2022: 43:1-43:17 - [c3]Niels Gleinig, Torsten Hoefler:
The Red-Blue Pebble Game on Trees and DAGs with Large Input. SIROCCO 2022: 135-153 - [i3]Maciej Besta, Cesare Miglioli, Paolo Sylos Labini, Jakub Tetek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michal Podstawski, Grzegorz Kwasniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler:
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. CoRR abs/2208.11469 (2022) - 2021
- [c2]Niels Gleinig, Torsten Hoefler:
An Efficient Algorithm for Sparse Quantum State Preparation. DAC 2021: 433-438
2010 – 2019
- 2019
- [c1]Niels Gleinig, Frances Ann Hubis, Torsten Hoefler:
Embedding Functions Into Reversible Circuits: A Probabilistic Approach to the Number of Lines. DAC 2019: 72 - 2018
- [j1]Xiao-Long Ren, Niels Gleinig, Dijana Tolic, Nino Antulov-Fantulin:
Underestimated Cost of Targeted Attacks on Complex Networks. Complex. 2018: 9826243:1-9826243:15 (2018) - [i2]Xiao-Long Ren, Niels Gleinig, Dirk Helbing, Nino Antulov-Fantulin:
Generalized Network Dismantling. CoRR abs/1801.01357 (2018) - 2017
- [i1]Xiao-Long Ren, Niels Gleinig, Dijana Tolic, Nino Antulov-Fantulin:
Underestimated cost of targeted attacks on complex networks. CoRR abs/1710.03522 (2017)
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-05-08 21: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:
