default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtur Mariano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i8]Artur Mariano:
LUSA: the HPC library for lattice-based cryptanalysis. IACR Cryptol. ePrint Arch. 2020: 605 (2020)- [i7]Artur Mariano, Filipe Cabeleira, Gabriel Falcão, Luís Paulo Santos:
Optimized Voronoi-based algorithms for parallel shortest vector computations. IACR Cryptol. ePrint Arch. 2020: 1124 (2020)
2010 – 2019
- 2019
- [j4]Gabriel Falcão
, Filipe Cabeleira, Artur Mariano, Luís Paulo Santos:
Heterogeneous Implementation of a Voronoi Cell-Based SVP Solver. IEEE Access 7: 127012-127023 (2019) - [c15]Filipe Cabeleira, Artur Mariano, Gabriel Falcão:
Memory-Optimized Voronoi Cell-based Parallel Kernels for the Shortest Vector Problem on Lattices. EUSIPCO 2019: 1-5 - 2018
- [j3]Paulo Martins, Leonel Sousa, Artur Mariano:
A Survey on Fully Homomorphic Encryption: An Engineering Perspective. ACM Comput. Surv. 50(6): 83:1-83:33 (2018) - [c14]Thijs Laarhoven, Artur Mariano:
Progressive Lattice Sieving. PQCrypto 2018: 292-311 - [i6]Thijs Laarhoven, Artur Mariano:
Progressive lattice sieving. IACR Cryptol. ePrint Arch. 2018: 79 (2018) - 2017
- [j2]Artur Mariano, Thijs Laarhoven, Fábio Correia, Manuel Rodrigues, Gabriel Falcão:
A Practical View of the State-of-the-Art of Lattice-Based Cryptanalysis. IEEE Access 5: 24184-24202 (2017) - [c13]Artur Mariano, Thijs Laarhoven, Christian H. Bischof:
A Parallel Variant of LDSieve for the SVP on Lattices. PDP 2017: 23-30 - 2016
- [b1]Artur Mariano:
High performance algorithms for lattice-based cryptanalysis. Darmstadt University of Technology, Germany, 2016, pp. 1-129 - [j1]Fábio Correia, Artur Mariano, Alberto Proença, Christian H. Bischof, Erik Agrell:
Parallel Improved Schnorr-Euchner Enumeration SE++ on Shared and Distributed Memory Systems, With and Without Extreme Pruning. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 7(4): 1-19 (2016) - [c12]Artur Mariano, Matthias Diener, Christian H. Bischof, Philippe O. A. Navaux:
Analyzing and Improving Memory Access Patterns of Large Irregular Applications on NUMA Machines. PDP 2016: 382-387 - [c11]Artur Mariano, Christian H. Bischof:
Enhancing the Scalability and Memory Usage of Hashsieve on Multi-core CPUs. PDP 2016: 545-552 - [c10]Fábio Correia, Artur Mariano, Alberto Proença, Christian H. Bischof, Erik Agrell:
Parallel Improved Schnorr-Euchner Enumeration SE++ for the CVP and SVP. PDP 2016: 596-603 - [c9]Artur Mariano, Fábio Correia, Christian H. Bischof:
A Vectorized, Cache Efficient LLL Implementation. VECPAR 2016: 162-173 - [i5]Artur Mariano, Thijs Laarhoven, Christian H. Bischof:
A Parallel Variant of LDSieve for the SVP on Lattices. IACR Cryptol. ePrint Arch. 2016: 890 (2016) - 2015
- [c8]Artur Mariano, Christian H. Bischof, Thijs Laarhoven:
Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP. ICPP 2015: 590-599 - [c7]Cristiano da Silva Sousa, Artur Mariano, Alberto Proença:
A Generic and Highly Efficient Parallel Variant of Boruvka's Algorithm. PDP 2015: 610-617 - [i4]Artur Mariano, Thijs Laarhoven, Christian H. Bischof:
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP. IACR Cryptol. ePrint Arch. 2015: 41 (2015) - 2014
- [c6]Christian H. Bischof, Johannes Buchmann, Özgür Dagdelen, Robert Fitzpatrick, Florian Göpfert, Artur Mariano:
Nearest Planes in Practice. BalkanCryptSec 2014: 203-215 - [c5]Artur Mariano, Özgür Dagdelen, Christian H. Bischof:
A Comprehensive Empirical Comparison of Parallel ListSieve and GaussSieve. Euro-Par Workshops (1) 2014: 48-59 - [c4]Robert Fitzpatrick, Christian H. Bischof, Johannes Buchmann, Özgür Dagdelen, Florian Göpfert, Artur Mariano, Bo-Yin Yang:
Tuning GaussSieve for Speed. LATINCRYPT 2014: 288-305 - [c3]Artur Mariano, Shahar Timnat, Christian H. Bischof:
Lock-Free GaussSieve for Linear Speedups in Parallel High Performance SVP Calculation. SBAC-PAD 2014: 278-285 - [i3]Artur Mariano, Özgür Dagdelen, Christian H. Bischof:
A comprehensive empirical comparison of parallel ListSieve and GaussSieve. IACR Cryptol. ePrint Arch. 2014: 714 (2014) - [i2]Artur Mariano, Shahar Timnat, Christian H. Bischof:
Lock-free GaussSieve for Linear Speedups in Parallel High Performance SVP Calculation. IACR Cryptol. ePrint Arch. 2014: 775 (2014) - [i1]Robert Fitzpatrick, Christian H. Bischof, Johannes Buchmann, Özgür Dagdelen, Florian Göpfert, Artur Mariano, Bo-Yin Yang:
Tuning GaussSieve for Speed. IACR Cryptol. ePrint Arch. 2014: 788 (2014) - 2013
- [c2]Artur Mariano, Dongwook Lee, Andreas Gerstlauer, Derek Chiou:
Hardware and Software Implementations of Prim's Algorithm for Efficient Minimum Spanning Tree Computation. IESS 2013: 151-158 - [c1]Artur Mariano, Paulo Garcia, Tiago Gomes:
SW and HW speculative Nelder-Mead execution for high performance unconstrained optimization. ISSoC 2013: 1-5
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-04-24 23:16 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:
