Pierre Fraigniaud

Maël Luce

Ioan Todinca

Theor. Comput. Sci., 2024

Parameterized complexity of broadcasting in graphs.

[BibT_eX]

[DOI]

Petr A. Golovach

Theor. Comput. Sci., 2024

Distributed Coloring in the SLEEPING Model.

[BibT_eX]

[DOI]

CoRR, 2024

Distributed Model Checking on Graphs of Bounded Treedepth.

[BibT_eX]

[DOI]

CoRR, 2024

Source-Oblivious Broadcast.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2024

Non-negotiating Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2024

Even-Cycle Detection in the Randomized and Quantum CONGEST Model.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Synchronous t-resilient consensus in arbitrary graphs.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Local certification of graphs with bounded genus.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

Distributed Certification for Classes of Dense Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Energy-Efficient Distributed Algorithms for Synchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2023

Distributed Partial Coloring via Gradual Rounding.

[BibT_eX]

[DOI]

Avinandan Das

Adi Rosén

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022

Present-biased optimization.

[BibT_eX]

[DOI]

Petr A. Golovach

Math. Soc. Sci., 2022

Error-sensitive proof-labeling schemes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2022

Decentralized Asynchronous Crash-resilient Runtime Verification.

[BibT_eX]

[DOI]

J. ACM, 2022

Fault Tolerant Coloring of the Asynchronous Cycle.

[BibT_eX]

[DOI]

Patrick Lambein-Monette

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle.

[BibT_eX]

[DOI]

Patrick Lambein-Monette

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2022 Principles of Distributed Computing Doctoral Dissertation Award.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Computing Power of Hybrid Models in Synchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

2021

Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

A hierarchy of local decision.

[BibT_eX]

[DOI]

Juho Hirvonen

Theor. Comput. Sci., 2021

A topological perspective on distributed network algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Redundancy in distributed proofs.

[BibT_eX]

[DOI]

Distributed Comput., 2021

On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models.

[BibT_eX]

[DOI]

Paul Bastide

CoRR, 2021

Compact Distributed Certification of Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

Brief Annoucement: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models.

[BibT_eX]

[DOI]

Paul Bastide

Proceedings of the 35th International Symposium on Distributed Computing, 2021

How Do Mobile Agents Benefit from Randomness?

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

The Topology of Randomized Symmetry-Breaking Distributed Computing.

[BibT_eX]

[DOI]

Ran Gelles

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2021 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Distributed Quantum Proofs for Replicated Data.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring.

[BibT_eX]

[DOI]

J. Appl. Comput. Topol., 2020

Perfect failure detection with very few bits.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Deciding and verifying network properties locally with few output bits.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Brief Announcement: Distributed Quantum Proofs for Replicated Data.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Distributed Testing of Distance-k Colorings.

[BibT_eX]

[DOI]

Alexandre Nolin

Proceedings of the Structural Information and Communication Complexity, 2020

Simple and Fast Distributed Computation of Betweenness Centrality.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

The Topology of Local Computing in Networks.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Distributed Detection of Cycles.

[BibT_eX]

[DOI]

Dennis Olivetti

ACM Trans. Parallel Comput., 2019

Parallel Bayesian Search with No Coordination.

[BibT_eX]

[DOI]

Yoav Rodeh

J. ACM, 2019

Randomized proof-labeling schemes.

[BibT_eX]

[DOI]

Boaz Patt-Shamir

Mor Perry

Distributed Comput., 2019

Noisy rumor spreading and plurality consensus.

[BibT_eX]

[DOI]

Emanuele Natale

Distributed Comput., 2019

Distributed Computing in the Asynchronous LOCAL model.

[BibT_eX]

[DOI]

Hugues Fauconnier

CoRR, 2019

Certification of Compact Low-Stretch Routing Schemes.

[BibT_eX]

[DOI]

Alkida Balliu

Comput. J., 2019

Trade-Offs in Distributed Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model.

[BibT_eX]

[DOI]

Hugues Fauconnier

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Synchronous t-Resilient Consensus in Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

On Distributed Merlin-Arthur Decision Protocols.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

2018

Node labels in local decision.

[BibT_eX]

[DOI]

Juho Hirvonen

