Filtrer vos résultats
- 155
- 131
- 157
- 73
- 21
- 10
- 7
- 6
- 6
- 4
- 2
- 18
- 278
- 9
- 1
- 1
- 1
- 11
- 39
- 27
- 38
- 31
- 33
- 41
- 27
- 12
- 10
- 5
- 2
- 10
- 258
- 28
- 278
- 258
- 34
- 30
- 30
- 30
- 22
- 18
- 16
- 16
- 15
- 13
- 12
- 10
- 8
- 7
- 7
- 7
- 7
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 65
- 62
- 60
- 43
- 32
- 29
- 28
- 25
- 20
- 17
- 17
- 14
- 14
- 13
- 12
- 11
- 10
- 10
- 10
- 10
- 10
- 9
- 9
- 8
- 8
- 8
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
286 résultats
|
Communication algorithms with adviceJournal of Computer and System Sciences, 2010, 76 (3-4), pp.222-232. ⟨10.1016/j.jcss.2009.07.002⟩
Article dans une revue
hal-00412058v1
|
||
|
Label-Guided Graph Exploration by a Finite AutomatonACM Transactions on Algorithms, 2008, 4 (4), pp.Article 42. ⟨10.1145/1383369.1383373⟩
Article dans une revue
hal-00341609v1
|
||
Memoryless search algorithms in a network with faulty adviceTheoretical Computer Science, 2008, 402 (2-3), pp.190-198
Article dans une revue
hal-00341468v1
|
|||
What Can be Observed Locally? Round-based Models for Quantum Distributed ComputingDISC, Sep 2009, Elche/Elx, Spain. pp.243-257
Communication dans un congrès
hal-00408727v1
|
|||
Dominating Sets in Web GraphsProceedings of the Third Workshop on Algorithms and Models for the Web-Graph (WAW 2004), 2004, India. pp.31--43
Communication dans un congrès
hal-00307024v1
|
|||
Brief Announcement: On the Complexity of Distributed Greedy Coloring21rst International Symposium on Distributed Computing (DISC), septembre 2007, Lemesos, Chypre, Sep 2007, Lemesos, Cyprus. pp.482-484
Communication dans un congrès
hal-00369655v1
|
|||
|
Étude des problèmes d'ordonnancement sur des plates-formes hétérogènes en modèle multi-portCalcul parallèle, distribué et partagé [cs.DC]. Université Sciences et Technologies - Bordeaux I, 2011. Français. ⟨NNT : ⟩
Thèse
tel-00651988v1
|
||
|
The Impact of Edge Deletions on the Number of Errors in NetworksOPODIS 2011, Dec 2011, Toulouse, France. pp.378-391, ⟨10.1007/978-3-642-25873-2_26⟩
Communication dans un congrès
hal-00652051v1
|
||
|
Exploration des graphes dynamiques T-intervalle-connexesCNRIA 2013 - 5ème Colloque National sur la Recherche en Informatique et ses Applications, May 2013, Zinguichor, Sénégal. pp.78-85
Communication dans un congrès
hal-00965933v1
|
||
|
Asymptotics of geometrical navigation on a random set of points of the planeAdvances in Applied Probability, 2011, 43 (4), pp.899-942. ⟨10.1239/aap/1324045692⟩
Article dans une revue
hal-00649901v1
|
||
|
Half-turn symmetric FPLs with rare couplings and tilings of hexagonsTheoretical Computer Science, 2013, 502, pp.143-152
Article dans une revue
hal-00618319v1
|
||
|
Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port ModelIEEE Transactions on Parallel and Distributed Systems, 2014, 25 (10), pp.2520-2528. ⟨10.1109/TPDS.2013.245⟩
Article dans une revue
hal-00861830v1
|
||
Data Gathering in Wireless NetworksArie Koster and Xavier Munoz. Graphs and Algorithms in Communication Networks, Springer-Verlag, pp.357--377, 2010, Springer Monograph
Chapitre d'ouvrage
hal-00342958v1
|
|||
A parallel Algorithm for Computing BordersInternational Conference on Information and Knowledge Managment (CIKM), Oct 2011, Glasgow, United Kingdom. pp.1639-1648
Communication dans un congrès
hal-00644517v1
|
|||
|
Asynchronous deterministic rendezvous in bounded terrainsTheoretical Computer Science, 2011, 412 (50), pp.6926-6937. ⟨10.1016/j.tcs.2011.09.002⟩
Article dans une revue
hal-00643686v1
|
||
|
Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the RingSIROCCO 2013, Jul 2013, Ischia, Italy
Communication dans un congrès
hal-00847771v1
|
||
|
Derandomizing random walks in undirected graphs using locally fair exploration strategiesDistributed Computing, 2011, 24 (2), pp.91-99. ⟨10.1007/s00446-011-0138-4⟩
Article dans une revue
hal-00638229v1
|
||
|
Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard ModelsSPAA - 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012, United States. pp.7
Communication dans un congrès
hal-00704200v1
|
||
|
Time vs. space trade-offs for rendezvous in treesSPAA - 24th Symposium on Parallelism in Algorithms and Architectures - 2012, ACM, 2012, Pittsburgh, United States. pp.1-10, ⟨10.1145/2312005.2312007⟩
Communication dans un congrès
hal-00725924v1
|
||
Steady-state scheduling on heterogeneous clusters.International Journal of Foundations of Computer Science, 2005
Article dans une revue
inria-00358951v1
|
|||
|
Compact Labelings For Efficient First-Order Model-CheckingJournal of Combinatorial Optimization, 2011, 21 (1), pp.19--46
Article dans une revue
hal-00342668v1
|
||
|
Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners2011
Rapport
hal-00622915v2
|
||
|
Fast Periodic Graph Exploration with Constant MemoryJournal of Computer and System Sciences, 2008, 74 (5), pp.808--822. ⟨10.1016/j.jcss.2007.09.004⟩
Article dans une revue
hal-00306995v1
|
||
Complexity results for collective communications on heterogeneous platforms.International Journal of High Performance Computing Applications, 2006
Article dans une revue
inria-00358948v1
|
|||
A realistic model and an efficient heuristic for scheduling with heterogeneous processorsHCW'2002, the 11th Heterogeneous Computing Workshop, 2002, Unknown
Communication dans un congrès
hal-00807411v1
|
|||
|
The Multi-Agent Rotor-Router on the Ring: A Deterministic Alternative to Parallel Random WalksPODC 2013 - ACM Symposium on Principles of Distributed Computing, Jul 2013, Montreal, Canada. pp.365-374, ⟨10.1145/2484239.2484260⟩
Communication dans un congrès
hal-00735113v2
|
||
|
On Power-Law Distributed Balls in Bins and its Applications to View Size EstimationISAAC, Dec 2011, Yokohama, Japan
Communication dans un congrès
inria-00618785v1
|
||
|
Broadcasting on Large Scale Heterogeneous Platforms with connectivity artifacts under the Bounded Multi-Port ModelICPADS 2011 - 17th Internation Conference on Parallel and Distributed Systems, IEEE, Dec 2011, Taïnan, Taiwan. pp.173-180
Communication dans un congrès
inria-00618784v1
|
||
|
Asynchronous deterministic rendezvous in bounded terrains2009
Autre publication scientifique
hal-00442196v1
|
||
|
Structural Information and Communication Complexity. 18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011Kosowski, Adrian and Yamashita, Masafumi. Springer, 6796, pp.317, 2011, Lecture Notes in Computer Science, 978-3-642-22211-5. ⟨10.1007/978-3-642-22212-2⟩
Ouvrages
hal-00646905v1
|