-
1
-
-
84944076702
-
Local and global properties in networks of processors
-
Los Angeles, CA, USAApril 1980, New York: ACM
-
Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC), Los Angeles, CA, USA, April 1980, pp. 82-93. ACM, New York (1980).
-
(1980)
Proc. 12th Annual ACM Symposium on Theory of Computing (STOC)
, pp. 82-93
-
-
Angluin, D.1
-
2
-
-
76649142364
-
A local 2-approximation algorithm for the vertex cover problem
-
Elche, SpainSeptember 2009Lecture Notes in Computer Science, Berlin: Springer
-
Åstrand, M., Floréen, P., Polishchuk, V., Rybicki, J., Suomela, J., Uitto, J.: A local 2-approximation algorithm for the vertex cover problem. In: Proc. 23rd International Symposium on Distributed Computing (DISC), Elche, Spain, September 2009. Lecture Notes in Computer Science, vol. 5805, pp. 191-205. Springer, Berlin (2009).
-
(2009)
Proc. 23rd International Symposium on Distributed Computing (DISC)
, vol.5805
, pp. 191-205
-
-
Åstrand, M.1
Floréen, P.2
Polishchuk, V.3
Rybicki, J.4
Suomela, J.5
Uitto, J.6
-
3
-
-
77954929382
-
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
-
Santorini, GreeceJune 2010, New York: ACM
-
Åstrand, M., Suomela, J.: Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In: Proc. 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Santorini, Greece, June 2010, pp. 294-302. ACM, New York (2010).
-
(2010)
Proc. 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
, pp. 294-302
-
-
Åstrand, M.1
Suomela, J.2
-
4
-
-
0024138132
-
Dynamic networks are as fast as static networks
-
White Plains, NY, USAOctober 1988, Piscataway: IEEE
-
Awerbuch, B., Sipser, M.: Dynamic networks are as fast as static networks. In: Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS), White Plains, NY, USA, October 1988, pp. 206-219. IEEE, Piscataway (1988).
-
(1988)
Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS)
, pp. 206-219
-
-
Awerbuch, B.1
Sipser, M.2
-
5
-
-
0026404904
-
Distributed program checking: a paradigm for building self-stabilizing distributed protocols
-
San Juan, Puerto RicoOctober 1988, Piscataway: IEEE
-
Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: Proc. 32nd Annual Symposium on Foundations of Computer Science (FOCS), San Juan, Puerto Rico, October 1988, pp. 258-267. IEEE, Piscataway (1991).
-
(1991)
Proc. 32nd Annual Symposium on Foundations of Computer Science (FOCS)
, pp. 258-267
-
-
Awerbuch, B.1
Varghese, G.2
-
6
-
-
0028255806
-
Approximation algorithms for NP-complete problems on planar graphs
-
Baker, B. S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153-180 (1994).
-
(1994)
J. ACM
, vol.41
, Issue.1
, pp. 153-180
-
-
Baker, B.S.1
-
7
-
-
56449104037
-
Fast distributed approximations in planar graphs
-
Arcachon, FranceSeptember 2008Lecture Notes in Computer Science, Berlin: Springer
-
Czygrinow, A., Hańćkowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: Proc. 22nd International Symposium on Distributed Computing (DISC), Arcachon, France, September 2008. Lecture Notes in Computer Science, vol. 5218, pp. 78-92. Springer, Berlin (2008).
-
(2008)
Proc. 22nd International Symposium on Distributed Computing (DISC)
, vol.5218
, pp. 78-92
-
-
Czygrinow, A.1
Hańćkowiak, M.2
Wawrzyniak, W.3
-
8
-
-
58849146608
-
Tight local approximation results for max-min linear programs
-
Reykjavík, IcelandJuly 2008Lecture Notes in Computer Science, Berlin: Springer
-
Floréen, P., Hassinen, M., Kaski, P., Suomela, J.: Tight local approximation results for max-min linear programs. In: Proc. 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors), Reykjavík, Iceland, July 2008. Lecture Notes in Computer Science, vol. 5389, pp. 2-17. Springer, Berlin (2008).
-
(2008)
Proc. 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors)
, vol.5389
, pp. 2-17
-
-
Floréen, P.1
Hassinen, M.2
Kaski, P.3
Suomela, J.4
-
9
-
-
70449640348
-
An optimal local approximation algorithm for max-min linear programs
-
Calgary, CanadaAugust 2009, New York: ACM
-
Floréen, P., Kaasinen, J., Kaski, P., Suomela, J.: An optimal local approximation algorithm for max-min linear programs. In: Proc. 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Calgary, Canada, August 2009, pp. 260-269. ACM, New York (2009).
-
(2009)
Proc. 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
, pp. 260-269
-
-
Floréen, P.1
Kaasinen, J.2
Kaski, P.3
Suomela, J.4
-
10
-
-
51049116218
-
Approximating max-min linear programs with local algorithms
-
Miami, FL, USAApril 2008, Piscataway: IEEE
-
Floréen, P., Kaski, P., Musto, T., Suomela, J.: Approximating max-min linear programs with local algorithms. In: Proc. 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Miami, FL, USA, April 2008. IEEE, Piscataway (2008).
-
(2008)
Proc. 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS)
-
-
Floréen, P.1
Kaski, P.2
Musto, T.3
Suomela, J.4
-
11
-
-
77953609217
-
Almost stable matchings by truncating the Gale-Shapley algorithm
-
Floréen, P., Kaski, P., Polishchuk, V., Suomela, J.: Almost stable matchings by truncating the Gale-Shapley algorithm. Algorithmica 58(1), 102-118 (2010).
-
(2010)
Algorithmica
, vol.58
, Issue.1
, pp. 102-118
-
-
Floréen, P.1
Kaski, P.2
Polishchuk, V.3
Suomela, J.4
-
12
-
-
0032279794
-
On the distributed complexity of computing maximal matchings
-
San Francisco, CA, USAJanuary 1998, Philadelphia: Society for Industrial and Applied Mathematics
-
Hańćkowiak, M., Karoński, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, USA, January 1998, pp. 219-225. Society for Industrial and Applied Mathematics, Philadelphia (1998).
-
(1998)
Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
, pp. 219-225
-
-
Hańćkowiak, M.1
Karoński, M.2
Panconesi, A.3
-
13
-
-
0021897852
-
Approximation schemes for covering and packing problems in image processing and VLSI
-
Hochbaum, D. S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130-136 (1985).
-
(1985)
J. ACM
, vol.32
, Issue.1
, pp. 130-136
-
-
Hochbaum, D.S.1
Maass, W.2
-
14
-
-
33748999691
-
-
PhD thesis, Hebrew University, Jerusalem (March)
-
Hoory, S.: On graphs of high girth. PhD thesis, Hebrew University, Jerusalem (March 2002).
-
(2002)
On graphs of high girth
-
-
Hoory, S.1
-
16
-
-
33947699899
-
Fault-tolerant clustering in ad hoc and sensor networks
-
Lisboa, PortugalJuly 2006, Los Alamitos: IEEE Computer Society Press
-
Kuhn, F., Moscibroda, T., Wattenhofer, R.: Fault-tolerant clustering in ad hoc and sensor networks. In: Proc. 26th IEEE International Conference on Distributed Computing Systems (ICDCS), Lisboa, Portugal, July 2006. IEEE Computer Society Press, Los Alamitos (2006).
-
(2006)
Proc. 26th IEEE International Conference on Distributed Computing Systems (ICDCS)
-
-
Kuhn, F.1
Moscibroda, T.2
Wattenhofer, R.3
-
17
-
-
33244479021
-
The price of being near-sighted
-
Miami, FL, USAJanuary 2006, New York: ACM
-
Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Miami, FL, USA, January 2006, pp. 980-989. ACM, New York (2006).
-
(2006)
Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
, pp. 980-989
-
-
Kuhn, F.1
Moscibroda, T.2
Wattenhofer, R.3
-
18
-
-
56449105939
-
What can be approximated locally
-
Munich, GermanyJune 2008, New York: ACM
-
Lenzen, C., Oswald, Y. A., Wattenhofer, R.: What can be approximated locally? In: Proc. 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Munich, Germany, June 2008, pp. 46-54. ACM, New York (2008).
-
(2008)
Proc. 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
, pp. 46-54
-
-
Lenzen, C.1
Oswald, Y.A.2
Wattenhofer, R.3
-
19
-
-
70549084964
-
Local algorithms: self-stabilization on speed
-
Lyon, FranceNovember 2009Lecture Notes in Computer Science, Berlin: Springer
-
Lenzen, C., Suomela, J., Wattenhofer, R.: Local algorithms: self-stabilization on speed. In: Proc. 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Lyon, France, November 2009. Lecture Notes in Computer Science, vol. 5873, pp. 17-34. Springer, Berlin (2009).
-
(2009)
Proc. 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
, vol.5873
, pp. 17-34
-
-
Lenzen, C.1
Suomela, J.2
Wattenhofer, R.3
-
20
-
-
56449100279
-
Leveraging Linial's locality limit
-
Arcachon, FranceSeptember 2008Lecture Notes in Computer Science, Berlin: Springer
-
Lenzen, C., Wattenhofer, R.: Leveraging Linial's locality limit. In: Proc. 22nd International Symposium on Distributed Computing (DISC), Arcachon, France, September 2008. Lecture Notes in Computer Science, vol. 5218, pp. 394-407. Springer, Berlin (2008).
-
(2008)
Proc. 22nd International Symposium on Distributed Computing (DISC)
, vol.5218
, pp. 394-407
-
-
Lenzen, C.1
Wattenhofer, R.2
-
21
-
-
0026821081
-
Locality in distributed graph algorithms
-
Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193-201 (1992).
-
(1992)
SIAM J. Comput.
, vol.21
, Issue.1
, pp. 193-201
-
-
Linial, N.1
-
22
-
-
85010625614
-
Local computations on static and dynamic graphs
-
Tel Aviv, IsraelJanuary 1995, Piscataway: IEEE
-
Mayer, A., Naor, M., Stockmeyer, L.: Local computations on static and dynamic graphs. In: Proc. 3rd Israel Symposium on the Theory of Computing and Systems (ISTCS), Tel Aviv, Israel, January 1995, pp. 268-278. IEEE, Piscataway (1995).
-
(1995)
Proc. 3rd Israel Symposium on the Theory of Computing and Systems (ISTCS)
, pp. 268-278
-
-
Mayer, A.1
Naor, M.2
Stockmeyer, L.3
-
24
-
-
0011716017
-
What can be computed locally
-
Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24(6), 1259-1277 (1995).
-
(1995)
SIAM J. Comput.
, vol.24
, Issue.6
, pp. 1259-1277
-
-
Naor, M.1
Stockmeyer, L.2
-
25
-
-
0027308414
-
Linear programming without the matrix
-
San Diego, CA, USAMay 1993, New York: ACM
-
Papadimitriou, C. H., Yannakakis, M.: Linear programming without the matrix. In: Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, USA, May 1993, pp. 121-129. ACM, New York (1993).
-
(1993)
Proc. 25th Annual ACM Symposium on Theory of Computing (STOC)
, pp. 121-129
-
-
Papadimitriou, C.H.1
Yannakakis, M.2
-
26
-
-
62749093650
-
A simple local 3-approximation algorithm for vertex cover
-
Polishchuk, V., Suomela, J.: A simple local 3-approximation algorithm for vertex cover. Inf. Process. Lett. 109(12), 642-645 (2009).
-
(2009)
Inf. Process. Lett.
, vol.109
, Issue.12
, pp. 642-645
-
-
Polishchuk, V.1
Suomela, J.2
-
27
-
-
70449660973
-
-
PhD thesis, University of Helsinki, Department of Computer Science, Helsinki, Finland (May)
-
Suomela, J.: Optimisation problems in wireless sensor networks: local algorithms and local graphs. PhD thesis, University of Helsinki, Department of Computer Science, Helsinki, Finland (May 2009).
-
(2009)
Optimisation problems in wireless sensor networks: Local algorithms and local graphs
-
-
Suomela, J.1
-
28
-
-
70350685246
-
-
Manuscript submitted for publication
-
Suomela, J.: Survey of local algorithms. http://www. iki. fi/jukka. suomela/local-survey (2009). Manuscript submitted for publication.
-
(2009)
Survey of local algorithms
-
-
Suomela, J.1
-
29
-
-
0035181264
-
Sequential and parallel algorithms for mixed packing and covering
-
Las Vegas, NV, USAOctober 2001, Los Alamitos: IEEE Computer Society Press
-
Young, N. E.: Sequential and parallel algorithms for mixed packing and covering. In: Proc. 42nd Annual Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, USA, October 2001, pp. 538-546. IEEE Computer Society Press, Los Alamitos (2001).
-
(2001)
Proc. 42nd Annual Symposium on Foundations of Computer Science (FOCS)
, pp. 538-546
-
-
Young, N.E.1
|