Pierre Fraigniaud - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

On the additive constant of the k-server Work Function AlgorithmYuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. ipl, 110(24):1120-1123, 2010. [doi]

Communication algorithms with advicePierre Fraigniaud, David Ilcinkas, Andrzej Pelc. jcss, 76(3-4):222-232, 2010. [doi]

An optimal ancestry scheme and small universal posetsPierre Fraigniaud, Amos Korman. stoc 2010: 611-620 [doi]

On the bit communication complexity of randomized rumor spreadingPierre Fraigniaud, George Giakkoupis. spaa 2010: 134-143 [doi]

A Lower Bound for Network NavigabilityPierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. siamdm, 24(1):72-81, 2010. [doi]

Delays induce an exponential memory gap for rendezvous in treesPierre Fraigniaud, Andrzej Pelc. spaa 2010: 224-232 [doi]

Local MST Computation with Short AdvicePierre Fraigniaud, Amos Korman, Emmanuelle Lebhar. mst, 47(4):920-933, 2010. [doi]

On the searchability of small-world networks with arbitrary underlying structurePierre Fraigniaud, George Giakkoupis. stoc 2010: 389-398 [doi]

Provenance for database transformationsPierre Fraigniaud. icdt 2010: 3 [doi]

Compact Ancestry Labeling Schemes for XML TreesPierre Fraigniaud, Amos Korman. soda 2010: 458-466 [doi]

Degree hunter: on the impact of balancing node degrees in de Bruijn-based overlay networksPierre Fraigniaud, Hoang-Anh Phan. ipps 2010: 1-8 [doi]

Recovering the long-range links in augmented graphsPierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. TCS, 411(14-15):1613-1625, 2010. [doi]

2009

Sub-linear Universal Spatial Gossip ProtocolsHervÃ© Baumann, Pierre Fraigniaud. sirocco 2010: 44-56 [doi]

Parsimonious flooding in dynamic graphsHervÃ© Baumann, Pierluigi Crescenzi, Pierre Fraigniaud. podc 2009: 260-269 [doi]

Labeling Schemes for Tree RepresentationReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg. algorithmica, 53(1):1-15, 2009. [doi]

Online Computation with AdviceYuval Emek, Pierre Fraigniaud, Amos Korman, Adi RosÃ©n. icalp 2009: 427-438 [doi]

On the Additive Constant of the ::::k::::-Server Work Function AlgorithmYuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. waoa 2010: 128-134 [doi]

Nondeterministic Graph Searching: From Pathwidth to TreewidthFedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse. algorithmica, 53(3):358-373, 2009. [doi]

Universal augmentation schemes for network navigabilityPierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker. TCS, 410(21-23):1970-1981, 2009. [doi]

The effect of power-law degrees on the navigability of small worlds: [extended abstract]Pierre Fraigniaud, George Giakkoupis. podc 2009: 240-249 [doi]

On randomized representations of graphs using short labelsPierre Fraigniaud, Amos Korman. spaa 2009: 131-137 [doi]

Distributed computing with advice: information sensitivity of graph coloringPierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. dc, 21(6):395-403, 2009. [doi]

2008

Distributed chasing of network intrudersLélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. TCS, 399(1-2):12-37, 2008. [doi]

Forget him and keep on movingAugustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar. podc 2008: 415 [doi]

Networks Become Navigable as Nodes Move and ForgetAugustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar. icalp 2008: 133-144 [doi]

Label-guided graph exploration by a finite automatonReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg. talg, 4(4), 2008. [doi]

Forewords: Special issue on graph searchingFedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos. TCS, 399(3):157, 2008. [doi]

Deterministic Rendezvous in Trees with Little MemoryPierre Fraigniaud, Andrzej Pelc. wdag 2008: 242-256 [doi]

Tree exploration with advicePierre Fraigniaud, David Ilcinkas, Andrzej Pelc. iandc, 206(11):1276-1287, 2008. [doi]

Polylogarithmic network navigability using compact metrics with small stretchPierre Fraigniaud, Cyril Gavoille. spaa 2008: 62-69 [doi]

Recovering the Long-Range Links in Augmented GraphsPierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. sirocco 2008: 104-118 [doi]

Impact of memory size on graph exploration capabilityPierre Fraigniaud, David Ilcinkas, Andrzej Pelc. DAM, 156(12):2310-2319, 2008. [doi]

Monotony properties of connected visible graph searchingPierre Fraigniaud, Nicolas Nisse. iandc, 206(12):1383-1393, 2008. [doi]

The Inframetric Model for the InternetPierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot. infocom 2008: 1085-1093 [doi]

2007

2006

Distributed Chasing of Network IntrudersLélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. sirocco 2006: 70-84 [doi]

Deterministic Rendezvous in GraphsAnders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc. algorithmica, 46(1):69-96, 2006. [doi]

Collective tree explorationPierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc. networks, 48(3):166-177, 2006. [doi]

Header-size lower bounds for end-to-end communication in memoryless networksPierre Fraigniaud, Cyril Gavoille. cn, 50(10):1630-1638, 2006. [doi]

Tree Exploration with an OraclePierre Fraigniaud, David Ilcinkas, Andrzej Pelc. mfcs 2006: 24-37 [doi]

Oracle size: a new measure of difficulty for communication tasksPierre Fraigniaud, David Ilcinkas, Andrzej Pelc. podc 2006: 179-187 [doi]

Eclecticism shrinks even small worldsPierre Fraigniaud, Cyril Gavoille, Christophe Paul. dc, 18(4):279-291, 2006. [doi]

