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

R. Sai Anand

dblp:24/868 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · none

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

Theory of computation · 5 · 3 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.

Computer networks
1 paper
Internet architecture and protocols · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › signaling
call control
0.012002
Call Control in Rings · ICALP 2002

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

combinatorial algorithms · 0.0combinatorial algorithm · 0.0
YearPublicationVenuePosition
2007 Call Control in Rings
Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
Algorithmica3
2003 Routing and Call Control Algorithms for Ring Networks
R. Sai Anand, Thomas Erlebach
WADS1
2003 Call control with k rejections
R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
J. Comput. Syst. Sci.1
2002 Call Control in Rings
Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
ICALP3
2002 On-line Algorithms for Edge-Disjoint Paths in Trees of Rings
R. Sai Anand, Thomas Erlebach
LATIN1