-
2
-
-
84870843897
-
Stably computable properties of network graphs
-
June
-
Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, and René Peralta. Stably computable properties of network graphs. IEEE/A CM International Conference on Distributed Computing in Sensor Systems, June 2005.
-
(2005)
IEEE/A CM International Conference on Distributed Computing in Sensor Systems
-
-
Angluin, D.1
Aspnes, J.2
Chan, M.3
Fischer, M.J.4
Jiang, H.5
Peralta, R.6
-
3
-
-
10444287574
-
Computation in networks of passively mobile finite-state sensors
-
Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. In Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, pages 290-299, 2004.
-
(2004)
Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing
, pp. 290-299
-
-
Angluin, D.1
Aspnes, J.2
Diamadi, Z.3
Fischer, M.J.4
Peralta, R.5
-
5
-
-
0037088948
-
Computing in totally anonymous asynchronous shared memory systems
-
March
-
Hagit Attiya, Alla Gorbach, and Shlomo Moran. Computing in totally anonymous asynchronous shared memory systems. Information and Computation, 173(2): 162-183, March 2002.
-
(2002)
Information and Computation
, vol.173
, Issue.2
, pp. 162-183
-
-
Attiya, H.1
Gorbach, A.2
Moran, S.3
-
8
-
-
32844461160
-
On the importance of having an identity or, is consensus really universal?
-
Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, and Paul Vitanyi. On the importance of having an identity or, is consensus really universal? Distributed Computing, 18(3):167-176, 2006.
-
(2006)
Distributed Computing
, vol.18
, Issue.3
, pp. 167-176
-
-
Buhrman, H.1
Panconesi, A.2
Silvestri, R.3
Vitanyi, P.4
-
10
-
-
0035272541
-
A simple game for the study of trust in distributed systems
-
March 2001. Also appears as Yale Technical Report TR-1207, January
-
Zoë Diamadi and Michael J. Fischer. A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences, 6(1-2):72-82, March 2001. Also appears as Yale Technical Report TR-1207, January 2001.
-
(2001)
Wuhan University Journal of Natural Sciences
, vol.6
, Issue.1-2
, pp. 72-82
-
-
Diamadi, Z.1
Fischer, M.J.2
-
11
-
-
32844471852
-
Naming symmetric processes using shared variables
-
Ömer Eǧecioǧlu and Ambuj K. Singh. Naming symmetric processes using shared variables. Distributed Computing, 8(1):19-38, 1994.
-
(1994)
Distributed Computing
, vol.8
, Issue.1
, pp. 19-38
-
-
Eǧecioǧlu, Ö.1
Singh, A.K.2
-
12
-
-
0141854015
-
Hundreds of impossibility results for distributed computing
-
September
-
Faith Fich and Eric Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2-3):121-163, September 2003.
-
(2003)
Distributed Computing
, vol.16
, Issue.2-3
, pp. 121-163
-
-
Fich, F.1
Ruppert, E.2
-
13
-
-
44049109914
-
A rigorous derivation of the chemical master equation
-
Daniel T. Gillespie. A rigorous derivation of the chemical master equation. Physica A, 188:404-425, 1992.
-
(1992)
Physica A
, vol.188
, pp. 404-425
-
-
Gillespie, D.T.1
-
18
-
-
0347370153
-
The Las-Vegas processor identity problem (How and when to be unique)
-
November
-
Shay Kutten, Rafail Ostrovsky, and Boaz Patt-Shamir. The Las-Vegas processor identity problem (How and when to be unique). Journal of Algorithms, 37(2): 468-494, November 2000.
-
(2000)
Journal of Algorithms
, vol.37
, Issue.2
, pp. 468-494
-
-
Kutten, S.1
Ostrovsky, R.2
Patt-Shamir, B.3
-
19
-
-
0025504852
-
The processor identity problem
-
October
-
Richard J. Lipton and Arvin Park. The processor identity problem. Information Processing Letters, 36(2):91-94, October 1990.
-
(1990)
Information Processing Letters
, vol.36
, Issue.2
, pp. 91-94
-
-
Lipton, R.J.1
Park, A.2
-
20
-
-
0032131482
-
Randomized naming using wait-free shared variables
-
August
-
Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, and Paul Vitányi. Randomized naming using wait-free shared variables. Distributed Computing, 11(3):113-124, August 1998.
-
(1998)
Distributed Computing
, vol.11
, Issue.3
, pp. 113-124
-
-
Panconesi, A.1
Papatriantafilou, M.2
Tsigas, P.3
Vitányi, P.4
-
21
-
-
0002217486
-
Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer ZahlenWelchem Die Addition Als Einzige Operation Hervortritt
-
Warszawa
-
Mojzesz Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes-Rendus du I Congrès de Mathématiciens des Pays Slaves, pages 92-101, Warszawa, 1929.
-
(1929)
Comptes-Rendus du i Congrès de Mathématiciens des Pays Slaves
, pp. 92-101
-
-
Presburger, M.1
-
22
-
-
0032656215
-
Comparison of initial conditions for distributed algorithms on anonymous networks
-
Naoshi Sakamoto. Comparison of initial conditions for distributed algorithms on anonymous networks. In Proc. 18th ACM Symposium on Principles of Distributed Computing, pages 173-179, 1999.
-
(1999)
Proc. 18th ACM Symposium on Principles of Distributed Computing
, pp. 173-179
-
-
Sakamoto, N.1
-
23
-
-
0025703663
-
Space efficient Processor Identity protocol
-
DOI 10.1016/0020-0190(90)90094-E
-
Shang-Hua Teng. Space efficient processor identity protocol. Information Processing Letters, 34(3):147-154, April 1990. (Pubitemid 20685899)
-
(1990)
Information Processing Letters
, vol.34
, Issue.3
, pp. 147-154
-
-
Teng, S.-H.1
|