Guy Louchard

Discret. Math. Theor. Comput. Sci., 2007

Representations of Numbers as åk=-nn ek k\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach.

[BibT_eX]

[DOI]

Proceedings of the Infinity in Logic and Computation, International Conference, 2007

FIFO Queuing of Constant Length Fully Synchronous Jobs.

[BibT_eX]

[DOI]

Vandy Berten

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.

[BibT_eX]

[DOI]

Christian Lavault

Theor. Comput. Sci., 2006

Common intervals in permutations.

[BibT_eX]

[DOI]

Sylvie Corteel

Robin Pemantle

Discret. Math. Theor. Comput. Sci., 2006

Asymptotics of the Moments of Extreme-Value Related Distribution Functions.

[BibT_eX]

[DOI]

Algorithmica, 2006

2005

Monotone runs of uniformly distributed integer random variables: A probabilistic analysis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The Guessing Secrets problem: a probabilistic approach.

[BibT_eX]

[DOI]

J. Algorithms, 2005

2004

Boltzmann Samplers for the Random Generation of Combinatorial Structures.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Additive Decompositions, Random Allocations, and Threshold Phenomena.

[BibT_eX]

[DOI]

Olivier Dubois

Jacques Mandler

Comb. Probab. Comput., 2004

A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs.

[BibT_eX]

[DOI]

Eythan Levy

Jordi Petit

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

Generalized covariances of multi-dimensional Brownian excursion local times.

[BibT_eX]

[DOI]

John W. Turner

Theor. Comput. Sci., 2003

Random 0-1 rectangular matrices: a probabilistic analysis.

[BibT_eX]

[DOI]

Period. Math. Hung., 2003

The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis.

[BibT_eX]

[DOI]

Proceedings of the Discrete Random Walks, 2003

2002

Phase transition for Parking blocks, Brownian excursion and coalescence.

[BibT_eX]

[DOI]

Philippe Chassaing

Random Struct. Algorithms, 2002

Reflected Brownian Bridge area conditioned on its local time at the origin.

[BibT_eX]

[DOI]

Philippe Chassaing

J. Algorithms, 2002

Probabilistic Analysis of Carlitz Compositions.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2002

Random Sampling from Boltzmann Principles.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Distinctness of compositions of an integer: A probabilistic analysis.

[BibT_eX]

[DOI]

Pawel Hitczenko

Random Struct. Algorithms, 2001

Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Analytic Variations on the Airy Distribution.

[BibT_eX]

[DOI]

Philippe Flajolet

Algorithmica, 2001

2000

Generalized Covariances of Multi-dimensional Brownian Excursion Local Times.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm.

[BibT_eX]

[DOI]

Jing Tang

SIAM J. Comput., 1999

Probabilistic analysis of column-convex and directed diagonally-convex animals. II: Trajectories and shapes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1999

1998

The Complete Solution of the Competitive Rank Selection Problem.

[BibT_eX]

[DOI]

F. Thomas Bruss

Michael Drmota

Algorithmica, 1998

1997

On the average redundancy rate of the Lempel-Ziv code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Data Structures' Maxima.

[BibT_eX]

[DOI]

Claire Kenyon

SIAM J. Comput., 1997

Probabilistic analysis of column-convex and directed diagonally-convex animals.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

Probabilistic analysis of adaptative sampling.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

1996

Probabilistic Analysis of Some (Un)Directed Animals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

1995

Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Dynamic Analysis of some Relational Databases Parameters.

[BibT_eX]

[DOI]

Danièle Gardy

Theor. Comput. Sci., 1995

A probabilistic Analysis of a String Editing Problem and its Variations.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

Finding the Maximum with Linear Error Probabilities: A Sequential Analysis Approach.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Dynamic Analysis of the Sizes of Relations.

[BibT_eX]

[DOI]

Danièle Gardy

Proceedings of the STACS 95, 1995

Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1995

1994

Trie Size in a Dynamic List Structure.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

1993

Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992

Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis.

[BibT_eX]

[DOI]

B. Randrianarimanana

Theor. Comput. Sci., 1992

1991

Probabilistic Analysis of Some Distributed Algorithms.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1991

Robust variations of interpolation search: An asymptotic analysis.

[BibT_eX]

[DOI]

Computing, 1991

1989

Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis.

[BibT_eX]

[DOI]

B. Randrianarimanana

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1987

Random Walks, Gaussian Processes and List Structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Exact and Asymptotic Distributions in Digital and Binary Search Trees.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1987

1986

Brownian Motion and Algorithm Complexity.

[BibT_eX]

[DOI]

BIT, 1986

1983

The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulation.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1983

1977

Using Auxiliary Variables in Parallel Programs Verification.

[BibT_eX]

Proceedings of the International Computing Symposium 1977, 1977

1976

Improvement of Parallelism in a Finite Buffer Sharing Policy.

[BibT_eX]

[DOI]

Comput. J., 1976

1973

Realization of Petri Nets Without Conditional Statements.

[BibT_eX]

[DOI]