Jukka Suomela

Theor. Comput. Sci., 2018

What can be verified locally?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

Preferential Attachment as a Unique Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Equilibria of Games in Networks for Local Tasks.

[BibT_eX]

[DOI]

Simon Collet

Paolo Penna

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

2017

Decidability classes for mobile agents computing.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2017

Distributed Subgraph Detection.

[BibT_eX]

[DOI]

CoRR, 2017

Three Notes on Distributed Property Testing.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

Locality in Distributed Graph Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Forewords: Special issue on Theory and Applications of Graph Searching Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Rumor spreading in random evolving graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets.

[BibT_eX]

[DOI]

J. ACM, 2016

Survey of Distributed Decision.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

On the complexity of the shortest-path broadcast problem.

[BibT_eX]

[DOI]

Chiara Pierucci

Andrea Pietracaprina

Geppino Pucci

Discret. Appl. Math., 2016

Local Distributed Algorithms for Selfish Agents.

[BibT_eX]

[DOI]

Simon Collet

Paolo Penna

CoRR, 2016

Local Distributed Verification.

[BibT_eX]

[DOI]

CoRR, 2016

Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems.

[BibT_eX]

[DOI]

Boaz Patt-Shamir

Dror Rawitz

Adi Rosén

Algorithmica, 2016

Distributed Testing of Excluded Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Parallel exhaustive search without coordination.

[BibT_eX]

[DOI]

Yoav Rodeh

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Asynchronous Coordination Under Preferences and Constraints.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Sparsifying Congested Cliques and Core-Periphery Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Brief Announcement: Asynchronous Coordination with Constraints and Preferences.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Challenges in Fault-Tolerant Distributed Runtime Verification.

[BibT_eX]

[DOI]

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

Local Conflict Coloring.

[BibT_eX]

[DOI]

Marc Heinrich

Adrian Kosowski

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Core-periphery clustering and collaboration networks.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

Noisy Information Spreading and Plurality Consensus.

[BibT_eX]

[DOI]

Emanuele Natale

CoRR, 2015

Randomized Local Network Computing.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014

The worst case behavior of randomized gossip protocols.

[BibT_eX]

[DOI]

Rémi de Joannis de Verclos

Theor. Comput. Sci., 2014

What can be computed without communications?

[BibT_eX]

[DOI]

Heger Arfaoui

SIGACT News, 2014

Flooding in dynamic graphs with arbitrary degree sequence.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2014

Randomized distributed decision.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Greedy routing in small-world networks with power-law degrees.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction.

[BibT_eX]

[DOI]

CoRR, 2014

Distributedly Testing Cycle-Freeness.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Automatically Adjusting Concurrency to the Level of Synchrony.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms.

[BibT_eX]

[DOI]

Boaz Patt-Shamir

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Runtime Verification - 5th International Conference, 2014

The Opinion Number of Set-Agreement.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

Delays Induce an Exponential Memory Gap for Rendezvous in Trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2013

Towards a complexity theory for local distributed computing.

[BibT_eX]

[DOI]

David Peleg

J. ACM, 2013

Locality and checkability in wait-free computing.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Special issue with selected papers from PODC 2011.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042).

[BibT_eX]

[DOI]

Benjamin Doerr

Robert Elsässer

Dagstuhl Reports, 2013

Local Decision and Verification with Bounded-Size Outputs.

[BibT_eX]

[DOI]

Heger Arfaoui

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

What can be decided locally without identifiers?

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Rumor Spreading in Random Evolving Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Foreword: Special Issue on Theory and Applications of Graph Searching Problems.

[BibT_eX]

[DOI]

Stephan Kreutzer

Theor. Comput. Sci., 2012

Connected graph searching.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Randomized Distributed Decision.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

The Worst Case Behavior of Randomized Gossip.

[BibT_eX]

[DOI]

Rémi de Joannis de Verclos

Proceedings of the Theory and Applications of Models of Computation, 2012

Notions of Connectivity in Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

Brief announcement: what can be computed without communication?

[BibT_eX]

[DOI]

Heger Arfaoui

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

On the Impact of Identifiers on Local Decision.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Computing with Large Populations Using Interactions.

[BibT_eX]

[DOI]

