Jussieu - PDFSEARCH.IO - Document Search Engine

Jussieu
Results: 1637

#	Item
341	Delays Induce an Exponential Memory Gap for Rendezvous in Trees ∗ Pierre Fraigniaud Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-04-12 08:39:01 Data management Computing Tango tree Ternary tree Binary trees Graph theory B-tree
342	Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡ Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2011-10-30 17:16:12 NP-complete problems Network flow Operations research Probabilistic complexity theory Randomized algorithm Modular decomposition Dominating set Flow network XTR Theoretical computer science Mathematics Graph theory
343	Recovering the Long-Range Links in Augmented Graphs Pierre Fraigniaud1? , Emmanuelle Lebhar1?? , and Zvi Lotker2 1 CNRS and University Paris Diderot Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2008-04-15 13:08:12 Network theory Networks Algebraic graph theory Network analysis Connectivity Small-world network Clustering coefficient Graph Shortest path problem Graph theory Mathematics Theoretical computer science
344	Monotony Properties of Connected Visible Graph Searching Pierre Fraigniaud∗ Nicolas Nisse∗ Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2007-01-17 10:04:51 Tree decomposition Connectivity Graph Tree Cograph Graph theory Graph operations Path decomposition
345	Sub-linear Universal Spatial Gossip Protocols? Herv´e Baumann1 and Pierre Fraigniaud1,2 1 University Paris Diderot 2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:39:17 Network flow Gossip protocol Network architecture Randomized algorithm Flow network Graph theory Theoretical computer science Mathematics
346	Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch Pierre Fraigniaud∗ Cyril Gavoille† Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2008-04-15 13:07:10 Graph operations Tree decomposition Connectivity NP-complete problems Network flow Graph theory Theoretical computer science Mathematics
347	U NIVERSITÉ PARIS D IDEROT, M ARTINGALES C ALCUL S TOCHASTIQUE , F EUILLE 3 Add to Reading List Source URL: www.proba.jussieu.fr Language: French - Date: 2015-05-29 08:40:59
348	Towards a Complexity Theory for Local Distributed Computing⇤ Pierre Fraigniaud† Amos Korman† Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2013-08-21 13:35:48 NP-complete problems Graph coloring Graph theory Analysis of algorithms Complexity classes Randomized algorithm Distributed computing Minimum spanning tree SL Theoretical computer science Computational complexity theory Mathematics
349	Eur. Phys. J. B 6, 543–THE EUROPEAN PHYSICAL JOURNAL B EDP Sciences c Springer-Verlag 1998 Add to Reading List Source URL: www.proba.jussieu.fr Language: English - Date: 2010-06-16 05:05:14 Stochastic processes Statistics Mathematics Black–Scholes Options Stock market Langevin equation Volatility Envelope Equations Mathematical finance Financial economics
350	U NIVERSITÉ PARIS D IDEROT, C ALCUL S TOCHASTIQUE , F EUILLE 8 D IFFUSIONS Exercice 1 (Brownien géométrique). Soit {Bt }t≥0 un brownien réel. Étant données v, r : R+ → R Add to Reading List Source URL: www.proba.jussieu.fr Language: French - Date: 2015-05-29 08:40:59

UPDATE