Demo Data from VLDB 2026 / reviewers in the wild / expert
Frank Schulz 0002
dblp:s/FranKSchulz2
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 2013
0000-0002-5467-767XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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.
| Theoretical computer science
2 papers |
Graph algorithms and graph theory · 80% Algorithms and data structures · 20% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory › graph algorithms
tree algorithms |
0.1 | 1 | 2008 | Trees with exponentially growing costs · Inf. Comput. 2008 |
Algorithms and data structures › dynamic data structures
self-adjusting data structures |
0.0 | 1 | 1996 | Self-Organizing Data Structures with Dependent Accesses · ICALP 1996 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Elasticity in Service Level AgreementsabstractElasticity has been identified as one of the key features of delivering IT services over the internet. Major definitions of cloud computing consider elasticity as an essential property of cloud services, and as one of the main reasons to use cloud infrastructures. However, customers expect and hope for the elasticity promise without having any guarantee or contractual agreement. While elasticity has mostly been considered on qualitative terms, there have been recent efforts in quantifying elasticity and thus enabling the measurement of elasticity. Based on new approaches of defining elasticity, it becomes possible to specify precise and meaningful elasticity guarantees, which is advantageous for both consumers and providers of cloud services. This work contributes to the ongoing elasticity research by including elasticity terms into service level agreements (SLAs). This is achieved by restricting the validity of service level objectives with respect to the available elasticity. The approach is explained in detail and its advantages and consequences for service providers and consumers are discussed. Frank Schulz 0002 |
SMC | 1 |
| 2008 | Trees with exponentially growing costs
Frank Schulz 0002 |
Inf. Comput. | 1 |
| 1998 | Two New Families of List Update Algorithms
Frank Schulz 0002 |
ISAAC | 1 |
| 1996 | Self-Organizing Data Structures with Dependent Accesses
Frank Schulz 0002, Elmar Schömer |
ICALP | 1 |