Jussieu - PDFSEARCH.IO - Document Search Engine

Jussieu
Results: 1637

#	Item
361	U NIVERSITÉ PARIS D IDEROT, C OMPLÉMENTS C ALCUL S TOCHASTIQUE , F EUILLE 1 Add to Reading List Source URL: www.proba.jussieu.fr Language: French - Date: 2015-05-29 08:40:59
362	On the Searchability of Small-World Networks ∗ with Arbitrary Underlying Structure Pierre Fraigniaud George Giakkoupis Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-04-12 08:36:01 Network flow Tree decomposition Shortest path problem Flow network Differential geometry Product rule Integration by parts Graph theory Mathematics Theoretical computer science
363	Distributed Computing with Advice: Information Sensitivity of Graph Coloring Pierre Fraigniaud1 , Cyril Gavoille2 , David Ilcinkas3⋆ , and Andrzej Pelc3⋆⋆ 1 CNRS and University Paris 7 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2007-04-28 05:56:24 Graph coloring B-tree Edge coloring Tango tree Graph theory Theoretical computer science Mathematics
364	Distributed Chasing of Network Intruders L´elia Blin1 , Pierre Fraigniaud2 , Nicolas Nisse2 , and Sandrine Vial1 1 2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2007-01-17 10:04:46 Connectivity Stack Searchers Tree decomposition Topology Graph theory Path decomposition Internet search engines
365	What Can Be Decided Locally Without Identifiers? Pierre Fraigniaud Mika Göös CNRS and University Paris Diderot Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2013-08-21 13:36:19 Graph coloring Distributed computing Minimum spanning tree Topology Connectivity Binary tree Randomized algorithm Circuit rank Theoretical computer science Graph theory Mathematics
366	Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:39:17 Computational complexity theory Applied mathematics Competitive analysis K-server problem Randomized algorithm Metrical task system Adversary model Minimum spanning tree Bin packing problem Theoretical computer science Online algorithms Analysis of algorithms
367	A Doubling Dimension Threshold Θ(log log n) for Augmented Graph Navigability? Pierre Fraigniaud1?? , Emmanuelle Lebhar2 ??? Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2007-01-17 10:04:35 Tree decomposition Graph Trapezoid graph Koorde Graph theory Theoretical computer science Mathematics
368	Opportunistic Spatial Gossip over Mobile Social Networks ∗ Augustin Chaintreau Thomson Paris Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2008-06-11 07:55:11 Network theory Computing Distributed data storage Technology Gossip protocol Network architecture Wireless networking
369	Deterministic rendezvous in trees with little memory Pierre Fraigniaud1? and Andrzej Pelc2?? 1 2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2008-09-04 05:03:53 R-tree Rope Tree Computer programming Binary trees Graph theory Computing
370	On Randomized Representations of Graphs Using Short Labels ∗ Pierre Fraigniaud Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:39:17 Universal graph Implicit graph Graph labeling Graph Tree Randomized algorithm Shortest path problem Adjacency matrix Edge-graceful labeling Graph theory Mathematics Theoretical computer science

UPDATE