Navigability of Small World NetworksPierre Fraigniaud. hipc 2006: 1 [doi]

D2B: A de Bruijn based content-addressable networkPierre Fraigniaud, Philippe Gauron. TCS, 355(1):65-79, 2006. [doi]

Monotony Properties of Connected Visible Graph SearchingPierre Fraigniaud, Nicolas Nisse. criwg 2006: 229-240 [doi]

Connected Treewidth and Connected Graph SearchingPierre Fraigniaud, Nicolas Nisse. latin 2006: 479-490 [doi]

A Doubling Dimension Threshold ::::Theta::::(loglog::::n::::) for Augmented Graph NavigabilityPierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. esa 2006: 376-386 [doi]

The Reduced Automata Technique for Graph Exploration Space Lower BoundsPierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil. BIRTHDAY 2006: 1-26 [doi]

Brief Announcement: On Augmented Graph NavigabilityPierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. wdag 2006: 551-553 [doi]

Topic 12: Theory and Algorithms for Parallel ComputationDanny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis. europar 2006: 799 [doi]

2005

An algorithmic model for heterogeneous hyper-clusters: rationale and experienceFranck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg. ijfcs, 16(2):195-215, 2005. [doi]

Labeling Schemes for Tree RepresentationReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg. iwdc 2005: 13-24 [doi]

Label-Guided Graph Exploration by a Finite AutomatonReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg. icalp 2005: 335-346 [doi]

Nondeterministic Graph Searching: From Pathwidth to TreewidthFedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse. mfcs 2005: 364-375 [doi]

Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, ProceedingsPierre Fraigniaud, editor, Volume 3724 of Lecture Notes in Computer Science, Springer, 2005.

Efficient trigger-broadcasting in heterogeneous clustersPierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg. jpdc, 65(5):628-642, 2005. [doi]

Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P SystemPierre Fraigniaud, Philippe Gauron, Matthieu Latapy. europar 2005: 1163-1172 [doi]

Greedy Routing in Tree-Decomposed GraphsPierre Fraigniaud. esa 2005: 791-802 [doi]

Space Lower Bounds for Graph Exploration via Reduced AutomataPierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil. sirocco 2005: 140-154 [doi]

Graph exploration by a finite automatonPierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg. TCS, 345(2-3):331-344, 2005. [doi]

2004

Reducing Packet-Loss by Taking Long-Range Dependences into AccountJ. Ignacio Alvarez-Hamelin, Pierre Fraigniaud. networking 2004: 1096-1107 [doi]

Tree exploration with little memoryKrzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc. jal, 51(1):38-63, 2004. [doi]

A note on line broadcast in digraphs under the edge-disjoint paths modePierre Fraigniaud. DAM, 144(3):320-323, 2004. [doi]

Collective Tree ExplorationPierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc. latin 2004: 141-151 [doi]

Eclecticism shrinks even small worldsPierre Fraigniaud, Cyril Gavoille, Christophe Paul. podc 2004: 169-178 [doi]

Digraphs Exploration with Little MemoryPierre Fraigniaud, David Ilcinkas. STACS 2004: 246-257 [doi]

Graph Exploration by a Finite AutomatonPierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg. mfcs 2004: 451-462 [doi]

2003

Can we elect if we cannot compare?Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro. spaa 2003: 324-332 [doi]

Election and Rendezvous in Fully Anonymous Systems with Sense of DirectionLali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro. sirocco 2003: 17-32

Dynamic construction of Bluetooth scatternets of fixed degree and low diameterLali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny. soda 2003: 781-790 [doi]

Searching Is Not JumpingLali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos. criwg 2003: 34-45 [doi]

Robust position-based routing in wireless ad hoc networks with irregular transmission rangesLali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny. wicomm, 3(2):141-153, 2003. [doi]

Deterministic Rendezvous in GraphsAnders Dessmark, Pierre Fraigniaud, Andrzej Pelc. esa 2003: 184-195 [doi]

Lower Bounds for Oblivious Single-Packet End-to-End CommunicationPierre Fraigniaud, Cyril Gavoille. wdag 2003: 211-223 [doi]

Brief announcement: an overview of the content-addressable network D2BPierre Fraigniaud, Philippe Gauron. podc 2003: 151 [doi]

Topic IntroductionChristos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann. europar 2003: 884 [doi]

2002

2001

Efficient Routing in Networks with Long Range ContactsLali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc. wdag 2001: 270-284 [doi]

Robust position-based routing in wireless Ad Hoc networks with unstable transmission rangesLali Barrière, Pierre Fraigniaud, Lata Narayanan. dialm 2001: 19-27 [doi]

HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous ProcessorsFranck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg. ipps 2001: 42

Unslotted deflection routing: a practical and efficient protocol for multihop optical networksThierry Chich, Pierre Fraigniaud, Johanne Cohen. ton, 9(1):47-59, 2001. [doi]

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, 2001Francesc Comellas, Josep Fàbrega, Pierre Fraigniaud, editors, Volume 8 of Proceedings in Informatics, Carleton Scientific, 2001.

Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths ModePierre Fraigniaud. esa 2001: 440-451 [doi]

Assigning labels in an unknown anonymous network with a leaderPierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes. dc, 14(3):163-183, 2001. [doi]

Routing in TreesPierre Fraigniaud, Cyril Gavoille. icalp 2001: 757-772 [doi]

Interval routing schemes allow broadcasting with linear message-complexityPierre Fraigniaud, Cyril Gavoille, Bernard Mans. dc, 14(4):217-229, 2001. [doi]

PreviousNext