The SCEAS System
| |||||||

## Search the dblp DataBase
Ivan Lavallée:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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.**[Citation Graph (0, 0)][DBLP] ACIS-ICIS, 2005, pp:294-299 [Conf] - Thuy Lien Pham, Marc Bui, Ivan Lavallée, Si Hoàng Do
**A Distributed Preflow-Push for the Maximum Flow Problem.**[Citation Graph (0, 0)][DBLP] IICS, 2005, pp:195-206 [Conf] - Thuy Lien Pham, Ivan Lavallée, Marc Bui, Si Hoàng Do
**A Distributed Algorithm for the Maximum Flow Problem.**[Citation Graph (0, 0)][DBLP] ISPDC, 2005, pp:131-138 [Conf] - Ivan Lavallée, Christian Lavault, Colette Johnen
**Fair and Reliable Self-stabilizing Communication.**[Citation Graph (0, 0)][DBLP] OPODIS, 2000, pp:163-176 [Conf] - Ivan Lavallée, Marc Bui, Trung Ha Quoc
**An Efficient APSP Algorithm.**[Citation Graph (0, 0)][DBLP] RIVF, 2004, pp:211-214 [Conf] - Thi Minh Luan Nguyen, Christophe Lecerf, Ivan Lavallée
**A space aware agent-based modeling process for the study of hierarchical complex systems.**[Citation Graph (0, 0)][DBLP] SAC, 2006, pp:126-127 [Conf] - Duc Kien Nguyen, Ivan Lavallée, Marc Bui, Quoc Trung Ha
**A General Scalable Implementation of Fast Matrix Multiplication Algorithms on Distributed Memory Computers.**[Citation Graph (0, 0)][DBLP] SNPD, 2005, pp:116-122 [Conf] - Ivan Lavallée, Christian Lavault
**Spanning Tree Construction for Nameless Networks.**[Citation Graph (0, 0)][DBLP] WDAG, 1990, pp:41-56 [Conf] - Ivan Lavallée, Gérard Roucairol
**A Fully Distributed (Minimal) Spanning Tree Algorithm.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1986, v:23, n:2, pp:55-62 [Journal] - Colette Johnen, Ivan Lavallée, Christian Lavault
**Reliable Self-Stabilizing Communication for Quasi Rendezvous.**[Citation Graph (0, 0)][DBLP] Stud. Inform. Univ., 2001, v:1, n:1, pp:59-76 [Journal] **Optimizing Mobile Networks Connectivity and Routing Using Percolation Theory and Epidemic Algorithms.**[Citation Graph (, )][DBLP]**Generalizing of a High Performance Parallel Strassen Implementation on Distributed Memory MIMD Architectures.**[Citation Graph (, )][DBLP]**An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network.**[Citation Graph (, )][DBLP]**Generalized Percolation Processes Using Pretopology Theory.**[Citation Graph (, )][DBLP]
Search in 0.171secs, Finished in 0.172secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |