Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Arie Hordijk

dblp:06/347 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Computer networks
1 paper
Routing and switching · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › routing algorithms
optimal routing		 0.012000
Balanced sequences and optimal routing · J. ACM 2000
Routing and switching
routing		 0.012000
Balanced sequences and optimal routing · J. ACM 2000
Mathematical optimization
combinatorial optimization		 0.012000
Balanced sequences and optimal routing · J. ACM 2000
Performance modeling and evaluation › queueing models
queueing network model		 0.012000
Balanced sequences and optimal routing · J. ACM 2000
YearPublicationVenuePosition
2001 Bounds for Deterministic Periodic Routing Sequences
Arie Hordijk, D. A. van der Laan
 IPCO1
2000 Balanced sequences and optimal routing
abstract
The objective pursued in this paper is two-fold. The first part addresses the following combinatorial problem: is it possible to construct an infinite sequence over n letters where each letter is distributed as “evenly” as possible and appears with a given rate? The second objective of the paper is to use this construction in the framework of optimal routing in queuing networks. We show under rather general assumptions that the optimal deterministic routing in stochastic event graphs is such a sequence.
Eitan Altman, Bruno Gaujal, Arie Hordijk
 J. ACM3