30 citations · 34 across the 6 of their papers we have counts for
4 papers · 1 filter
Quantum Advantage for All
Christoph M. Kirsch, Stefanie Muroya Lei
We show that the algorithmic complexity of any classical algorithm written in a Turing-complete programming language polynomially bounds the number of quantum bits that are require…
Fast, Multicore-Scalable, Low-Fragmentation Memory Allocation through Large Virtual Memory and Global Data Structures
Martin Aigner, Christoph M. Kirsch, Michael Lippautz +1
We demonstrate that general-purpose memory allocation involving many threads on many cores can be done with high performance, multicore scalability, and low memory consumption. For…
Local Linearizability
Andreas Haas, Thomas A. Henzinger, Andreas Holzer +6
The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition du…
Concurrency and Scalability versus Fragmentation and Compaction with Compact-fit
Silviu S. Craciunas, Christoph M. Kirsch, Hannes Payer +2
We study, formally and experimentally, the trade-off in temporal and spatial overhead when managing contiguous blocks of memory using the explicit, dynamic and real-time heap manag…