Olivier Bournez

Xavier Koegler

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Special Issue on "Theory and Applications of Graph Searching Problems".

[BibT_eX]

[DOI]

Stephan Kreutzer

Theor. Comput. Sci., 2011

Online computation with advice.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Parsimonious flooding in dynamic graphs.

[BibT_eX]

[DOI]

Distributed Comput., 2011

Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071).

[BibT_eX]

[DOI]

Stephan Kreutzer

Dagstuhl Reports, 2011

Local Distributed Decision.

[BibT_eX]

[DOI]

David Peleg

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Recovering the long-range links in augmented graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A Lower Bound for Network Navigability.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Local MST Computation with Short Advice.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Communication algorithms with advice.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

On the additive constant of the k-server Work Function Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

An optimal ancestry scheme and small universal posets.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

On the searchability of small-world networks with arbitrary underlying structure.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

On the bit communication complexity of randomized rumor spreading.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Compact Ancestry Labeling Schemes for XML Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Distributed computational complexities: are you volvo-addicted or nascar-obsessed?

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Degree hunter: on the impact of balancing node degrees in de Bruijn-based overlay networks.

[BibT_eX]

[DOI]

Hoang-Anh Phan

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Provenance for database transformations.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2010

"Tree-Farms" for Tree-Based Multicast Schemes in Peer-to-Peer Overlay Networks.

[BibT_eX]

[DOI]

Hoang-Anh Phan

Proceedings of IEEE International Conference on Communications, 2010

Informative Labeling Schemes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Universal augmentation schemes for network navigability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Distributed computing with advice: information sensitivity of graph coloring.

[BibT_eX]

[DOI]

Distributed Comput., 2009

An Optimal Labeling Scheme for Ancestry Queries

[BibT_eX]

[DOI]

CoRR, 2009

Compact Ancestry Labeling Schemes for Trees of Small Depth

[BibT_eX]

[DOI]

CoRR, 2009

Nondeterministic Graph Searching: From Pathwidth to Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2009

Labeling Schemes for Tree Representation.

[BibT_eX]

[DOI]

Algorithmica, 2009

On the Additive Constant of the k-Server Work Function Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

On randomized representations of graphs using short labels.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Sub-linear Universal Spatial Gossip Protocols.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

The effect of power-law degrees on the navigability of small worlds: [extended abstract].

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Forewords: Special issue on graph searching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Distributed chasing of network intruders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Label-guided graph exploration by a finite automaton.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Monotony properties of connected visible graph searching.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Tree exploration with advice.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Impact of memory size on graph exploration capability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Opportunistic spatial gossip over mobile social networks.

[BibT_eX]

[DOI]

Augustin Chaintreau

Proceedings of the first Workshop on Online Social Networks, 2008

Deterministic Rendezvous in Trees with Little Memory.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Polylogarithmic network navigability using compact metrics with small stretch.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Forget him and keep on moving.

[BibT_eX]

[DOI]

Augustin Chaintreau

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

The Inframetric Model for the Internet.

[BibT_eX]

[DOI]

Laurent Viennot

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Networks Become Navigable as Nodes Move and Forget.

[BibT_eX]

[DOI]

Augustin Chaintreau

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Rendezvous and Election of Mobile Agents: Impact of Sense of Direction.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Special Issue DISC 2005.

[BibT_eX]

[DOI]

Distributed Comput., 2007

Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

D2B: A de Bruijn based content-addressable network.

[BibT_eX]

[DOI]

Philippe Gauron

Theor. Comput. Sci., 2006

Collective tree exploration.

[BibT_eX]

[DOI]

Networks, 2006

Eclecticism shrinks even small worlds.

[BibT_eX]

[DOI]

Christophe Paul

Distributed Comput., 2006

Header-size lower bounds for end-to-end communication in memoryless networks.

[BibT_eX]

[DOI]

Comput. Networks, 2006

Deterministic Rendezvous in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2006

Brief Announcement: On Augmented Graph Navigability.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Oracle size: a new measure of difficulty for communication tasks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Tree Exploration with an Oracle.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Connected Treewidth and Connected Graph Searching.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Navigability of Small World Networks.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2006

Topic 12: Theory and Algorithms for Parallel Computation.

