EDBT 2026 Demo / reviewers in the wild / expert
Sairam Sairam
dblp:91/1652
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 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
1 paper |
Graph algorithms and graph theory · 50% Approximation and online algorithms · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1992 | A Parallel Randomized Approximation Scheme for Shortest Paths · STOC 1992 |
Parallel and multicore computing › parallel algorithms
randomized parallel algorithms |
0.0 | 1 | 1992 | A Parallel Randomized Approximation Scheme for Shortest Paths · STOC 1992 |
Graph algorithms and graph theory › shortest path
approximate shortest paths |
0.0 | 1 | 1992 | A Parallel Randomized Approximation Scheme for Shortest Paths · STOC 1992 |
Approximation and online algorithms
approximation schemes |
0.0 | 1 | 1992 | A Parallel Randomized Approximation Scheme for Shortest Paths · STOC 1992 |
Approximation and online algorithms › approximation algorithms
parallel approximation algorithms |
0.0 | 1 | 1992 | A Parallel Randomized Approximation Scheme for Shortest Paths · STOC 1992 |
Graph algorithms and graph theory › graph algorithms › path problems
shortest path algorithms |
0.0 | 1 | 1992 | A Parallel Randomized Approximation Scheme for Shortest Paths · STOC 1992 |
Methods — techniques the papers use, named apart from their topics
ullman-yannakakis technique · 0.0random sampling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Dynamic algorithms for optimization problems in bounded tree-width graphs
Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter |
IPCO | 2 |
| 1993 | A Complexity Theoretic Approach to Incremental Computation
Sairam Sairam, Jeffrey Scott Vitter, Roberto Tamassia |
STACS | 1 |
| 1992 | A Parallel Randomized Approximation Scheme for Shortest PathsabstractWe give a randomized parallel algorithm for approximate shortest path computation in an undirected weighted graph. The algorithm is based on a technique used by Ullman and Yannakakis in a parallel algorithm for breadth-first search. It has application, e.g., in approximate solution of multicommodity flow problems with unit capacities. We also show how to adapt the algorithm to perform better for planar graphs. Philip N. Klein, Sairam Sairam |
STOC | 2 |