◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Vaidya

74 papers hereh-index 7127.8k citations452 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author3
  • middle author3
  • last author64

Across the 72 of 74 papers where every author was matched, so the position is known.

fields
  • cs.DC62
  • cs.CR4
  • cs.LG2
  • cs.NI2
  • eess.SY2
  • cs.IT1
same name
  • N. Vaidya — 2 papers
  • N. Vaidya — 2 papers, h 15
  • N. Vaidya — 2 papers
  • N. Vaidya — 1 paper
  • N. Vaidya — 1 paper, h 1
  • N. Vaidya — 1 paper, h 8

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092022
most citedByzantine Multi-Agent Optimization: Part II

33 citations · 254 across the 68 of their papers we have counts for

collaborators
Showing 2018 · cs.DCShow all

4 papers · 2 filters

cs.DC2018★ 4 cited

Exact Byzantine Consensus Under Local-Broadcast Model

Syed Shalan Naqvi, Muhammad Samir Khan, Nitin H. Vaidya

This paper considers the problem of achieving exact Byzantine consensus in a synchronous system under a local-broadcast communication model. The nodes communicate with each other v…

cs.DC2018★ 1 cited

Optimal Record and Replay under Causal Consistency

Russell L. Jones, Muhammad S. Khan, Nitin H. Vaidya

We investigate the minimum record needed to replay executions of processes that share causally consistent memory. For a version of causal consistency, we identify optimal records u…

cs.DC2018★ 3 cited

Global Stabilization for Causally Consistent Partial Replication

Zhuolun Xiang, Nitin H. Vaidya

Causally consistent distributed storage systems have received significant attention recently due to the potential for providing high throughput and causality guarantees. {\em Globa…

cs.DC2018★ 2 cited

Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus

Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya

Consider a point-to-point message-passing network. We are interested in the asynchronous crash-tolerant consensus problem in incomplete networks. We study the feasibility and effic…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.