Result 1 to 20 of 77 total
Homonyms with forgeable identifiers. (English)
Even, Guy (ed.) et al., Structural information and communication complexity. 19th international colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30‒July 2, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31103-1/pbk). Lecture Notes in Computer Science 7355, 171-182 (2012).
1
Byzantine agreement with homonyms in synchronous systems. (English)
Bononi, Luciano (ed.) et al., Distributed computing and networking. 13th international conference, ICDCN 2012, Hong Kong, China, January 3‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-25958-6/pbk). Lecture Notes in Computer Science 7129, 76-90 (2012).
2
The minimum information about failures for solving non-local tasks in message-passing systems. (English)
Distrib. Comput. 24, No. 5, 255-269 (2011).
3
The disagreement power of an adversary. (English)
Distrib. Comput. 24, No. 3-4, 137-147 (2011).
4
Brief announcement: on the meaning of solving a task with a failure detector. (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, 145-146 (2011).
5
Objets partagés et détecteurs de défaillances (English)
Technique et Science Informatiques 30, No. 7, 841-871 (2011).
6
Brief announcement: on the meaning of solving a task with a failure detector (English)
DISC, 145-146 (2011).
7
Byzantine agreement with homonyms (English)
PODC, 21-30 (2011).
8
Guidelines for the verification of population protocols (English)
ICDCS, 215-224 (2011).
9
Stabilizing leader election in partial synchronous systems with crash failures. (English)
J. Parallel Distrib. Comput. 70, No. 1, 45-58 (2010).
10
Approximation of $δ$-timeliness. (English)
Dolev, Shlomi (ed.) et al., Stabilization, safety, and security of distributed systems. 12th international symposium, SSS 2010, New York, NY, USA, September 20‒22, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16022-6/pbk). Lecture Notes in Computer Science 6366, 435-451 (2010).
11
Algorithms for extracting timeliness graphs. (English)
Comput. Res. Repos. 2010, Article No. 1003.1058 (2010).
12
Tight failure detection bounds on atomic object implementations. (English)
J. ACM 57, No. 4 (2010).
13
Algorithms for extracting timeliness graphs. (English)
Patt-Shamir, Boaz (ed.) et al., Structural information and communication complexity. 17th international colloquium, SIROCCO 2010, Şirince, Turkey, June 7‒11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13283-4/pbk). Lecture Notes in Computer Science 6058, 127-141 (2010).
14
Algorithms for extracting timeliness graphs (English)
SIROCCO, 127-141 (2010).
15
Brief announcement: byzantine agreement with homonyms (English)
SPAA, 74-75 (2010).
16
Approximation of {\it delta}-timeliness (English)
SSS, 435-451 (2010).
17
Fault-tolerant consensus in unknown and anonymous networks. (English)
Comput. Res. Repos. 2009, Article No. 0903.3461 (2009).
18
The minimum information about failures for solving non-local tasks in message-passing systems. (English)
Abdelzaher, Tarek (ed.) et al., Principles of distributed systems. 13th international conference, OPODIS 2009, N{\^i}mes, France, December 15‒18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10876-1/pbk). Lecture Notes in Computer Science 5923, 115-128 (2009).
19
Brief announcement: The minimum failure detector for non-local tasks in message-passing systems. (English)
Keidar, Idit (ed.), Distributed computing. 23rd international symposium, DISC 2009, Elche, Spain, September 23‒25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04354-3/pbk). Lecture Notes in Computer Science 5805, 358-359 (2009).
20
Result 1 to 20 of 77 total
Start
Contact
Print
General Help
