default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17. SIROCCO 2010: Sirince, Turkey
- Boaz Patt-Shamir, Tínaz Ekim:
Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings. Lecture Notes in Computer Science 6058, Springer 2010, ISBN 978-3-642-13283-4 - Eyal Kushilevitz:
Communication Complexity: From Two-Party to Multiparty. 1 - Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
On the Impact of Local Taxes in a Set Cover Game. 2-13 - Petr Kuznetsov, Stefan Schmid
:
Towards Network Games with Social Preferences. 14-28 - Nir Amira, Ran Giladi, Zvi Lotker:
Distributed Weighted Stable Marriage Problem. 29-40 - Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming in Star Networks via Matching Techniques. 41-56 - Marcin Bienkowski, Leszek Gasieniec, Marek Klonowski, Miroslaw Korzeniowski, Stefan Schmid:
Event Extent Estimation. 57-71 - Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous Deterministic Rendezvous in Bounded Terrains. 72-85 - Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees. 86-100 - Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita:
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. 101-113 - Ivan Rapaport, Eric Rémila:
Average Long-Lived Memoryless Consensus: The Three-Value Case. 114-126 - Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Mikel Larrea:
Algorithms for Extracting Timeliness Graphs. 127-141 - Emanuele G. Fusco, Andrzej Pelc:
Distributed Tree Comparison with Nodes of Limited Memory. 142-156 - Rastislav Královic, Stanislav Miklík:
Periodic Data Retrieval Problem in Rings Containing a Malicious Host. 157-167 - Bastian Degener, Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide:
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. 168-182 - Anissa Lamani, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots. 183-196 - Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Ladislav Stacho:
Maximum Interference of Random Sensors on a Line. 197-210 - Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Multipath Spanners. 211-223 - Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho:
Strong Orientations of Planar Graphs with Bounded Stretch Factor. 224-236 - Michael J. Dinneen, Masoud Khosravani:
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs. 237-246 - Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast Algorithms for min independent dominating set. 247-261
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-09-26 01:01 CEST 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:
