Result 1 to 20 of 294 total
Searching for black holes in subways. (English)
Theory Comput. Syst. 50, No. 1, 158-184 (2012).
1
Distributed computing by mobile robots: gathering. (English)
SIAM J. Comput. 41, No. 4, 829-879 (2012).
2
Connected graph searching. (English)
Inf. Comput. 219, 1-16 (2012).
3
Asynchronous exploration of an unknown anonymous dangerous graph with $O(1)$ pebbles. (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, 279-290 (2012).
4
Finding good coffee in Paris. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 154-165 (2012).
5
Ping pong in dangerous graphs: optimal black hole search with pebbles. (English)
Algorithmica 62, No. 3-4, 1006-1033 (2012).
6
Time optimal algorithms for black hole search in rings. (English)
Discrete Math. Algorithms Appl. 3, No. 4, 457-471 (2011).
7
Computing in time-varying networks. (English)
Défago, Xavier (ed.) et al., Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10‒12, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24549-7/pbk). Lecture Notes in Computer Science 6976, 4 (2011).
8
Time-varying graphs and dynamic networks. (English)
Frey, Hannes (ed.) et al., Ad-hoc, mobile, and wireless networks. 10th international conference, ADHOC-NOW 2011, Paderborn, Germany, July 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22449-2/pbk). Lecture Notes in Computer Science 6811, 346-359 (2011).
9
A reference model for semantic peer-to-peer networks. (English)
Spaccapietra, Stefano (ed.), Journal on Data Semantics XV. Berlin: Springer (ISBN 978-3-642-22629-8/pbk). Lecture Notes in Computer Science 6720. Journal Subline, 37-65 (2011).
10
Improving the optimal bounds for black hole search in rings. (English)
Kosowski, Adrian (ed.) et al., Structural information and communication complexity. 18th international colloquium, SIROCCO 2011, Gdańsk, Poland, June 26‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22211-5/pbk). Lecture Notes in Computer Science 6796, 198-209 (2011).
11
Time-varying graphs and social network analysis: temporal indicators and metrics. (English)
Comput. Res. Repos. 2011, Article No. 1102.0629 (2011).
12
Uniform scattering of autonomous mobile robots in a grid. (English)
Int. J. Found. Comput. Sci. 22, No. 3, 679-697 (2011).
13
Computing by mobile robotic sensors. (English)
Nikoletseas, Sotiris (ed.) et al., Theoretical aspects of distributed computing in sensor networks. Berlin: Springer (ISBN 978-3-642-14848-4/hbk; 978-3-642-14849-1/ebook). Monographs in Theoretical Computer Science. An EATCS Series, 655-693 (2011).
14
A distributed algorithm for finding all best swap edges of a minimum-diameter spanning tree (English)
IEEE Trans. Dependable Sec. Comput. 8, No. 1, 1-12 (2011).
15
Efficient, decentralized computation of the topology of spatial regions (English)
IEEE Trans. Computers 60, No. 8, 1100-1113 (2011).
16
A reference model for semantic peer-to-peer networks (English)
J. Data Semantics 15, 37-65 (2011).
17
Strictly localized sensor self-deployment for optimal focused coverage (English)
IEEE Trans. Mob. Comput. 10, No. 11, 1520-1533 (2011).
18
On the temporal analysis of scientific network evolution (English)
CASoN, 169-174 (2011).
19
Measuring temporal lags in delay-tolerant networks (English)
IPDPS, 209-218 (2011).
20
Result 1 to 20 of 294 total
Start
Contact
Print
General Help
