Demo Data from VLDB 2026 / reviewers in the wild / expert
Louis Mak
dblp:52/1770
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1997 | Parallelism Always Helps · SIAM J. Comput. 1997 |
Parallel and multicore computing
parallel programming models |
0.0 | 1 | 1997 | Parallelism Always Helps · SIAM J. Comput. 1997 |
Parallel and multicore computing › parallel computation models
PRAM |
0.0 | 1 | 1997 | Parallelism Always Helps · SIAM J. Comput. 1997 |
Parallel and multicore computing › parallel algorithms
PRAM simulation |
0.0 | 1 | 1997 | Parallelism Always Helps · SIAM J. Comput. 1997 |
Computational complexity
parallel complexity |
0.0 | 1 | 1997 | Parallelism Always Helps · SIAM J. Comput. 1997 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0constructive proof · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Parallelism Always HelpsabstractIt is shown that every unit-cost random-access machine (RAM) that runs in time T can be simulated by a concurrent-read exclusive-write parallel random-access machine (CREW PRAM) in time $O(\rt{T} \log T)$. The proof is constructive; thus it gives a mechanical way to translate any sequential algorithm designed to run on a unit-cost RAM into a parallel algorithm that runs on a CREW PRAM and obtain a nearly quadratic speedup. One implication is that there does not exist any recursive function that is "inherently not parallelizable." Louis Mak |
SIAM J. Comput. | 1 |
| 1994 | Are Parallel Machines Always Faster than Sequential Machines? (Preliminary Version)
Louis Mak |
STACS | 1 |
| 1994 | Speedup of Determinism by Alternation for Multidimensional Turing Machines
Louis Mak |
Theor. Comput. Sci. | 1 |