| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, R. de Verclos |
The Worst Case Behavior of Randomized Gossip.  |
TAMC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Andrzej Pelc |
Decidability Classes for Mobile Agents Computing. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos |
Special Issue on "Theory and Applications of Graph Searching Problems". |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
Online computation with advice. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Andrzej Pelc |
Delays Induce an Exponential Memory Gap for Rendezvous in Trees |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud |
Parsimonious flooding in dynamic graphs. |
Distributed Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos |
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
Locality and Checkability in Wait-Free Computing. |
DISC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Gavoille, Pierre Fraigniaud (eds.) |
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011 |
PODC |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman, David Peleg |
Local Distributed Decision. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the additive constant of the k-server Work Function Algorithm. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker |
Recovering the long-range links in augmented graphs. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Andrzej Pelc |
Decidability Classes for Mobile Agents Computing |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman, David Peleg |
Local Distributed Decision |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker |
A Lower Bound for Network Navigability. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar |
Local MST Computation with Short Advice. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
Communication algorithms with advice. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman |
Compact Ancestry Labeling Schemes for XML Trees. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud |
Informative Labeling Schemes. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Hoang-Anh Phan |
Degree hunter: on the impact of balancing node degrees in de Bruijn-based overlay networks. |
IPDPS Workshops |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Hoang-Anh Phan |
"Tree-Farms" for Tree-Based Multicast Schemes in Peer-to-Peer Overlay Networks. |
ICC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Andrzej Pelc |
Delays induce an exponential memory gap for rendezvous in trees. |
SPAA |
2010 |
DBLP DOI BibTeX RDF |
mobile entities, robots, exploration, abstract state machine, rendezvous |
| 1 | Pierre Fraigniaud, George Giakkoupis |
On the bit communication complexity of randomized rumor spreading. |
SPAA |
2010 |
DBLP DOI BibTeX RDF |
bit communication complexity, random phone call, rumor spreading |
| 1 | Pierre Fraigniaud |
Provenance for database transformations. |
ICDT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud |
Distributed computational complexities: are you volvo-addicted or nascar-obsessed? |
PODC |
2010 |
DBLP DOI BibTeX RDF |
mobile computing, network computing, wait-free computing |
| 1 | Pierre Fraigniaud, Amos Korman |
An optimal ancestry scheme and small universal posets. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
informative labeling schemes, XML, partially ordered sets |
| 1 | Pierre Fraigniaud, George Giakkoupis |
On the searchability of small-world networks with arbitrary underlying structure. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
decentralized search, social networks, small worlds |
| 1 | Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker |
Universal augmentation schemes for network navigability. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse |
Nondeterministic Graph Searching: From Pathwidth to Treewidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Treewidth, Graph searching, Pathwidth |
| 1 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Labeling Schemes for Tree Representation. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Spanning tree, Labeling scheme, Tree representation |
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the Additive Constant of the k-server Work Function Algorithm |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman |
An Optimal Labeling Scheme for Ancestry Queries |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman |
Compact Ancestry Labeling Schemes for Trees of Small Depth |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
Distributed computing with advice: information sensitivity of graph coloring. |
Distributed Computing |
2009 |
DBLP DOI BibTeX RDF |
Distributed computing, Graph coloring, Network algorithm |
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
Online Computation with Advice. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Baumann, Pierre Fraigniaud |
Sub-linear Universal Spatial Gossip Protocols. |
SIROCCO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman |
On randomized representations of graphs using short labels. |
SPAA |
2009 |
DBLP DOI BibTeX RDF |
adjacency labeling schemes, ancestry labeling schemes, probabilistic embeddings, universal graphs, distributed algorithms |
| 1 | Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud |
Parsimonious flooding in dynamic graphs. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
evolving graphs, broadcasting, gossip protocol, epidemic protocol |
| 1 | Pierre Fraigniaud, George Giakkoupis |
The effect of power-law degrees on the navigability of small worlds: [extended abstract]. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
power-law degrees, greedy routing, small-world graphs |
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the Additive Constant of the k-Server Work Function Algorithm. |
WAOA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos |
Forewords: Special issue on graph searching. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial |
Distributed chasing of network intruders. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Nicolas Nisse |
Monotony properties of connected visible graph searching. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
Tree exploration with advice. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Label-guided graph exploration by a finite automaton. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Distributed algorithms, labeling schemes, graph exploration |
| 1 | Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar |
Networks become navigable as nodes move and forget |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
Impact of memory size on graph exploration capability. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar |
Networks Become Navigable as Nodes Move and Forget. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
spatial gossip, routing, random walks, Small world phenomenon, resource location, dynamic process |
| 1 | Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker |
Recovering the Long-Range Links in Augmented Graphs. |
SIROCCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Andrzej Pelc |
Deterministic Rendezvous in Trees with Little Memory. |
DISC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot |
The Inframetric Model for the Internet. |
INFOCOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Cyril Gavoille |
Polylogarithmic network navigability using compact metrics with small stretch. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
network navigability, social networks, small world phenomenon |
| 1 | Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar |
Forget him and keep on moving. |
PODC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud |
Special Issue DISC 2005. |
Distributed Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud |
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar |
Local MST computation with short advice. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithm, minimum spanning tree, local computation |
| 1 | Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker |
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
small world phenomenon |
| 1 | Pierre Fraigniaud, Philippe Gauron |
D2B: A de Bruijn based content-addressable network. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc |
Collective tree exploration. |
Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc |
Deterministic Rendezvous in Graphs. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Cyril Gavoille |
Header-size lower bounds for end-to-end communication in memoryless networks. |
Computer Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Cyril Gavoille, Christophe Paul |
Eclecticism shrinks even small worlds. |
Distributed Computing |
2006 |
DBLP DOI BibTeX RDF |
Milgram’s experiment, Routing, Small world graphs |
| 1 | Pierre Fraigniaud |
Navigability of Small World Networks. |
HiPC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Nicolas Nisse |
Monotony Properties of Connected Visible Graph Searching. |
WG |
2006 |
DBLP DOI BibTeX RDF |
Treewidth, Graph Searching, Pathwidth |
| 1 | Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis |
Topic 12: Theory and Algorithms for Parallel Computation. |
Euro-Par |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker |
A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
small world, greedy routing, doubling dimension |
| 1 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
Tree Exploration with an Oracle. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Nicolas Nisse |
Connected Treewidth and Connected Graph Searching. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial |
Distributed Chasing of Network Intruders. |
SIROCCO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker |
Brief Announcement: On Augmented Graph Navigability. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
Oracle size: a new measure of difficulty for communication tasks. |
PODC |
2006 |
DBLP DOI BibTeX RDF |
broadcast, oracle, wakeup |
| 1 | Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil |
The Reduced Automata Technique for Graph Exploration Space Lower Bounds. |
Essays in Memory of Shimon Even |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg |
Graph exploration by a finite automaton. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg |
An algorithmic model for heterogeneous hyper-clusters: rationale and experience. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg |
Efficient trigger-broadcasting in heterogeneous clusters. |
J. Parallel Distrib. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Philippe Gauron, Matthieu Latapy |
Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. |
Euro-Par |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud |
Greedy Routing in Tree-Decomposed Graphs. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Labeling Schemes for Tree Representation. |
IWDC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Label-Guided Graph Exploration by a Finite Automaton. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse |
Nondeterministic Graph Searching: From Pathwidth to Treewidth. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
treewidth, graph searching, pathwidth |
| 1 | Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil |
Space Lower Bounds for Graph Exploration via Reduced Automata. |
SIROCCO |
2005 |
DBLP DOI BibTeX RDF |
robot, mobile agent, finite automaton, Graph exploration |
| 1 | Pierre Fraigniaud (eds.) |
Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings |
DISC |
2005 |
DBLP BibTeX RDF |
|
| 1 | Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc |
Tree exploration with little memory. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud |
A note on line broadcast in digraphs under the edge-disjoint paths mode. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg |
Graph Exploration by a Finite Automaton. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc |
Collective Tree Exploration. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, David Ilcinkas |
Digraphs Exploration with Little Memory. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud |
Reducing Packet-Loss by Taking Long-Range Dependences into Account. |
NETWORKING |
2004 |
DBLP DOI BibTeX RDF |
Routing, Multicast, IP Networks, Self-Similar Traffic |
| 1 | Pierre Fraigniaud, Cyril Gavoille, Christophe Paul |
Eclecticism shrinks even small worlds. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
routing, distributed hash tables, small world graphs |
| 1 | Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny |
Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. |
Wireless Communications and Mobile Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos |
Searching Is Not Jumping. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann |
Topic Introduction. |
Euro-Par |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc |
Deterministic Rendezvous in Graphs. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny |
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. |
SODA |
2003 |
DBLP DOI 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 | Pierre Fraigniaud, Cyril Gavoille |
Lower Bounds for Oblivious Single-Packet End-to-End Communication. |
DISC |
2003 |
DBLP DOI BibTeX RDF |
Sequence Transmission, End-to-End, Tree-Width |
| 1 | Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
Can we elect if we cannot compare? |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
distributed computing, mobile agents, cayley graphs, election, rendezvous, anonymous networks |
| 1 | Pierre Fraigniaud, Philippe Gauron |
Brief announcement: an overview of the content-addressable network D2B. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")