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

Osman Guzide

dblp:42/4658 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Theory of computation · 2Databases, data management, data science and information retrieval · 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%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
butterfly network		 0.112005
Mapping Cycles and Trees on Wrap-Around Butterfly Graphs · SIAM J. Comput. 2005
Interconnection networks and networks-on-chip
graph embedding		 0.112005
Mapping Cycles and Trees on Wrap-Around Butterfly Graphs · SIAM J. Comput. 2005

Methods — techniques the papers use, named apart from their topics

group theory · 0.1algebraic representation · 0.1
YearPublicationVenuePosition
2005 Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
abstract
We give a new algebraic representation for the wrap-around butterfly interconnection network. This new representation is based on the direct product of groups and finite fields and allows an algebraic expression of the network connectivity. The abstract algebraic tools may then be employed to explore the structural properties of the butterfly. In this paper we exploit this model to map guest graphs on the butterfly. In particular, we provide designs of unit dilation mappings of all possible length cycles on butterflies. We also map the largest possible binary trees on butterfly networks with a dilation 2 if the network degree is less than 16, 3 if it is less than 32, and 4 if it is less than 64. This is a great improvement over previous results.
Meghanad D. Wagh, Osman Guzide
 SIAM J. Comput.2
2000 Cyclic-cubes and wrap-around butterflies
Meghanad D. Wagh, Prakash Math, Osman Guzide
 Inf. Process. Lett.3