Guy Louchard

According to our database1, Guy Louchard authored at least 65 papers between 1973 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
The Adaptive sampling revisited.
Discret. Math. Theor. Comput. Sci., 2019

2018
The Adaptive sampling revisited.
CoRR, 2018

2017
Asymptotic Analysis of Sums of Powers of Multinomial Coefficients: A Saddle Point Approach.
Integers, 2017

A refined and asymptotic analysis of optimal stopping problems of Bruss and Weber.
CoRR, 2017

2016
Sequential selection of the k best out of nrankable objects.
Discret. Math. Theor. Comput. Sci., 2016

2015
Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics.
Comb. Probab. Comput., 2015

2012
Number of survivors in the presence of a demon.
Period. Math. Hung., 2012

The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis.
Discret. Math. Theor. Comput. Sci., 2012

2011
The Swedish Leader Election Protocol: Analysis and Variations.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010
Asymptotic results for silent elimination.
Discret. Math. Theor. Comput. Sci., 2010

Asymptotics of the Stirling numbers of the first kind revisited: A saddle point approach.
Discret. Math. Theor. Comput. Sci., 2010

2009
Inverse auctions: Injecting unique minima into random sets.
ACM Trans. Algorithms, 2009

2008
Generalized approximate counting revisited.
Theor. Comput. Sci., 2008

Convergence of Some Leader Election Algorithms.
Discret. Math. Theor. Comput. Sci., 2008

On gaps and unoccupied urns in sequences of geometrically distributed random variables.
Discret. Math., 2008

2007
A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations.
Discret. Math. Theor. Comput. Sci., 2007

Representations of Numbers as å<sub><i>k</i>=-<i>n</i></sub><sup><i>n</i></sup> e<sub><i>k</i></sub> <i>k</i>\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007

FIFO Queuing of Constant Length Fully Synchronous Jobs.
Proceedings of the Grid Service Engineering and Management: The 4th International Conference on Grid Service Engineering and Management, 2007

2006
Asymptotic analysis of a leader election algorithm.
Theor. Comput. Sci., 2006

Common intervals in permutations.
Discret. Math. Theor. Comput. Sci., 2006

Asymptotics of the Moments of Extreme-Value Related Distribution Functions.
Algorithmica, 2006

2005
Monotone runs of uniformly distributed integer random variables: A probabilistic analysis.
Theor. Comput. Sci., 2005

The Guessing Secrets problem: a probabilistic approach.
J. Algorithms, 2005

2004
Boltzmann Samplers for the Random Generation of Combinatorial Structures.
Comb. Probab. Comput., 2004

Additive Decompositions, Random Allocations, and Threshold Phenomena.
Comb. Probab. Comput., 2004

A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
Generalized covariances of multi-dimensional Brownian excursion local times.
Theor. Comput. Sci., 2003

Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Theor. Comput. Sci., 2003

Random 0-1 rectangular matrices: a probabilistic analysis.
Period. Math. Hung., 2003

The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis.
Proceedings of the Discrete Random Walks, 2003

2002
Phase transition for Parking blocks, Brownian excursion and coalescence.
Random Struct. Algorithms, 2002

Reflected Brownian Bridge area conditioned on its local time at the origin.
J. Algorithms, 2002

Probabilistic Analysis of Carlitz Compositions.
Discret. Math. Theor. Comput. Sci., 2002

Random Sampling from Boltzmann Principles.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Distinctness of compositions of an integer: A probabilistic analysis.
Random Struct. Algorithms, 2001

Analytic Variations on the Airy Distribution.
Algorithmica, 2001

2000
Generalized Covariances of Multi-dimensional Brownian Excursion Local Times.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms.
Theor. Comput. Sci., 1999

Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm.
SIAM J. Comput., 1999

Probabilistic analysis of column-convex and directed diagonally-convex animals. II: Trajectories and shapes.
Random Struct. Algorithms, 1999

1998
The Complete Solution of the Competitive Rank Selection Problem.
Algorithmica, 1998

1997
On the average redundancy rate of the Lempel-Ziv code.
IEEE Trans. Inf. Theory, 1997

Data Structures' Maxima.
SIAM J. Comput., 1997

Probabilistic analysis of column-convex and directed diagonally-convex animals.
Random Struct. Algorithms, 1997

Probabilistic analysis of adaptative sampling.
Random Struct. Algorithms, 1997

1996
Probabilistic Analysis of Some (Un)Directed Animals.
Theor. Comput. Sci., 1996

1995
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm.
IEEE Trans. Inf. Theory, 1995

Dynamic Analysis of some Relational Databases Parameters.
Theor. Comput. Sci., 1995

A probabilistic Analysis of a String Editing Problem and its Variations.
Comb. Probab. Comput., 1995

Finding the Maximum with Linear Error Probabilities: A Sequential Analysis Approach.
Proceedings of the STACS 95, 1995

Dynamic Analysis of the Sizes of Relations.
Proceedings of the STACS 95, 1995

Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile.
Proceedings of the IEEE Data Compression Conference, 1995

1994
Trie Size in a Dynamic List Structure.
Random Struct. Algorithms, 1994

1993
Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992
Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis.
Theor. Comput. Sci., 1992

1991
Probabilistic Analysis of Some Distributed Algorithms.
Random Struct. Algorithms, 1991

Robust variations of interpolation search: An asymptotic analysis.
Computing, 1991

1989
Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1987
Random Walks, Gaussian Processes and List Structures.
Theor. Comput. Sci., 1987

Exact and Asymptotic Distributions in Digital and Binary Search Trees.
RAIRO Theor. Informatics Appl., 1987

1986
Brownian Motion and Algorithm Complexity.
BIT, 1986

1983
The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulation.
RAIRO Theor. Informatics Appl., 1983

1977
Using Auxiliary Variables in Parallel Programs Verification.
Proceedings of the International Computing Symposium 1977, 1977

1976
Improvement of Parallelism in a Finite Buffer Sharing Policy.
Comput. J., 1976

1973
Realization of Petri Nets Without Conditional Statements.
Inf. Process. Lett., 1973


  Loading...