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

Akash Nanavati

dblp:63/3496 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Theory of computation · 4Systems, architecture and hardware · 1Security and privacy · 1Software engineering, systems software and programming languages · 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.

Theoretical computer science
2 papers
Approximation and online algorithms · 53% Algorithmic game theory and mechanism design · 47%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
matching
0.112006
Randomized online algorithms for minimum metric bipartite matching · SODA 2006
Approximation and online algorithms
online algorithms
0.112006
Randomized online algorithms for minimum metric bipartite matching · SODA 2006
Approximation and online algorithms › online algorithms › online matching
online bipartite matching
0.112006
Randomized online algorithms for minimum metric bipartite matching · SODA 2006
Algorithmic game theory and mechanism design › mechanism design › decentralized mechanism
coordination mechanisms
0.012004
Coordination Mechanisms · ICALP 2004

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

randomization · 0.1competitive analysis · 0.1
YearPublicationVenuePosition
2009 Coordination mechanisms
George Christodoulou 0001, Elias Koutsoupias, Akash Nanavati
Theor. Comput. Sci.3
2006 Randomized online algorithms for minimum metric bipartite matching
Adam Meyerson, Akash Nanavati, Laura J. Poplawski
SODA2
2004 Coordination Mechanisms
George Christodoulou 0001, Elias Koutsoupias, Akash Nanavati
ICALP3
2004 An Algorithmic Approach to Identifying Link Failures
abstract
Due to the Internet's sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes of BGP update messages that occur from time to time. To provide dependable global data delivery we need diagnostic tools that can pinpoint the exact connectivity changes. We describe an algorithm, called MVSChange that can pin down the origin of routing changes due to any single link failure or link restoration. Using a simplified model of BGP, called simple path vector protocol (SPVP), and a graph model of the Internet, MVSChange takes as input the SPVP update messages collected from multiple vantage points and accurately locates the link that initiated the routing changes. We provide theoretical proof for the correctness of the design.
Mohit Lad, Akash Nanavati, Daniel Massey, Lixia Zhang 0001
PRDC2
2003 A Probabilistic Approach to Buffer Insertion
Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati, Ankur Srivastava 0001
ICCAD3
2003 The Online Matching Problem on a Line
Elias Koutsoupias, Akash Nanavati
WAOA2