|
Conferences in DBLP
- Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:1-16 [Conf]
- Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:17-32 [Conf]
- Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang
Bounds for Frequency Estimation of Packet Streams. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:33-42 [Conf]
- Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano
Approximate Multicommodity Flow for WDM Networks Design. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:43-56 [Conf]
- Costas Busch, Marios Mavronicolas, Paul G. Spirakis
The Cost of Concurrent, Low-Contention Read-Modify-Write. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:57-72 [Conf]
- Francesc Comellas, Guillaume Fertin, André Raspaud
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:73-87 [Conf]
- Francesc Comellas, Margarida Mitjana
Communication Properties of Cycle Prefix Digraphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:89-99 [Conf]
- Christian Destré, Christian Laforest, Sandrine Vial
The Broadcast Assignment Problem. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:101-116 [Conf]
- Antonio Fernández, Chryssis Georgiou
The Do-All Problem with Byzantine Processor Failures. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:117-132 [Conf]
- Michele Flammini, Alfredo Navarra, Andrzej Proskurowski
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:133-145 [Conf]
- Cyril Gavoille, Martin Nehéz
Interval Routing in Reliability Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:147-162 [Conf]
- Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
Polynomial-Time Computable Backup Tables for Shortest-Path Routing. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:163-177 [Conf]
- Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
Instability of Networks with Quasi-Static Link Capacities. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:179-194 [Conf]
- Dariusz R. Kowalski, Andrzej Pelc
Time of Radio Broadcasting. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:195-210 [Conf]
- Rastislav Kralovic, Richard Královic, Peter Ruzicka
Broadcasting with Many Faulty Links. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:211-222 [Conf]
- Evangelos Kranakis, Danny Krizanc, Sunil M. Shende
Tracking Users in Cellular Networks using Timing Information. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:223-234 [Conf]
- Flaminia L. Luccio
Minimum Feedback Vertex Set in Pyramid and Mesh of Trees Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:235-247 [Conf]
- Ricardo Marcelín-Jiménez
Distributed site partitioning. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:249-257 [Conf]
- Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
A uniform randomized election in trees. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:259-274 [Conf]
- Andre Osterloh
Optimal Oblivious Routing On D-Dimensional Meshes. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:275-290 [Conf]
- Matthieu Roy, Achour Mostéfaoui
Single-Write Safe Consensus using Constrained Inputs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:291-306 [Conf]
|