default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. SIROCCO 1998: Amalfi, Italy
- Luisa Gargano, David Peleg:
SIROCCO'98, 5th International Colloquium on Structural Information & Communication Complexity, Amalfi, Italy, June 22-24, 1998. Carleton Scientific 1998 - Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
On permutation communications in all-optical rings. SIROCCO 1998: 1-9 - Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. SIROCCO 1998: 10-19 - Savio S. H. Tse, Francis C. M. Lau:
Adaptive broadcast-confirm algorithms in general networks and their analysis. SIROCCO 1998: 20-35 - Olivier Delmas:
Trade-off for broadcast protocols. SIROCCO 1998: 36-50 - Bertrand Ducourthial:
New operators for computing with associative nets. SIROCCO 1998: 51-65 - Amber Settle, Janos Simon:
Improved bounds for the firing synchronization problem. SIROCCO 1998: 66-81 - Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis:
Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems. SIROCCO 1998: 82-97 - Pierre Fraigniaud, Cyril Gavoille:
A Theoretical Model for Routing Complexity. SIROCCO 1998: 98-113 - Stefan Dobrev:
An Alternative View on Sense of Direction (Position paper). SIROCCO 1998: 114-128 - Esther Jennings, Svante Carlsson:
An optimal distributed 3-edge-connected component algorithm. SIROCCO 1998: 129-144 - Roger Wattenhofer, Peter Widmayer:
The counting pyramid: an adaptive distributed counting scheme. SIROCCO 1998: 145-157 - Satoshi Fujita:
Neighbourhood Information Dissemination in the Star Graph. SIROCCO 1998: 158-172 - Stefan Dobrev, Peter Ruzicka, Gerard Tel:
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. SIROCCO 1998: 173-187 - Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli:
Routing with the use of masks. SIROCCO 1998: 188-200 - Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. SIROCCO 1998: 201-213 - Pilar de la Torre, Lata Narayanan, David Peleg:
Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). SIROCCO 1998: 214-228 - Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain:
Self-stabilizing depth-first token circulation in arbitrary rooted networks. SIROCCO 1998: 229-243 - Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. SIROCCO 1998: 244-258 - Michal Soch, Pavel Tvrdík:
Time-optimal gossip in noncombining 3-D tori. SIROCCO 1998: 259-271
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