[BibT_eX]

[DOI]

Danny Krizanc

Michael Kaufmann

Christos D. Zaroliagis

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

The Reduced Automata Technique for Graph Exploration Space Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2006

2005

Graph exploration by a finite automaton.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Efficient trigger-broadcasting in heterogeneous clusters.

[BibT_eX]

[DOI]

Bernard Mans

Arnold L. Rosenberg

J. Parallel Distributed Comput., 2005

An algorithmic model for heterogeneous hyper-clusters: rationale and experience.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Space Lower Bounds for Graph Exploration via Reduced Automata.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System.

[BibT_eX]

[DOI]

Philippe Gauron

Matthieu Latapy

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

Greedy Routing in Tree-Decomposed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Tree exploration with little memory.

[BibT_eX]

[DOI]

J. Algorithms, 2004

A note on line broadcast in digraphs under the edge-disjoint paths mode.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Digraphs Exploration with Little Memory.

[BibT_eX]

[DOI]

J. Ignacio Alvarez-Hamelin

Proceedings of the STACS 2004, 2004

Reducing Packet-Loss by Taking Long-Range Dependences into Account.

[BibT_eX]

[DOI]

Proceedings of the NETWORKING 2004, 2004

2003

Robust position-based routing in wireless ad hoc networks with irregular transmission ranges.

[BibT_eX]

[DOI]

Wirel. Commun. Mob. Comput., 2003

Searching Is Not Jumping.

[BibT_eX]

[DOI]

Lali Barrière

Nicola Santoro

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Lower Bounds for Oblivious Single-Packet End-to-End Communication.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 17th International Conference, 2003

Can we elect if we cannot compare?

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Dynamic construction of Bluetooth scatternets of fixed degree and low diameter.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Brief announcement: an overview of the content-addressable network D2B.

[BibT_eX]

[DOI]

J. Ignacio Alvarez-Hamelin

Philippe Gauron

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

MλT: a multicast protocol with QoS support.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Computer Communications and Networks, 2003

Topic Introduction.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Deterministic Rendezvous in Graphs.

[BibT_eX]

[DOI]

Anders Dessmark

Proceedings of the Algorithms, 2003

2002

Oriented hypercubes.

[BibT_eX]

[DOI]

Jean-Claude König

Emmanuel Lazard

Networks, 2002

Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees.

[BibT_eX]

[DOI]

Margarida Mitjana

Theory Comput. Syst., 2002

Recognizing Knödel graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

A Space Lower Bound for Routing in Trees.

[BibT_eX]

[DOI]

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Capture of an intruder by mobile agents.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

2001

Unslotted deflection routing: a practical and efficient protocol for multihop optical networks.

[BibT_eX]

[DOI]

Thierry Chich

IEEE/ACM Trans. Netw., 2001

Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs.

[BibT_eX]

[DOI]

Joseph G. Peters

Networks, 2001

Assigning labels in an unknown anonymous network with a leader.

[BibT_eX]

[DOI]

Distributed Comput., 2001

Interval routing schemes allow broadcasting with linear message-complexity.

[BibT_eX]

[DOI]

Bernard Mans

Distributed Comput., 2001

Efficient Routing in Networks with Long Range Contacts.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 15th International Conference, 2001

HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors.

[BibT_eX]

[DOI]

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Routing in Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges.

[BibT_eX]

[DOI]

Lali Barrière

Lata Narayanan

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2000

