Demo Data from EDBT 2026 / reviewers in the wild / expert
Millind Mittal
dblp:274/7296
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 architecture, parallel and distributed computing, and storage systems
1 paper |
Interconnection networks and networks-on-chip · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip › network topology › hypercube variant
cube-connected network |
0.0 | 1 | 1991 | Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps · IEEE Trans. Computers 1991 |
Interconnection networks and networks-on-chip › routing algorithms
permutation routing |
0.0 | 1 | 1991 | Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps · IEEE Trans. Computers 1991 |
Algorithms and data structures
parallel algorithms |
0.0 | 1 | 1991 | Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps · IEEE Trans. Computers 1991 |
Methods — techniques the papers use, named apart from their topics
recursive karnaugh maps · 0.0parallel setup · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh MapsabstractOptimal setup procedures for cube-connected networks are described. The setup patterns include paths, transpositions, cycles, and one-pass permutations. It is shown that for an N-input cube-connected network, the procedure for paths requires O(log/sub 2/ N) steps and O(N) space, the procedure for transportations and cycles requires O(N) steps and O(N) space, and the procedure for permutations takes O(N log/sub 2/ N) steps and O(N) space. It is also shown that the time complexities of the setup procedures for transpositions, cycles, and permutations can be improved as O(log/sub 2/ N) by using O(N) processors.> A. Yavuz Oruç, Millind Mittal |
IEEE Trans. Computers | 2 |