Miguel A. Mosteiro

	2012
29		Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. LATIN 2012: 303-314
28		Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves: Deterministic recurrent communication in restricted Sensor Networks. Theor. Comput. Sci. 418: 37-47 (2012)
	2011
27		Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro: Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. CCCG 2011
26		Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro: Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication. DISC 2011: 147-149
25		Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks: Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. DISC 2011: 202-204
24		Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz: Unbounded Contention Resolution in Multiple-Access Channels. DISC 2011: 225-236
23		Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro: Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication. NCA 2011: 275-280
22		Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro: Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. OPODIS 2011: 513-527
21		Miguel A. Mosteiro, Antonio Fernández Anta, Jorge Ramón Muñoz: Unbounded contention resolution in multiple-access channels. PODC 2011: 211-212
20		Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks: Opportunistic Information CoRR abs/1105.6151: (2011)
19		Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro: Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions CoRR abs/1106.4927: (2011)
18		Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz: Unbounded Contention Resolution in Multiple-Access Channels CoRR abs/1107.0234: (2011)
17		Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro: Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution CoRR abs/1109.4373: (2011)
16		Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves: Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. Discrete Mathematics & Theoretical Computer Science 13(1): 95-112 (2011)
	2010
15		Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves: Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. ALGOSENSORS 2010: 62-73
14		Antonio Fernández Anta, Miguel A. Mosteiro: Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. COCOON 2010: 378-388
13		Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks: Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. DISC 2010: 374-388
12		Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro: Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers. IPDPS 2010: 1-11
	2009
11		Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. PRDC 2009: 357-364
10		Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro: Bootstrapping a hop-optimal network in the weak sensor model. ACM Transactions on Algorithms 5(4): (2009)
	2008
9		Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves: Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. DISC 2008: 504-506
8		Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro: Designing Mechanisms for Reliable Internet-based Computing. NCA 2008: 315-324
	2007
7		Martin Farach-Colton, Miguel A. Mosteiro: Sensor Network Gossiping or How to Break the Broadcast Lower Bound. ISAAC 2007: 232-243
6		Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves: Deterministic Communication in the Weak Sensor Model. OPODIS 2007: 119-131
5		Martin Farach-Colton, Miguel A. Mosteiro: Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. WADS 2007: 565-576
	2006
4		Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro: Lower Bounds for Clear Transmissions in Radio Networks. LATIN 2006: 447-454
3		Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro: Insertion Sort is O(n log n). Theory Comput. Syst. 39(3): 391-397 (2006)
	2005
2		Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro: Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. ESA 2005: 827-838
	2004
1		Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro: Insertion Sort is O(n log n) CoRR cs.DS/0407003: (2004)

Coauthor Index

1	Paulo Sérgio Almeida	[17] [22]
2	Esther M. Arkin	[19] [27]
3	Carlos Baquero	[17] [22]
4	Michael A. Bender	[1] [3]
5	Evgenia Christoforou	[23] [26]
6	Martin Farach-Colton (Martin Farach)	[1] [2] [3] [4] [5] [7] [10] [17] [20] [22] [25] [29]
7	Rohan J. Fernandes	[2] [4] [10]
8	Antonio Fernández (Antonio Fernández Anta)	[6] [8] [9] [11] [12] [13] [14] [15] [16] [18] [19] [20] [21] [23] [24] [25] [26] [27] [28] [29]
9	Chryssis Georgiou	[8] [12] [23] [26]
10	Paulo Jesus	[17] [22]
11	Alessia Milani	[13] [20] [25] [29]
12	Joseph S. B. Mitchell	[19] [27]
13	Jorge Ramón Muñoz	[18] [21] [24]
14	Christopher Thraves	[6] [9] [11] [15] [16] [28]
15	Shmuel Zaks	[13] [20] [25] [29]

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page