Demo Data from EDBT 2026 / reviewers in the wild / expert
Ajai Thirumalai
dblp:62/2997
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
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 |
Interconnection networks and networks-on-chip · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip › permutation network
cellular permutation array |
0.0 | 1 | 1989 | A Systematic Design of Cellular Permutation Arrays · IEEE Trans. Computers 1989 |
Interconnection networks and networks-on-chip › switching network
multistage interconnection network |
0.0 | 1 | 1989 | A Systematic Design of Cellular Permutation Arrays · IEEE Trans. Computers 1989 |
Interconnection networks and networks-on-chip
network topology |
0.0 | 1 | 1989 | A Systematic Design of Cellular Permutation Arrays · IEEE Trans. Computers 1989 |
Interconnection networks and networks-on-chip › routing algorithms
permutation routing |
0.0 | 1 | 1989 | A Systematic Design of Cellular Permutation Arrays · IEEE Trans. Computers 1989 |
Interconnection networks and networks-on-chip
routing algorithms |
0.0 | 1 | 1989 | A Systematic Design of Cellular Permutation Arrays · IEEE Trans. Computers 1989 |
Methods — techniques the papers use, named apart from their topics
symmetric group theory · 0.0coset decomposition · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | A Systematic Design of Cellular Permutation ArraysabstractA parametrized design technique is presented of cellular permutation arrays based on coset decompositions of symmetric groups. A type of permutation cell referred to as a coset generator is introduced to customize the propagation delay, fan-in, fan-out, and number of edges in the target network. To aid in the design process, a cost function is derived expressing the number of edges in terms of the number of inputs and the sizes of cells. The results provide a spectrum of networks which vary with the size of the coset generator used and range from a simple bipartite graph to several cellular permutation arrays reported in the literature.> A. Yavuz Oruç, Ajai Thirumalai |
IEEE Trans. Computers | 2 |
| 1987 | Cellular Permutation Network Designs with Coset Generators
A. Yavuz Oruç, Ajai Thirumalai |
ICPP | 2 |