Christian Lavault

Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019

2015

Overview on Heisenberg - Weyl Algebra and Subsets of Riordan Subgroups.

[BibT_eX]

[DOI]

Silvia Goodenough

Electron. J. Comb., 2015

2014

On subsets of Riordan subgroups and Heisenberg-Weyl algebra.

[BibT_eX]

[DOI]

Silvia Goodenough

CoRR, 2014

2013

A New Modular Division Algorithm and Applications.

[BibT_eX]

[DOI]

CoRR, 2013

Worst-Case Analysis of Weber's Algorithm.

[BibT_eX]

[DOI]

CoRR, 2013

Multiplicate inverse forms of terminating hypergeometric series.

[BibT_eX]

[DOI]

CoRR, 2013

A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm.

[BibT_eX]

[DOI]

CoRR, 2013

2011

Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks.

[BibT_eX]

[DOI]

Maria Cristina Pinotti

IEEE Trans. Mob. Comput., 2011

A note on Prüfer-like coding and counting forests of uniform hypertrees

[BibT_eX]

[DOI]

CoRR, 2011

2008

A distributed approximation algorithm for the minimum degree minimum weight spanning trees.

[BibT_eX]

[DOI]

Mario Valencia-Pabon

J. Parallel Distributed Comput., 2008

Convergence of Some Leader Election Algorithms.

[BibT_eX]

[DOI]

Svante Janson

Guy Louchard

Discret. Math. Theor. Comput. Sci., 2008

Efficient binary schemes for training heterogeneous sensor and actor networks.

[BibT_eX]

[DOI]

Ferruccio Barsi

Alfredo Navarra

Maria Cristina Pinotti

Proceedings of the 1st ACM International Workshop on Heterogeneous Sensor and Actor Networks, 2008

2007

Quasi-optimal energy-efficient leader election algorithms in radio networks.

[BibT_eX]

[DOI]

Jean-François Marckert

Inf. Comput., 2007

2006

Asymptotic analysis of a leader election algorithm.

[BibT_eX]

[DOI]

Guy Louchard

Theor. Comput. Sci., 2006

Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots

[BibT_eX]

[DOI]

Jean-François Marckert

CoRR, 2006

A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots

[BibT_eX]

[DOI]

Jean-François Marckert

Christian Antoine Louis Lavault

CoRR, 2006

An energy-efficient initialization algorithm for random radio networks.

[BibT_eX]

[DOI]

Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006

2005

A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal.

[BibT_eX]

[DOI]

Gabriel Paillard

Felipe Maia Galvão França

Proceedings of the 4th International Symposium on Parallel and Distributed Computing (ISPDC 2005), 2005

2004

A distributed algorithm for constructing a minimum diameter spanning tree.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

Assigning Codes in a Random Wireless Network.

[BibT_eX]

[DOI]

Fayçal Djerourou

Gabriel Antoine Louis Paillard

Proceedings of the Telecommunications and Networking, 2004

2002

Embeddings into the Pancake Interconnection Network.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2002

2001

Reliable Self-Stabilizing Communication for Quasi Rendezvous.

[BibT_eX]

[DOI]

Colette Johnen

Ivan Lavallée

Stud. Inform. Univ., 2001

2000

Fair and Reliable Self-stabilizing Communication.

[BibT_eX]

Ivan Lavallée

Colette Johnen

Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

1999

On the hierarchy of functioning rules in distributed computing.

[BibT_eX]

[DOI]

Alain Bui

RAIRO Oper. Res., 1999

Worst-case analysis of Weber's GCD algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

1998

Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems.

[BibT_eX]

Proceedings of the Distributed Computing, 1998

1997

Improvements on the Accelerated Integer GCD Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Optimal Pattern Matching on dDimensional Meshes.

[BibT_eX]

Fouzia Moussouni

Proceedings of the On Principles Of Distributed Systems, 1997

1996

Distributed String Matching Algorithm on the <i>N</i>-cube.

[BibT_eX]

[DOI]

Fouzia Moussouni

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

N-Cube String Matching Algorithm with Long Texts.

[BibT_eX]

[DOI]

Fouzia Moussouni

Proceedings of the Combinatorics and Computer Science, 1995

1994

Orientation of Distributed Networks: Graph- and Group- Theoretic Modelling.

[BibT_eX]

Proceedings of the Structural Information and Communication Complexity, 1994

1992

Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal).

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing: CONPAR 92, 1992

1990

Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Spanning Tree Construction for Nameless Networks.

[BibT_eX]

[DOI]

Ivan Lavallée

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989

Average Number of Messages for Distributed Leader-Finding in Rings of Processors.

[BibT_eX]

[DOI]