VLDB 2026 Research / reviewers in the wild / expert
Peter van Emde Boas
dblp:43/5920
· DBLP profile ↗
36ranked-venue papers
13as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 26 · 11 first-authorDatabases, data management, data science and information retrieval · 11 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 1 first-authorArtificial intelligence and machine learning · 3Software engineering, systems software and programming languages · 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.
| Theoretical computer science
7 papers |
Computational complexity · 60% Algorithms and data structures · 21% Logic in computer science · 11% | |
| Databases, data mining, and information retrieval
2 papers |
Information retrieval · 74% Data models and query languages · 26% | |
| Software engineering, system software, and programming languages
2 papers |
Programming languages and type systems · 36% Concurrent programming · 32% Program verification · 32% |
Topics — the 19 heaviest of 21, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
complexity classes |
0.0 | 2 | 1989 | Simplicity, Immunity, Relativizations and Nondeterminism · Inf. Comput. 1989 A Comparison of the Properties of Complexity Classes and Honesty Classes · ICALP 1972 |
Algorithms and data structures
dynamic data structures |
0.0 | 1 | 1989 | Maintaining Multiple Representations of Dynamic Data Structures · Inf. Comput. 1989 |
Computational complexity › structural complexity
immunity |
0.0 | 1 | 1989 | Simplicity, Immunity, Relativizations and Nondeterminism · Inf. Comput. 1989 |
Computational complexity
nondeterminism |
0.0 | 1 | 1989 | Simplicity, Immunity, Relativizations and Nondeterminism · Inf. Comput. 1989 |
Computational complexity
relativization |
0.0 | 1 | 1989 | Simplicity, Immunity, Relativizations and Nondeterminism · Inf. Comput. 1989 |
Computational complexity
structural complexity |
0.0 | 1 | 1989 | Simplicity, Immunity, Relativizations and Nondeterminism · Inf. Comput. 1989 |
Automata and formal languages › finite automata
sequential machines |
0.0 | 1 | 1988 | The Problem of Space Invariance for Sequential Machines · Inf. Comput. 1988 |
Computational complexity
space complexity |
0.0 | 2 | 1988 | On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space · STOC 1984 The Problem of Space Invariance for Sequential Machines · Inf. Comput. 1988 |
Logic in computer science
proof theory |
0.0 | 1 | 1985 | Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem · ICALP 1985 |
Logic in computer science › proof theory
soundness and completeness |
0.0 | 1 | 1985 | Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem · ICALP 1985 |
Algorithms and data structures › data structure design › search structures › hashing
hash functions |
0.0 | 1 | 1984 | On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space · STOC 1984 |
Algorithms and data structures › data structure design › search structures › hashing
perfect hashing |
0.0 | 1 | 1984 | On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space · STOC 1984 |
Computational complexity › computational models
random access machine simulation |
0.0 | 1 | 1984 | On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space · STOC 1984 |
Information retrieval
hashing |
0.0 | 1 | 1983 | The Reconstruction and Optimization of Trie Hashing Functions · VLDB 1983 |
Information retrieval › hashing › hash table design
trie hashing |
0.0 | 1 | 1983 | The Reconstruction and Optimization of Trie Hashing Functions · VLDB 1983 |
Programming languages and type systems
language semantics |
0.0 | 1 | 1977 | On the Proper Treatment or Referencing, Dereferencing and Assignment · ICALP 1977 |
Concurrent programming
concurrency semantics |
0.0 | 1 | 1985 | Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem · ICALP 1985 |
Program verification
modular reasoning |
0.0 | 1 | 1985 | Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem · ICALP 1985 |
Algorithms and data structures
priority queues |
0.0 | 1 | 1975 | Preserving Order in a Forest in less than Logarithmic Time · FOCS 1975 |
Methods — techniques the papers use, named apart from their topics
proof system · 0.0simulation · 0.0perfect hashing · 0.0stratified binary tree · 0.0formal semantics · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Turing Machines for Dummies - Why Representations Do Matter
Peter van Emde Boas |
SOFSEM | 1 |
| 2007 | Theory of Computation at CiE 2005
S. Barry Cooper, Benedikt Löwe, Peter van Emde Boas |
Theory Comput. Syst. | 3 |
| 1998 | Compiling Horn-Clause Rules in IBM's Business System 12 and Early Experiment in Declarativeness
Ghica van Emde Boas-Lubsen, Peter van Emde Boas |
SOFSEM | 2 |
| 1994 | Information Acquisition from Multi-agent Resources
Zhisheng Huang, Peter van Emde Boas |
TARK | 2 |
| 1994 | The STO-Problem is NP-Hard
Krzysztof R. Apt, Peter van Emde Boas, Angelo Welling |
J. Symb. Comput. | 2 |
| 1993 | Resolution of Constraint Inconsistency with the Aim to Provide Support in Anaesthesia
Ernest Rotterdam, Sieger van Denneheuvel, Pim Hennis, Peter van Emde Boas |
DEXA | 4 |
| 1993 | Object Oriented Application Flow Graphs and their Semantics
Erik de Haas, Peter van Emde Boas |
MFCS | 2 |
| 1993 | Twenty Questions to a P-Selector
Harry Buhrman, Leen Torenvliet, Peter van Emde Boas |
Inf. Process. Lett. | 3 |
| 1993 | A survey of the rule language RL/1
Sieger van Denneheuvel, Karen L. Kwast, Zhisheng Huang, Peter van Emde Boas |
J. Comput. Sci. Technol. | 4 |
| 1991 | Physiological modelling using RL
Fred de Geus, Ernest Rotterdam, Sieger van Denneheuvel, Peter van Emde Boas |
AIME | 4 |
| 1991 | Symbolic computation in RL/1
Sieger van Denneheuvel, Karen L. Kwast, Peter van Emde Boas, Fred de Geus, Ernest Rotterdam |
DEXA | 3 |
| 1990 | The rule language RL/1
Sieger van Denneheuvel, Peter van Emde Boas |
DEXA | 2 |
| 1989 | Integrating Relational Databases and Constraint Languages
Michael R. Hansen, Bo S. Hansen, Peter Lucas 0001, Peter van Emde Boas |
Comput. Lang. | 4 |
| 1989 | Maintaining Multiple Representations of Dynamic Data Structures
Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas |
Inf. Comput. | 4 |
| 1989 | Simplicity, Immunity, Relativizations and Nondeterminism
Leen Torenvliet, Peter van Emde Boas |
Inf. Comput. | 2 |
| 1989 | Space Measures for Storage Modification Machines
Peter van Emde Boas |
Inf. Process. Lett. | 1 |
| 1988 | The Problem of Space Invariance for Sequential Machines
Cees F. Slot, Peter van Emde Boas |
Inf. Comput. | 2 |
| 1986 | A Semantical Model for Integration and Modularization of Rules
Peter van Emde Boas |
MFCS | 1 |
| 1986 | Two Results on Tables
C. T. M. Jacobs, Peter van Emde Boas |
Inf. Process. Lett. | 2 |
| 1985 | Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem
Job Zwiers, Willem P. de Roever, Peter van Emde Boas |
ICALP | 3 |
| 1985 | Combined Simplicity and Immunity in Relativized NP
Leen Torenvliet, Peter van Emde Boas |
STACS | 2 |
| 1984 | On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of SpaceabstractIn Complexity Theory the use of informal estimates can be justified by appealing to the Invariance thesis which states that all standard models of computing devices are sufficiently equivalent. This thesis would require, among others, that a RAM can be simulated by a Turingmachine with constant factor overhead in space. Such a simulation is hard to obtain if the traditional spacemeasure for RAM-space is used. The simulation uses a new method for condensing space, based on perfect hashing. Cees F. Slot, Peter van Emde Boas |
STOC | 2 |
| 1983 | The Reconstruction and Optimization of Trie Hashing Functions
Leen Torenvliet, Peter van Emde Boas |
VLDB | 2 |
| 1982 | A Note on 'Master Keys for Group Sharing'
Andries E. Brouwer, Peter van Emde Boas |
Inf. Process. Lett. | 2 |
| 1980 | On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination
Peter van Emde Boas |
Inf. Process. Lett. | 1 |
| 1979 | Complexity of linear problems
Peter van Emde Boas |
FCT | 1 |
| 1978 | The Connection between Modal Logic and Algorithmic Logic
Peter van Emde Boas |
MFCS | 1 |
| 1978 | A note on the recursive enumerability of some classes of recursively enumerable languages
Peter van Emde Boas, Paul M. B. Vitányi |
Inf. Sci. | 1 |
| 1978 | Some Applications of the McCreight-Meyer Algorithm in Abstract Complexity Theory
Peter van Emde Boas |
Theor. Comput. Sci. | 1 |
| 1977 | On the Proper Treatment or Referencing, Dereferencing and Assignment
Theo M. V. Janssen, Peter van Emde Boas |
ICALP | 2 |
| 1977 | The Expressive Power of Intensional Logic in the Semantics of Programming Languages
Theo M. V. Janssen, Peter van Emde Boas |
MFCS | 2 |
| 1977 | Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space
Peter van Emde Boas |
Inf. Process. Lett. | 1 |
| 1977 | Design and Implementation of an Efficient Priority Queue
Peter van Emde Boas, R. Kaas, E. Zijlstra |
Math. Syst. Theory | 1 |
| 1975 | Preserving Order in a Forest in less than Logarithmic TimeabstractWe present a data structure, based upon a stratified binary tree, which enables us to manipulate on-line a priority queue whose priorities are selected from the interval 1...n, with an average and worst case processing time of O(log log n) per instruction. The structure is used to obtain a mergeable heap whose time requirements are about as good. Peter van Emde Boas |
FOCS | 1 |
| 1975 | Ten Years of Speedup
Peter van Emde Boas |
MFCS | 1 |
| 1972 | A Comparison of the Properties of Complexity Classes and Honesty Classes
Peter van Emde Boas |
ICALP | 1 |