Result 1 to 20 of 82 total
Accurate Byzantine agreement with feedback. (English)
Fernández Anta, Antonio (ed.) et al., Principles of distributed systems. 15th international conference, OPODIS 2011, Toulouse, France, December 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25872-5/pbk). Lecture Notes in Computer Science 7109, 465-480 (2011).
1
Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity. (English)
Fernández Anta, Antonio (ed.) et al., Principles of distributed systems. 15th international conference, OPODIS 2011, Toulouse, France, December 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25872-5/pbk). Lecture Notes in Computer Science 7109, 34-49 (2011).
2
A new solution for the Byzantine agreement problem. (English)
J. Parallel Distrib. Comput. 71, No. 10, 1261-1277 (2011).
3
Byzantine agreement using partial authentication. (English)
Peleg, David (ed.), Distributed computing. 25th international symposium, DISC 2011, Rome, Italy, September 20‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24099-7/pbk). Lecture Notes in Computer Science 6950, 389-403 (2011).
4
Synchronous consensus under hybrid process and link failures. (English)
Theor. Comput. Sci. 412, No. 40, 5602-5630 (2011).
5
Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience. (English)
Fehr, Serge (ed.), Information theoretic security. 5th international conference, ICITS 2011, Amsterdam, The Netherlands, May 21‒24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20727-3/pbk). Lecture Notes in Computer Science 6673, 206-226 (2011).
6
A faster P solution for the Byzantine agreement problem. (English)
Gheorghe, Marian (ed.) et al., Membrane computing. 11th international conference, CMC 2010, Jena, Germany, August 24‒27, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18122-1/pbk). Lecture Notes in Computer Science 6501, 175-197 (2010).
7
Reputation and trust management in heterogeneous peer-to-peer networks. (English)
Telecommun. Syst. 44, No. 3-4, 191-203 (2010).
8
P systems and the Byzantine agreement. (English)
J. Log. Algebr. Program. 79, No. 6, 334-349 (2010).
9
The anatomy study of consensus agreement in MANETs. (English)
Comput. Electr. Eng. 36, No. 1, 234-253 (2010).
10
An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network. (English)
Comput. Electr. Eng. 36, No. 1, 100-113 (2010).
11
Specifying fault-tolerance using split precondition logic. (Short paper). (English)
Kant, Krishna (ed.) et al., Distributed computing and networking. 11th international conference, ICDCN 2010, Kolkata, India, January 3‒6, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11321-5/pbk). Lecture Notes in Computer Science 5935, 466-472 (2010).
12
The agreement problem in unreliable scale-free networks. (English)
Comput. J. 52, No. 4(B), 499-509 (2009).
13
A new solution to detectable Byzantine agreement problem. (English)
Commun. Theor. Phys. 52, No. 6, 1013-1015 (2009).
14
On the round complexity of Byzantine agreement without initial set-up. (English)
Inf. Comput. 207, No. 12, 1351-1368 (2009).
15
On Byzantine generals with alternative plans. (English)
J. Parallel Distrib. Comput. 68, No. 9, 1291-1296 (2008).
16
The incremental agreement. (English)
Inf. Process. Lett. 107, No. 5, 165-170 (2008).
17
Lower bound for scalable byzantine agreement. (English)
Distrib. Comput. 21, No. 4, 239-248 (2008).
18
Byzantine agreement \& fault diagnosis agreement in dynamic ad-hoc environment. (English)
Fundam. Inform. 89, No. 2-3, 161-187 (2008).
19
Reaching agreement among virtual subnets in hybrid failure mode. (English)
IEEE Trans. Parallel Distrib. Syst. 19, No. 09, 1252-1262 (2008).
20
Result 1 to 20 of 82 total
Start
Contact
Print
General Help
