Ivan Lavallée

According to our database1, Ivan Lavallée authored at least 27 papers between 1986 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Competitive clustering algorithms based on ultrametric properties.
J. Comput. Sci., 2013

La machine α: modèle générique pour les algorithmes naturels
CoRR, 2013

2012
Une approche spécifiquement informatique pour la Programmation Linéaire.
Stud. Inform. Univ., 2012

Clustering around medoids based on ultrametric properties.
Proceedings of the IEEE 10th International Conference on Industrial Informatics, 2012

2011
Fast and flexible unsupervised custering algorithm based on ultrametric properties.
Proceedings of the Q2SWinet'11, Proceedings of the Seventh ACM Symposium on QoS and Security for Wireless and Mobile Networks, Miami, FL, USA, October 31, 2011

A New Way in Linear Programming.
Proceedings of the LISS 2011 - Proceedings of the 1st International Conference on Logistics, Informatics and Service Science, Volume 2, Beijing, China, 8, 2011

Optimal clustering method in ultrametric spaces.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

2010
Sur la structuration de deux systèmes complexes canards et processeurs.
Stud. Inform. Univ., 2010

Clustering Based on Kolmogorov Information.
Proceedings of the Knowledge-Based and Intelligent Information and Engineering Systems, 2010

Generalizing of a High Performance Parallel Strassen Implementation on Distributed Memory MIMD Architectures.
Proceedings of the 10th International Conference on Innovative Internet Community Services (I<sup>2</sup>CS), 2010

Optimizing Mobile Networks Connectivity and Routing Using Percolation Theory and Epidemic Algorithms.
Proceedings of the 10th International Conference on Innovative Internet Community Services (I<sup>2</sup>CS), 2010

2009
Editors' preface.
Theor. Comput. Sci., 2009

2007
Generalized Percolation Processes Using Pretopology Theory.
Proceedings of the 2007 IEEE International Conference on Research, 2007

2006
A space aware agent-based modeling process for the study of hierarchical complex systems.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network.
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006

A New Direction to Parallelize Winograd's Algorithm on Distributed Memory Computers.
Proceedings of the Modeling, 2006

2005
A General Scalable Implementation of Fast Matrix Multiplication Algorithms on Distributed Memory Computers.
Proceedings of the 6th ACIS International Conference on Software Engineering, 2005

A Distributed Algorithm for the Maximum Flow Problem.
Proceedings of the 4th International Symposium on Parallel and Distributed Computing (ISPDC 2005), 2005

A Distributed Preflow-Push for the Maximum Flow Problem.
Proceedings of the Innovative Internet Community Systems, 5th International Workshop, 2005

A General Scalable Parallelizing of Strassen's Algorithm for Matrix Multiplication on Distributed Memory Computers.
Proceedings of the 4th Annual ACIS International Conference on Computer and Information Science (ICIS 2005), 2005

2004
An Efficient APSP Algorithm.
Proceedings of the Actes de la Deuxieme Conference Internationale Associant Chercheurs Vietnamiens et Francophones en Informatique, 2004

2001
Reliable Self-Stabilizing Communication for Quasi Rendezvous.
Stud. Inform. Univ., 2001

2000
Self-stabilizing distributed spanning tree and leader election algorithm.
ACIS Int. J. Comput. Inf. Sci., 2000

Fair and Reliable Self-stabilizing Communication.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

1993
Recursive distributed programming schemes.
Proceedings of the International Symposium on Autonomous Decentralized Systems, 1993

1990
Spanning Tree Construction for Nameless Networks.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1986
A Fully Distributed (Minimal) Spanning Tree Algorithm.
Inf. Process. Lett., 1986


  Loading...