default search action
Ivan Lavallée
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j7]Said Fouchal, Murat Ahat, Soufian Ben Amor, Ivan Lavallée, Marc Bui:
Competitive clustering algorithms based on ultrametric properties. J. Comput. Sci. 4(4): 219-231 (2013) - [i2]Marc Bui, Michel Lamure, Ivan Lavallée:
La machine α: modèle générique pour les algorithmes naturels. CoRR abs/1304.5604 (2013) - 2012
- [j6]Ivan Lavallée, Babacar Mbaye Ndiaye, Diaraf Seck:
Une approche spécifiquement informatique pour la Programmation Linéaire. Stud. Inform. Univ. 10(2): 5-43 (2012) - [c19]Said Fouchal, Marc Bui, Ivan Lavallée:
Clustering around medoids based on ultrametric properties. INDIN 2012: 986-991 - 2011
- [c18]Said Fouchal, Murat Ahat, Ivan Lavallée:
Optimal clustering method in ultrametric spaces. ISCC 2011: 123-128 - [c17]Ivan Lavallée, Babacar Mbaye Ndiaye, Diaraf Seck:
A New Way in Linear Programming. LISS (2) 2011: 220-227 - [c16]Said Fouchal, Ivan Lavallée:
Fast and flexible unsupervised custering algorithm based on ultrametric properties. Q2SWinet 2011: 35-42 - 2010
- [j5]Ivan Lavallée:
Sur la structuration de deux systèmes complexes canards et processeurs. Stud. Inform. Univ. 8(2): 17-34 (2010) - [c15]Soufian Ben Amor, Marc Bui, Ivan Lavallée:
Optimizing Mobile Networks Connectivity and Routing Using Percolation Theory and Epidemic Algorithms. IICS 2010: 63-78 - [c14]Duc Kien Nguyen, Ivan Lavallée, Marc Bui:
Generalizing of a High Performance Parallel Strassen Implementation on Distributed Memory MIMD Architectures. IICS 2010: 359-370 - [c13]Said Fouchal, Murat Ahat, Ivan Lavallée, Marc Bui, Sofiane Ben Amor:
Clustering Based on Kolmogorov Information. KES (1) 2010: 452-460 - [i1]Colette Johnen, Ivan Lavallée, Christian Lavault:
Reliable Self-Stabilizing Communication for Quasi Rendezvous. CoRR abs/1005.5630 (2010)
2000 – 2009
- 2009
- [j4]Ivan Lavallée, Alexander A. Shvartsman
:
Editors' preface. Theor. Comput. Sci. 410(6-7): 451-452 (2009) - 2007
- [c12]Soufian Ben Amor, V. Levorato, Ivan Lavallée:
Generalized Percolation Processes Using Pretopology Theory. RIVF 2007: 130-134 - 2006
- [c11]Kien Duc Nguyen, Ivan Lavallée, Marc Bui:
A New Direction to Parallelize Winograd's Algorithm on Distributed Memory Computers. HPSC 2006: 445-457 - [c10]Thuy Lien Pham, Marc Bui, Ivan Lavallée, Si Hoàng Do:
An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network. RIVF 2006: 187-194 - [c9]Thi Minh Luan Nguyen, Christophe Lecerf, Ivan Lavallée:
A space aware agent-based modeling process for the study of hierarchical complex systems. SAC 2006: 126-127 - 2005
- [c8]Duc Kien Nguyen, Ivan Lavallée, Marc Bui, Quoc Trung Ha:
A General Scalable Parallelizing of Strassen's Algorithm for Matrix Multiplication on Distributed Memory Computers. ACIS-ICIS 2005: 294-299 - [c7]Thuy Lien Pham, Marc Bui, Ivan Lavallée, Si Hoàng Do:
A Distributed Preflow-Push for the Maximum Flow Problem. IICS 2005: 195-206 - [c6]Thuy Lien Pham, Ivan Lavallée, Marc Bui, Si Hoàng Do:
A Distributed Algorithm for the Maximum Flow Problem. ISPDC 2005: 131-138 - [c5]Duc Kien Nguyen, Ivan Lavallée, Marc Bui, Quoc Trung Ha:
A General Scalable Implementation of Fast Matrix Multiplication Algorithms on Distributed Memory Computers. SNPD 2005: 116-122 - 2004
- [c4]Ivan Lavallée, Marc Bui, Trung Ha Quoc:
An Efficient APSP Algorithm. RIVF 2004: 211-214 - 2001
- [j3]Colette Johnen, Ivan Lavallée, Christian Lavault:
Reliable Self-Stabilizing Communication for Quasi Rendezvous. Stud. Inform. Univ. 1(1): 59-76 (2001) - 2000
- [j2]Ivan Lavallée:
Self-stabilizing distributed spanning tree and leader election algorithm. ACIS Int. J. Comput. Inf. Sci. 1(3): 119-125 (2000) - [c3]Ivan Lavallée, Christian Lavault, Colette Johnen:
Fair and Reliable Self-stabilizing Communication. OPODIS 2000: 163-176
1990 – 1999
- 1993
- [c2]Gérard Florin, Roberto Gómez, Ivan Lavallée:
Recursive distributed programming schemes. ISADS 1993: 122-128 - 1990
- [c1]Ivan Lavallée, Christian Lavault:
Spanning Tree Construction for Nameless Networks. WDAG 1990: 41-56
1980 – 1989
- 1986
- [j1]Ivan Lavallée, Gérard Roucairol:
A Fully Distributed (Minimal) Spanning Tree Algorithm. Inf. Process. Lett. 23(2): 55-62 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: