Demo Data from EDBT 2026 / reviewers in the wild / expert
Sven-Olof Nyström
dblp:67/5486
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 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.
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems › logic programming
concurrent constraint programming |
0.0 | 1 | 1998 | A Fully Abstract Semantics for Concurrent Constraint Programming · Inf. Comput. 1998 |
Programming languages and type systems › program equivalence
full abstraction |
0.0 | 1 | 1998 | A Fully Abstract Semantics for Concurrent Constraint Programming · Inf. Comput. 1998 |
Programming languages and type systems
language semantics |
0.0 | 1 | 1998 | A Fully Abstract Semantics for Concurrent Constraint Programming · Inf. Comput. 1998 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Retargetable Graph-Coloring Register Allocation for Irregular Architectures
Johan Runeson, Sven-Olof Nyström |
SCOPES | 2 |
| 1998 | A Fully Abstract Semantics for Concurrent Constraint Programming
Sven-Olof Nyström, Bengt Jonsson 0001 |
Inf. Comput. | 1 |
| 1996 | There is no Fully Abstract Fixpoint Semantics for Non-Deterministic Languages with Infinite Computations
Sven-Olof Nyström |
Inf. Process. Lett. | 1 |