Search results for "SIROCCO"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Leszek Gasieniec, Igor Potapov, Qin Xin 0001	Time Efficient Gossiping in Known Radio Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Deshi Ye, Hu Zhang 0004	The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Rastislav Kralovic, Ondrej Sýkora (eds.)	Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slovakia, June 21-23, 2004, Proceedings	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Luciano Margara, Alessandro Pistocchi, Marco Vassura	Perfect Token Distribution on Trees.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Alessandro Ferrante, Mimmo Parente	Existence of Nash Equilibria in Selfish Routing Problems.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Reuven Cohen, David Peleg	Robot Convergence via Center-of-Gravity Algorithms.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Flaminia L. Luccio, Jop F. Sibeyn	Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Michel Paquette, Andrzej Pelc	Optimal Decision Strategies in Byzantine Environments.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Stefan Dobrev, Paola Flocchini, Nicola Santoro	Improved Bounds for Optimal Black Hole Search with a Network Map.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Guillaume Fertin, André Raspaud, Ondrej Sýkora	No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Bogdan S. Chlebus, Mariusz A. Rokicki	Asynchronous Broadcast in Radio Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Rui Wang 0009, Francis C. M. Lau 0001, Yan Yan Liu	NP-Completeness Results for All-Shortest-Path Interval Routing.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano	F-Chord: Improved Uniform Routing on Chord: (Extended Abstract).	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Yon Dourisboure, Cyril Gavoille	Sparse Additive Spanners for Bounded Tree-Length Graphs.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Paul Boone, Edgar Chávez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar, Jorge Urrutia	Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Eric Angel, Evripidis Bampis, Fanny Pascual	Traffic Grooming in a Passive Star WDM Network.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Vittorio Bilò, Luca Moscardelli	The Price of Anarchy in All-Optical Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman	Long-Lived Rambo: Trading Knowledge for Communication.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio, Nicola Santoro, Cindy Sawchuk	Mobile Agents Rendezvous When Tokens Fail.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Rachel Matichin, David Peleg	Approximation Algorithm for Hotlink Assignment in the Greedy Model.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Anat Bremler-Barr, Leah Epstein	Path Layout on Tree Networks: Bounds in Different Label Switching Models.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Deshi Ye, Guochuan Zhang	On-Line Scheduling of Parallel Jobs.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Aleksej Di Salvo, Guido Proietti	Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Arvind Gupta, Ján Manuch, Ladislav Stacho	Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Miroslav Chlebík, Janka Chlebíková	On Approximability of the Independent Set Problem for Low Degree Graphs.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Sébastien Choplin, Lata Narayanan, Jaroslav Opatrny	Two-Hop Virtual Path Layout in Tori.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Francesc Comellas, Margarida Mitjana	Communication Properties of Cycle Prefix Digraphs.	SIROCCO	2003	DBLP BibTeX RDF
1	Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro	Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.	SIROCCO	2003	DBLP BibTeX RDF
1	Christian Destré, Christian Laforest, Sandrine Vial	The Broadcast Assignment Problem.	SIROCCO	2003	DBLP BibTeX RDF
1	Cyril Gavoille, Martin Nehéz	Interval Routing in Reliability Networks.	SIROCCO	2003	DBLP BibTeX RDF
1	Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro	Polynomial-Time Computable Backup Tables for Shortest-Path Routing.	SIROCCO	2003	DBLP BibTeX RDF
1	Flaminia L. Luccio	Minimum Feedback Vertex Set in Pyramid and Mesh of Trees Networks.	SIROCCO	2003	DBLP BibTeX RDF
1	Matthieu Roy, Achour Mostéfaoui	Single-Write Safe Consensus using Constrained Inputs.	SIROCCO	2003	DBLP BibTeX RDF
1	Ricardo Marcelín-Jiménez	Distributed site partitioning.	SIROCCO	2003	DBLP BibTeX RDF
1	Evangelos Kranakis, Danny Krizanc, Sunil M. Shende	Tracking Users in Cellular Networks using Timing Information.	SIROCCO	2003	DBLP BibTeX RDF
1	Michele Flammini, Alfredo Navarra, Andrzej Proskurowski	On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles.	SIROCCO	2003	DBLP BibTeX RDF
1	Costas Busch, Marios Mavronicolas, Paul G. Spirakis	The Cost of Concurrent, Low-Contention Read-Modify-Write.	SIROCCO	2003	DBLP BibTeX RDF
1	Andre Osterloh	Optimal Oblivious Routing On D-Dimensional Meshes.	SIROCCO	2003	DBLP BibTeX RDF
1	Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis	Instability of Networks with Quasi-Static Link Capacities.	SIROCCO	2003	DBLP BibTeX RDF
1	Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari	A uniform randomized election in trees.	SIROCCO	2003	DBLP BibTeX RDF
1	Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri	Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.	SIROCCO	2003	DBLP BibTeX RDF
1	Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang	Bounds for Frequency Estimation of Packet Streams.	SIROCCO	2003	DBLP BibTeX RDF
1	Jop F. Sibeyn (eds.)	SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden	SIROCCO	2003	DBLP BibTeX RDF
1	Dariusz R. Kowalski, Andrzej Pelc	Time of Radio Broadcasting.	SIROCCO	2003	DBLP BibTeX RDF
1	Rastislav Kralovic, Richard Královic, Peter Ruzicka	Broadcasting with Many Faulty Links.	SIROCCO	2003	DBLP BibTeX RDF
1	Antonio Fernández 0001, Chryssis Georgiou	The Do-All Problem with Byzantine Processor Failures.	SIROCCO	2003	DBLP BibTeX RDF
1	Francesc Comellas, Guillaume Fertin, André Raspaud	Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs.	SIROCCO	2003	DBLP BibTeX RDF
1	Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano	Approximate Multicommodity Flow for WDM Networks Design.	SIROCCO	2003	DBLP BibTeX RDF
1	Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin	Asymmetric Communication Protocols via Hotlink Assignments.	SIROCCO	2002	DBLP BibTeX RDF
1	Nikolaos Glinos, Doan B. Hoang, Chi Nguyen, Antonios Symvonis	Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol.	SIROCCO	2002	DBLP BibTeX RDF
1	Francesc Comellas, Margarida Mitjana, Joseph G. Peters	Broadcasting in Small-world Communication Networks.	SIROCCO	2002	DBLP BibTeX RDF
1	Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis	Approximate Equilibria and Ball Fusion.	SIROCCO	2002	DBLP BibTeX RDF
1	Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro	Avoiding Routing Loops on the Internet.	SIROCCO	2002	DBLP BibTeX RDF
1	Fabrizio Luccio, Linda Pagli	Two New Applications of Dynamos.	SIROCCO	2002	DBLP BibTeX RDF
1	Frédéric Havet	Design of Fault Tolerant Satellite Networks with Priorities via Selectors.	SIROCCO	2002	DBLP BibTeX RDF
1	André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon	New Bounds for the Firing Squad Problem on a Ring.	SIROCCO	2002	DBLP BibTeX RDF
1	Carole Delporte-Gallet, Hugues Fauconnier	Latency Measures and Lower Bounds for Consensus with Failure Detectors.	SIROCCO	2002	DBLP BibTeX RDF
1	Joachim Giesen, Roger Wattenhofer, Aaron Zollinger	Towards a Theory of Peer-to-Peer Computability.	SIROCCO	2002	DBLP BibTeX RDF
1	Rastislav Kralovic, Peter Ruzicka	Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks.	SIROCCO	2002	DBLP BibTeX RDF
1	Savio S. H. Tse, Francis C. M. Lau 0001	An Upper Bound Result for Multi-label Interval Routing on Planar Graphs.	SIROCCO	2002	DBLP BibTeX RDF
1	John Tromp, Paul M. B. Vitányi	A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification.	SIROCCO	2002	DBLP BibTeX RDF
1	Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes	Hierarchical Ring Network Design.	SIROCCO	2002	DBLP BibTeX RDF
1	Michael E. Houle, Antonios Symvonis, David R. Wood	Dimension-Exchange Algorithms for Load Balancing on Trees.	SIROCCO	2002	DBLP BibTeX RDF
1	Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski	Finding Spanning Forests by Broadcasting.	SIROCCO	2002	DBLP BibTeX RDF
1	Christos Kaklamanis, Lefteris M. Kirousis (eds.)	SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002	SIROCCO	2002	DBLP BibTeX RDF
1	Emmanuel Godard, Yves Métivier	Equivalence of Structural Knowledges in Distributed Algorithms.	SIROCCO	2002	DBLP BibTeX RDF
1	Stefan Dobrev	Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults.	SIROCCO	2002	DBLP BibTeX RDF
1	Aubin Jarry, Stephane Perennes	Disjoint Paths in Symmetric Digraphs.	SIROCCO	2002	DBLP BibTeX RDF
1	Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer	Distributed Highly Available Search Trees.	SIROCCO	2002	DBLP BibTeX RDF
1	Mark Cieliebak, Giuseppe Prencipe	Gathering Autonomous Mobile Robots.	SIROCCO	2002	DBLP BibTeX RDF
1	Yashar Ganjali	Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes.	SIROCCO	2001	DBLP BibTeX RDF
1	Norbert Zeh, Nicola Santoro	On Finding Minimum Deadly Sets for Directed Networks.	SIROCCO	2001	DBLP BibTeX RDF
1	Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit, Vincent Villain	Group Mutual Exclusion in Token Rings.	SIROCCO	2001	DBLP BibTeX RDF
1	John Watkinson, Micah Adler, Faith E. Fich	New Protocols for Asymmetric Communication Channels.	SIROCCO	2001	DBLP BibTeX RDF
1	Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman	Optimal Scheduling for Distributed Cooperation Without Communication.	SIROCCO	2001	DBLP BibTeX RDF
1	Stefan D. Bruda, Selim G. Akl	Parallel Real-Time Complexity A Strong Infinite Hierarchy.	SIROCCO	2001	DBLP BibTeX RDF
1	Alexander Kesselman, Yishay Mansour	QoS-Competitive Video Buffering.	SIROCCO	2001	DBLP BibTeX RDF
1	Michael Elkin, David Peleg	The Client-Server 2-Spanner Problem with Applications to Network Design.	SIROCCO	2001	DBLP BibTeX RDF
1	Francesc Comellas, Josep Fàbrega, Pierre Fraigniaud (eds.)	SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001	SIROCCO	2001	DBLP BibTeX RDF
1	Lali Barrière, Stefan Dobrev	Leader Election in Abelian Cayley Graphs.	SIROCCO	2001	DBLP BibTeX RDF
1	Martin Makuch, Peter Ruzicka	On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks.	SIROCCO	2001	DBLP BibTeX RDF
1	Petr Salinger, Pavel Tvrdík	Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing.	SIROCCO	2001	DBLP BibTeX RDF
1	Andre Osterloh	Oblivious Routing on d-Dimensional Meshes.	SIROCCO	2001	DBLP BibTeX RDF
1	Rastislav Kralovic, Peter Ruzicka	On Immunity and Catastrophic Indices of Graphs.	SIROCCO	2001	DBLP BibTeX RDF
1	Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy	Efficient Condition-Based Consensus.	SIROCCO	2001	DBLP BibTeX RDF
1	Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer	Pattern Formation by Anonymous Robots Without Chirality.	SIROCCO	2001	DBLP BibTeX RDF
1	Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot	Cycle Covering.	SIROCCO	2001	DBLP BibTeX RDF
1	Paul R. Hafner	On the graphs of McKay-Miller-Sirán.	SIROCCO	2001	DBLP BibTeX RDF
1	Guillaume Fertin, André Raspaud	k-Neighborhood Broadcasting.	SIROCCO	2001	DBLP BibTeX RDF
1	Emmanuel Godard, Yves Métivier	A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge.	SIROCCO	2001	DBLP BibTeX RDF
1	Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos	New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies.	SIROCCO	2001	DBLP BibTeX RDF
1	Toshio Nakata, Masafumi Yamashita	Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game.	SIROCCO	2001	DBLP BibTeX RDF
1	Prosenjit Bose, Pat Morin	Competitive Online Routing in Geometric Graphs.	SIROCCO	2001	DBLP BibTeX RDF
1	Victor Chepoi, Alexis Rollin	Interval Routing in Some Planar Quadrangulations.	SIROCCO	2001	DBLP BibTeX RDF
1	Peter Damaschke	Worst-case bounds for blind broadcasting in small-degree networks.	SIROCCO	2001	DBLP BibTeX RDF
1	Peter Gvozdjak, Joseph G. Peters	Modelling Links in Inclined LEO Satellite Networks.	SIROCCO	2001	DBLP BibTeX RDF
1	Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum	Exact communication costs for consensus and leader in a tree.	SIROCCO	2000	DBLP BibTeX RDF
1	Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping	Optimal broadcast on parallel locality models.	SIROCCO	2000	DBLP BibTeX RDF
1	Chryssis Georgiou, Alexander A. Shvartsman	Cooperative computing with fragmentable and mergeable groups.	SIROCCO	2000	DBLP BibTeX RDF
1	Koji Nakano, Stephan Olariu	A randomized leader election protocol for ad-hoc networks.	SIROCCO	2000	DBLP BibTeX RDF

Publications at "SIROCCO"( http://dblp.L3S.de/Venues/SIROCCO )