Assigning labels in unknown anonymous networks (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Interval routing schemes allow broadcasting with linear message-complexity (extended abstract).

[BibT_eX]

[DOI]

Bernard Mans

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

On Recognizing Cayley Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

Comparison of Heuristics for One-to-All and All-to All Communications in Partial Meshes.

[BibT_eX]

[DOI]

Sandrine Vial

Parallel Process. Lett., 1999

Recognizing Bipartite Incident-Graphs of Circulant Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Scheduling Calls for Multicasting in Tree-Networks.

[BibT_eX]

[DOI]

Margarida Mitjana

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

A General Theory for Deadlock Avoidance in Wormhole-Routed Networks.

[BibT_eX]

[DOI]

Eric Fleury

IEEE Trans. Parallel Distributed Syst., 1998

Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1998

On XRAM and PRAM Models, and on Data-Movement-Intensive Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Strategies for Path-Based Multicasting in Wormhole-Routed Meshes.

[BibT_eX]

[DOI]

Eric Fleury

J. Parallel Distributed Comput., 1998

Hierarchical Broadcast Networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Interval Routing Schemes.

[BibT_eX]

[DOI]

Algorithmica, 1998

A Theoretical Model for Routing Complexity.

[BibT_eX]

Proceedings of the SIROCCO'98, 1998

Minimal contention-free matrices with application to multicasting.

[BibT_eX]

[DOI]

Margarida Mitjana

Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998

1997

Approximation Algorithms for Broadcasting and Gossiping.

[BibT_eX]

[DOI]

Sandrine Vial

J. Parallel Distributed Comput., 1997

Universal Routing Schemes.

[BibT_eX]

[DOI]

Distributed Comput., 1997

Approximation Algorithms for Structured Communication Problems.

[BibT_eX]

[DOI]

Dominique Barth

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks.

[BibT_eX]

Sandrine Vial

Proceedings of the SIROCCO'97, 1997

Broadcasting and Multicasting in Cut-through Routed Networks.

[BibT_eX]

[DOI]

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

An extended comparison of slotted and unslotted deflection routing.

[BibT_eX]

[DOI]

Thierry Chich

Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1997), 1997

1996

Minimum gossip bus networks.

[BibT_eX]

[DOI]

Christian Laforest

Networks, 1996

Local Memory Requirement of Universal Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

1995

Antepenultimate broadcasting.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Joseph G. Peters

Networks, 1995

Memory Requirement for Universal Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Structured communication in torus networks.

[BibT_eX]

[DOI]

Joseph G. Peters

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994

Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer.

[BibT_eX]

[DOI]

Michel Cosnard

IEEE Trans. Parallel Distributed Syst., 1994

Broadcasting and Gossiping in de Bruijn Networks.

[BibT_eX]

[DOI]

Jean-Claude Bermond

SIAM J. Comput., 1994

Methods and problems of communication in usual networks.

[BibT_eX]

[DOI]

Emmanuel Lazard

Discret. Appl. Math., 1994

A Characterization of Networks Supporting Linear Interval Routing.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Multicasting in Meshes.

[BibT_eX]

[DOI]

Eric Fleury

Proceedings of the 1994 International Conference on Parallel Processing, 1994

Optimal Interval Routing.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing: CONPAR 94, 1994

1993

Open Problems.

[BibT_eX]

[DOI]

Arthur L. Liestman

Dominique Sotteau

Parallel Process. Lett., 1993

Scheduling a Scattering-Gathering Sequence on Hypercubes.

[BibT_eX]

[DOI]

Henri-Pierre Charles

Parallel Process. Lett., 1993

Finding a Target Subnetwork in Sparse Networks with Random Faults.

[BibT_eX]

[DOI]

Claire Kenyon

Inf. Process. Lett., 1993

Disjoint Spanning Trees of Small Depth.

[BibT_eX]

Christian Laforest

Proceedings of the Parallel Computing: Trends and Applications, 1993

1992

Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1992

1991

Broadcasting in a Hypercube when Some Calls Fail.

[BibT_eX]

[DOI]

Claudine Peyrat

Inf. Process. Lett., 1991

Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks.

[BibT_eX]

Ching-Tien Ho

Proceedings of the International Conference on Parallel Processing, 1991

Fault-Tolerant Gossiping on Hypercube Multicomputers.

[BibT_eX]

[DOI]

Proceedings of the Distributed Memory Computing, 2nd European Conference, 1991

1990

Scattering on a ring of processors.

[BibT_eX]

[DOI]

Serge Miguet

Yves Robert

Parallel Comput., 1990

Finding the roots of a polynomial on an MIMD multicomputer.

[BibT_eX]

[DOI]

Michel Cosnard

Parallel Comput., 1990

A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial.

[BibT_eX]

[DOI]

Michel Cosnard

Proceedings of the CONPAR 90, 1990

Communications intensives dans les architectures a memoire distribuee et algorithmes paralleles pour la recherche de racines de polynomes.

[BibT_eX]