The following pages link to Pierre Fraigniaud (Q289904):
Displaying 50 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Hierarchical broadcast networks (Q293474) (← links)
- The worst case behavior of randomized gossip protocols (Q477180) (← links)
- Online computation with advice (Q541670) (← links)
- Local MST computation with short advice (Q613116) (← links)
- Parsimonious flooding in dynamic graphs (Q661047) (← links)
- Connected graph searching (Q690489) (← links)
- Finding the roots of a polynomial on an MIMD multicomputer (Q811090) (← links)
- Rendezvous and election of mobile agents: Impact of sense of direction (Q866916) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- Scattering on a ring of processors (Q910194) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Tree exploration with advice (Q958304) (← links)
- Recovering the long-range links in augmented graphs (Q962166) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- On XRAM and PRAM models, and on data-movement-intensive problems (Q1127554) (← links)
- Broadcasting in a hypercube when some calls fail (Q1182079) (← links)
- Complexity analysis of broadcasting in hypercubes with restricted communication capabilities (Q1200159) (← links)
- Strategies for path-based multicasting in wormhole-routed meshes (Q1273891) (← links)
- Finding a target subnetwork in sparse networks with random faults (Q1334631) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- (Q1387831) (redirect page) (← links)
- Recognizing Knödel graphs (Q1613433) (← links)
- Node labels in local decision (Q1625609) (← links)
- Distributed testing of excluded subgraphs (Q1660944) (← links)
- What can be verified locally? (Q1672006) (← links)
- On the additive constant of the \(k\)-server work function algorithm (Q1675878) (← links)
- A note on line broadcast in digraphs under the edge-disjoint paths mode (Q1765240) (← links)
- Efficient trigger-broadcasting in heterogeneous clusters (Q1779733) (← links)
- Polynomial-time algorithms for minimum-time broadcast in trees (Q1871774) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Present-biased optimization (Q2082782) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- Greedy routing in small-world networks with power-law degrees (Q2256946) (← links)
- Randomized distributed decision (Q2256969) (← links)
- On distributed Merlin-Arthur decision protocols (Q2303292) (← links)
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring (Q2304020) (← links)
- Noisy rumor spreading and plurality consensus (Q2318110) (← links)
- D2B: A de Bruijn based content-addressable network (Q2368967) (← links)
- Eclecticism shrinks even small worlds (Q2375296) (← links)
