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. Aggarwal

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

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

Artificial intelligence and machine learning · 1Computer networks · 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
Internet architecture and protocols · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › protocol design
protocol synthesis
0.011986
Synthesis of two-party error-recoverable protocols · SIGCOMM 1986
Automata and formal languages
protocol modeling
0.011986
Synthesis of two-party error-recoverable protocols · SIGCOMM 1986

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

local modeling · 0.0elaboration · 0.0
YearPublicationVenuePosition
1996 Parallel search-and-learn techniques and graph coloring
C. P. Ravikumar, R. Aggarwal
Knowl. Based Syst.2
1986 Synthesis of two-party error-recoverable protocols
abstract
We have developed a correct, general, and efficient procedure of synthesizing two-party error-recoverable protocols for noisy channels where messages could be lost, corrupted, and/or missequenced. The state explosion problem has been tackled by synthesizing the error-recoverable protocol (ERP) from its noiseless local entity model using certain rules. This reduction arises from the approaches of local modeling and elaboration. We expect that these two approaches will also play a major role in tackling the complexity problems in designing multi-party protocols. Measures of efficiency and functionality improvements have been discussed.
C. V. Ramamoorthy, Yuh Yaw, R. Aggarwal
SIGCOMM3