- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Time-Memory Analysis of Parallel Collision Search Algorithms ; volume:2021 ; number:2 ; pages:254-274
IACR transactions on cryptographic hardware and embedded systems ; 2021, Heft 2, 254-274
- Classification
-
Informatik
- Creator
-
Trimoska, Monika
Ionica, Sorina
Dequen, Gilles
- DOI
-
10.46586/tches.v2021.i2.254-274
- URN
-
urn:nbn:de:hbz:294-TCHES-1768
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:23 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Trimoska, Monika
- Ionica, Sorina
- Dequen, Gilles
Other Objects (12)
Efficient sequential and parallel algorithms for planted motif search
Dynamics of Driven Quantum Systems: : A Search for Parallel Algorithms
Collision of almost parallel vortex filaments
Parallel parameterized algorithms
Algorithms and data structures for in-memory text search engines
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
Algorithms for shared-memory matrix completion and maximum inner product search
Algorithms for parallel processing
Foundations of parallel algorithms
Collision-aware distributed detection with population-splitting algorithms
Adaptive Aloha anti-collision algorithms for RFID systems
Parallel processing and parallel algorithms : theory and computation
Efficient sequential and parallel algorithms for planted motif search
Dynamics of Driven Quantum Systems: : A Search for Parallel Algorithms
Collision of almost parallel vortex filaments
Parallel parameterized algorithms
Algorithms and data structures for in-memory text search engines
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
Algorithms for shared-memory matrix completion and maximum inner product search
Algorithms for parallel processing
Foundations of parallel algorithms
Collision-aware distributed detection with population-splitting algorithms
Adaptive Aloha anti-collision algorithms for RFID systems
Parallel processing and parallel algorithms : theory and computation
Efficient sequential and parallel algorithms for planted motif search
Dynamics of Driven Quantum Systems: : A Search for Parallel Algorithms
Collision of almost parallel vortex filaments
Parallel parameterized algorithms
Algorithms and data structures for in-memory text search engines
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
Algorithms for shared-memory matrix completion and maximum inner product search
Algorithms for parallel processing
Foundations of parallel algorithms
Collision-aware distributed detection with population-splitting algorithms
Adaptive Aloha anti-collision algorithms for RFID systems