UB Paderborn / Katalog / Suche / in CDI

The loss of serving in the dark

Information processing letters, 2023-02, Vol.180, p.106334, Article 106334

2023

Volltextzugriff (PDF)

Sort-then-insert: A space efficient and oblivious model aggregation algorithm for top-k sparsification in federated learning

Future generation computer systems, 2024-09, Vol.158, p.1-10

2024

Volltextzugriff (PDF)

Klee’s Measure Problem Made Oblivious

LATIN 2022: Theoretical Informatics, p.121-138

Volltextzugriff (PDF)

ObliVM: A Programming Framework for Secure Computation

2015 IEEE Symposium on Security and Privacy, 2015, p.359-376

2015

Volltextzugriff (PDF)

Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity

ACM transactions on algorithms, 2018-06, Vol.14 (2), p.1-25

2018

Volltextzugriff (PDF)

Oblivious Data Structures

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014, p.215-226

2014

Volltextzugriff (PDF)

GraphSC: Parallel Secure Computation Made Easy

2015 IEEE Symposium on Security and Privacy, 2015, p.377-394

2015

Volltextzugriff (PDF)

Cache Oblivious Algorithms for Computing the Triplet Distance between Trees

The ACM journal of experimental algorithmics, 2021-12, Vol.26, p.1-44

2021

Volltextzugriff (PDF)

Cache-Oblivious MPI All-to-All Communications Based on Morton Order

IEEE transactions on parallel and distributed systems, 2018-03, Vol.29 (3), p.542-555

2018

Volltextzugriff (PDF)

Cache-oblivious Hilbert Curve-based Blocking Scheme for Matrix Transposition

ACM transactions on mathematical software, 2022-12, Vol.48 (4), p.1-28, Article 37

2022

Volltextzugriff (PDF)

Numerical approximation of the Schrödinger equation with concentrated potential

Journal of computational physics, 2020-03, Vol.405, p.109155, Article 109155

2020

Volltextzugriff (PDF)

Fast Fully Oblivious Compaction and Shuffling

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, p.2565-2579

2022

Volltextzugriff (PDF)

FAST AND OBLIVIOUS ALGORITHMS FOR DISSIPATIVE AND TWO-DIMENSIONAL WAVE EQUATIONS

SIAM journal on numerical analysis, 2017-01, Vol.55 (2), p.621-639

2017

Volltextzugriff (PDF)

Extending the limits for big data RSA cracking: Towards cache-oblivious TU decomposition

Journal of parallel and distributed computing, 2020-04, Vol.138, p.65-77

2020

Volltextzugriff (PDF)

Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors

SIAM review, 2009-03, Vol.51 (1), p.129-159

2009

Volltextzugriff (PDF)

Parallel Minimum Cuts in Near-linear Work and Low Depth

ACM transactions on parallel computing, 2021-08, Vol.8 (2), p.1-20, Article 8

2021

Volltextzugriff (PDF)

Private and oblivious set and multiset operations

International journal of information security, 2016-10, Vol.15 (5), p.493-518

2016

Volltextzugriff (PDF)

Fast convolution quadrature based impedance boundary conditions

Journal of computational and applied mathematics, 2014-06, Vol.263, p.500-517

2014

Volltextzugriff (PDF)

Network-Oblivious Algorithms

Journal of the ACM, 2016-03, Vol.63 (1), p.1-36

2016

Volltextzugriff (PDF)

C2CU : A CUDA C Program Generator for Bulk Execution of a Sequential Algorithm

Algorithms and Architectures for Parallel Processing, p.178-191

Volltextzugriff (PDF)

C2CU: a CUDA C program generator for bulk execution of a sequential algorithm

Concurrency and computation, 2017-09, Vol.29 (17), p.n/a

2017

Volltextzugriff (PDF)

Resilient Dynamic Programming

Algorithmica, 2017-02, Vol.77 (2), p.389-425

2017

Volltextzugriff (PDF)

Cache Complexity of Cache-Oblivious Approaches: A Review and Extension

International journal of advanced computer science & applications, 2022, Vol.13 (5)

2022

Volltextzugriff (PDF)

Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm

Journal of the ACM, 2011-12, Vol.58 (6), p.1-26

GOODRICH, Michael T

2011

Volltextzugriff (PDF)

A Practical Approach to the Secure Computation of the Moore–Penrose Pseudoinverse over the Rationals

Applied Cryptography and Network Security, p.398-417

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

The loss of serving in the dark

Sort-then-insert: A space efficient and oblivious model aggregation algorithm for top-k sparsification in federated learning

Klee’s Measure Problem Made Oblivious

ObliVM: A Programming Framework for Secure Computation

Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity

Oblivious Data Structures

GraphSC: Parallel Secure Computation Made Easy

Cache Oblivious Algorithms for Computing the Triplet Distance between Trees

Cache-Oblivious MPI All-to-All Communications Based on Morton Order

Cache-oblivious Hilbert Curve-based Blocking Scheme for Matrix Transposition

Numerical approximation of the Schrödinger equation with concentrated potential

Fast Fully Oblivious Compaction and Shuffling

FAST AND OBLIVIOUS ALGORITHMS FOR DISSIPATIVE AND TWO-DIMENSIONAL WAVE EQUATIONS

Extending the limits for big data RSA cracking: Towards cache-oblivious TU decomposition

Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors

Parallel Minimum Cuts in Near-linear Work and Low Depth

Private and oblivious set and multiset operations

Fast convolution quadrature based impedance boundary conditions

Network-Oblivious Algorithms

C2CU : A CUDA C Program Generator for Bulk Execution of a Sequential Algorithm

C2CU: a CUDA C program generator for bulk execution of a sequential algorithm

Resilient Dynamic Programming

Cache Complexity of Cache-Oblivious Approaches: A Review and Extension

Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm

A Practical Approach to the Secure Computation of the Moore–Penrose Pseudoinverse over the Rationals

Suchergebnisse filtern