The following pages link to Nitin H. Vaidya (Q223035):
Displaying 44 items.
- (Q901875) (redirect page) (← links)
- Multidimensional agreement in Byzantine systems (Q901876) (← links)
- Anycasting-based protocol for geocast service in mobile ad hoc networks. (Q1400394) (← links)
- Non-Bayesian learning in the presence of Byzantine agents (Q1660950) (← links)
- Location-aided routing (LAR) in mobile ad hoc networks (Q1854895) (← links)
- Analysis of TCP performance over mobile ad hoc networks (Q1858047) (← links)
- Asynchronous non-Bayesian learning in the presence of crash failures (Q2007915) (← links)
- Robust multi-agent optimization: coping with Byzantine agents with input redundancy (Q2007916) (← links)
- Reaching approximate Byzantine consensus with multi-hop communication (Q2013588) (← links)
- Testing equality under the local broadcast model (Q2117734) (← links)
- Link-state routing without broadcast storming for multichannel mesh networks (Q2270111) (← links)
- Defending non-Bayesian learning against adversarial attacks (Q2318111) (← links)
- Broadcast using certified propagation algorithm in presence of Byzantine faults (Q2512829) (← links)
- Fault-tolerant consensus in directed graphs (Q2796282) (← links)
- Byzantine broadcast in point-to-point networks using local linear coding (Q2933807) (← links)
- Iterative approximate byzantine consensus in arbitrary directed graphs (Q2933813) (← links)
- Error-free multi-valued consensus with byzantine failures (Q2943378) (← links)
- Asynchronous convex hull consensus in the presence of crash faults (Q2943639) (← links)
- Robust Distributed Average Consensus via Exchange of Running Sums (Q2980520) (← links)
- Relaxed Byzantine Vector Consensus (Q3174957) (← links)
- A new class of bit- and byte-error control codes (Q4014191) (← links)
- Systematic proximity-detecting codes (Q4392387) (← links)
- Unidirectional bit/byte error control (Q4419705) (← links)
- Roll-forward checkpointing scheme: a novel fault-tolerant architecture (Q4419778) (← links)
- Comparison of duplex and triplex memory reliability (Q4420954) (← links)
- Byzantine-Resilient Multiagent Optimization (Q4990224) (← links)
- (Q5091085) (← links)
- Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model (Q5145230) (← links)
- Partially Replicated Causally Consistent Shared Memory (Q5145248) (← links)
- Byzantine vector consensus in complete graphs (Q5176083) (← links)
- On reliable broadcast in a radio network (Q5177235) (← links)
- Reliable broadcast in radio networks (Q5177287) (← links)
- Reaching Approximate Byzantine Consensus with Multi-hop Communication (Q5207895) (← links)
- Fault-Tolerant Multi-Agent Optimization (Q5361966) (← links)
- Effectiveness of Delaying Timestamp Computation (Q5368975) (← links)
- Iterative Approximate Byzantine Consensus under a Generalized Fault Model (Q5507399) (← links)
- Asynchronous Byzantine Approximate Consensus in Directed Networks (Q5855218) (← links)
- Fault-Tolerance in Distributed Optimization: The Case of Redundancy (Q5855258) (← links)
- (Q5874264) (← links)
- A mutual exclusion algorithm for ad hoc mobile networks (Q5952558) (← links)
- (Q6083390) (← links)
- Contention Resolution with Predictions (Q6201939) (← links)
- Improved extension protocols for Byzantine broadcast and agreement (Q6535027) (← links)
- Iterative approximate Byzantine consensus in arbitrary directed graphs (Q6601209) (← links)
