Cryptology ePrint Archive: Report 2010/392
Available versions in chronological order
20100711:203001 (posted 11-Jul-2010 20:30:01 UTC)
Interplay between (im)perfectness, synchrony and connectivity: Case of Probabilistic Reliable Communication
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: A part of this work is to appear as a Brief Announcement in DISC 2010
20100712:150518 (posted 12-Jul-2010 15:05:18 UTC)
Interplay between (im)perfectness, synchrony and connectivity: The Case of Probabilistic Reliable Communication
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: A part of this work is to appear as a Brief Announcement in DISC 2010
20100713:143116 (posted 13-Jul-2010 14:31:16 UTC)
Interplay between (im)perfectness, synchrony and connectivity: The Case of Probabilistic Reliable Communication
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: A part of this work is to appear as a Brief Announcement in DISC 2010
20101216:073803 (posted 16-Dec-2010 07:38:03 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010 \cite{DBLP:conf/wdag/MehtaAS10}. Detailed proofs of this result appear in this paper (alongwith several other important results).
20101216:074435 (posted 16-Dec-2010 07:44:35 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010 \cite{DBLP:conf/wdag/MehtaAS10}. Detailed proofs of this result appear in this paper (alongwith several other important results).
20101216:074613 (posted 16-Dec-2010 07:46:13 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010 \cite{DBLP:conf/wdag/MehtaAS10}. Detailed proofs of this result appear in this paper (alongwith several other important results).
20101223:161628 (posted 23-Dec-2010 16:16:28 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010 \cite{DBLP:conf/wdag/MehtaAS10}. Detailed proofs of this result appear in this paper (alongwith several other important results).
20110420:213052 (posted 20-Apr-2011 21:30:52 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010 \cite{DBLP:conf/wdag/MehtaAS10}. Detailed proofs of this result appear in this paper (alongwith several other important results).
20110514:195215 (posted 14-May-2011 19:52:15 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010 \cite{DBLP:conf/wdag/MehtaAS10}. Detailed proofs of this result appear in this paper (alongwith several other important results).
20110514:195537 (posted 14-May-2011 19:55:37 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010. Detailed proofs of this result appear in this paper (alongwith several other important results).
20110514:195728 (posted 14-May-2011 19:57:28 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010. Detailed proofs of this result appear in this paper (alongwith several other important results).
20110715:203905 (posted 15-Jul-2011 20:39:05 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010. Detailed proofs of this result appear in this paper (alongwith several other important results).
20110715:204055 (posted 15-Jul-2011 20:40:55 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010. Detailed proofs of this result appear in this paper (alongwith several other important results).
20110715:204221 (posted 15-Jul-2011 20:42:21 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010. Detailed proofs of this result appear in this paper (alongwith several other important results).
20110808:183337 (posted 08-Aug-2011 18:33:37 UTC)
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Abhinav Mehta, Shashank Agrawal, Kannan Srinathan
Publication Info: The theorem establishing equivalence between the connectivity requirements for the possibility of synchronous Las Vegas URMT and that of asynchronous Monte Carlo URMT appears without proof as a brief announcement in the proceedings of DISC 2010. Detailed proofs of this result appear in this paper (alongwith several other important results).
[
Cryptology ePrint archive
]