EDBT 2026 Demo / reviewers in the wild / expert
Christoph Starke 0001
dblp:90/5405-1
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Parallel and multicore computing · 48% Distributed systems · 19% Hardware reliability and fault tolerance · 14% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › parallel algorithms › sorting
merge sort |
0.0 | 1 | 1989 | Systolic s²-Way Merge Sort is Optimal · IEEE Trans. Computers 1989 |
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1989 | Systolic s²-Way Merge Sort is Optimal · IEEE Trans. Computers 1989 |
Distributed systems › fault tolerance
single-fault tolerance |
0.0 | 1 | 1989 | A Correction Network for N-Sorters · SIAM J. Comput. 1989 |
Parallel and multicore computing › parallel algorithms
sorting |
0.0 | 1 | 1989 | Systolic s²-Way Merge Sort is Optimal · IEEE Trans. Computers 1989 |
Interconnection networks and networks-on-chip
sorting network |
0.0 | 1 | 1989 | A Correction Network for N-Sorters · SIAM J. Comput. 1989 |
Embedded and real-time systems › real-time scheduling
complexity analysis |
0.0 | 1 | 1989 | Systolic s²-Way Merge Sort is Optimal · IEEE Trans. Computers 1989 |
Distributed systems
fault tolerance |
0.0 | 1 | 1989 | A Correction Network for N-Sorters · SIAM J. Comput. 1989 |
Parallel and multicore computing › parallel algorithms › parallel algorithm design
systolic algorithms |
0.0 | 1 | 1989 | Systolic s²-Way Merge Sort is Optimal · IEEE Trans. Computers 1989 |
Methods — techniques the papers use, named apart from their topics
systolic construction · 0.0correction network design · 0.0asymptotic optimality · 0.0asymptotic analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Quality and consistency assurance of quote data for algorithmic trading strategiesabstractQuote data are a vital part of information almost every trading algorithm relies on. While increasing effort is put into making trading algorithms better, the quote data as foundation of the algorithms is often asserted to be perfect. In reality, much work is needed to acquire good quote data. This paper shows methods of collecting and storing quote data and how to measure and improve its quality and completeness. Applying these methods leads to greatly improved results and higher speed of algorithms which rely on this quote data. Sven Koschnicke, Vasco Grossmann, Christoph Starke 0001, Manfred Schimmler |
CIFEr | 3 |
| 1989 | A Correction Network for N-SortersabstractA correction network C is introduced that can be added to an arbitrary N-input sorting net in order to achieve single-fault tolerance. Multiple $(k)$ fault robustness is attained by adding $C^k $. For single-fault correction, C is proved to be asymptotically optimal. Manfred Schimmler, Christoph Starke 0001 |
SIAM J. Comput. | 2 |
| 1989 | Systolic s²-Way Merge Sort is OptimalabstractThe time complexity of Thompson and Kung's (1977) s/sup 2/-way merge sort is analyzed and shown to be asymptotically optimal with respect to the recently improved lower bound on sorting on a mesh-connected n*n array. New lower bounds for systolic sorting are derived. A systolic version of s/sup 2/-way merge sort is systematically constructed and shown to be asymptotically optimal as well.> Hartmut Schmeck, Heiko Schröder 0001, Christoph Starke 0001 |
IEEE Trans. Computers | 3 |