Guy Louchard

74 papers A* 2A 2B 5Journal 56Unranked 9
YearRankTypeTitle / Venue / Authors
2023 J jnl
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis.
Discret. Math. Theor. Comput. Sci.
Guy Louchard, Werner Schachinger, Mark Daniel Ward
2019 J jnl
The Adaptive sampling revisited.
Discret. Math. Theor. Comput. Sci.
Matthew Drescher, Guy Louchard, Yvik Swan
2018 J jnl
The Adaptive sampling revisited.
CoRR
Guy Louchard, Yvik Swan
2017 J jnl
A refined and asymptotic analysis of optimal stopping problems of Bruss and Weber.
CoRR
Guy Louchard
2017 J jnl
Asymptotic Analysis of Sums of Powers of Multinomial Coefficients: A Saddle Point Approach.
Integers
Guy Louchard, Mark Daniel Ward
2016 J jnl
Sequential selection of the k best out of nrankable objects.
Discret. Math. Theor. Comput. Sci.
F. Thomas Bruss, Guy Louchard
2015 J jnl
Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics.
Comb. Probab. Comput.
Jeffrey Gaither, Guy Louchard, Stephan G. Wagner, Mark Daniel Ward
2012 J jnl
Number of survivors in the presence of a demon.
Period. Math. Hung.
Guy Louchard, Helmut Prodinger, Mark Daniel Ward
2012 J jnl
The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis.
Discret. Math. Theor. Comput. Sci.
Helmut Prodinger, Guy Louchard
2011 — conf
The Swedish Leader Election Protocol: Analysis and Variations.
ANALCO
Guy Louchard, Conrado Martinez, Helmut Prodinger
2010 J jnl
Asymptotic results for silent elimination.
Discret. Math. Theor. Comput. Sci.
Guy Louchard, Helmut Prodinger
2010 J jnl
Asymptotics of the Stirling numbers of the first kind revisited: A saddle point approach.
Discret. Math. Theor. Comput. Sci.
Guy Louchard
2009 J jnl
Inverse auctions: Injecting unique minima into random sets.
ACM Trans. Algorithms
F. Thomas Bruss, Guy Louchard, Mark Daniel Ward
2008 J jnl
Convergence of Some Leader Election Algorithms.
Discret. Math. Theor. Comput. Sci.
Svante Janson, Christian Lavault, Guy Louchard
2008 J jnl
Convergence of some leader election algorithms
CoRR
Svante Janson, Christian Lavault, Guy Louchard
2008 J jnl
Generalized approximate counting revisited.
Theor. Comput. Sci.
Guy Louchard, Helmut Prodinger
2008 J jnl
On gaps and unoccupied urns in sequences of geometrically distributed random variables.
Discret. Math.
Guy Louchard, Helmut Prodinger
2007 J jnl
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.
Helmut Prodinger, Guy Louchard
2007 — conf
FIFO Queuing of Constant Length Fully Synchronous Jobs.
GSEM
Vandy Berten, Raymond Devillers, Guy Louchard
2007 — conf
Representations of Numbers as å
ILC
Guy Louchard, Helmut Prodinger
2006 J jnl
Asymptotic Analysis of a Leader Election Algorithm
CoRR
Christian Lavault, Guy Louchard
2006 J jnl
Asymptotic analysis of a leader election algorithm.
Theor. Comput. Sci.
Christian Lavault, Guy Louchard
2006 J jnl
Asymptotics of the Moments of Extreme-Value Related Distribution Functions.
Algorithmica
Guy Louchard, Helmut Prodinger
2006 J jnl
Common intervals in permutations.
Discret. Math. Theor. Comput. Sci.
Sylvie Corteel, Guy Louchard, Robin Pemantle
2005 J jnl
Monotone runs of uniformly distributed integer random variables: A probabilistic analysis.
Theor. Comput. Sci.
Guy Louchard
2005 J jnl
The Guessing Secrets problem: a probabilistic approach.
J. Algorithms
Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna
2004 — conf
A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs.
CAAN
Eythan Levy, Guy Louchard, Jordi Petit
2004 J jnl
Additive Decompositions, Random Allocations, and Threshold Phenomena.
Comb. Probab. Comput.
Olivier Dubois, Guy Louchard, Jacques Mandler
2004 J jnl
Boltzmann Samplers for the Random Generation of Combinatorial Structures.
Comb. Probab. Comput.
Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer
2003 J jnl
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Theor. Comput. Sci.
Guy Louchard, Helmut Prodinger
2003 J jnl
Generalized covariances of multi-dimensional Brownian excursion local times.
Theor. Comput. Sci.
Guy Louchard, John W. Turner
2003 J jnl
Random 0-1 rectangular matrices: a probabilistic analysis.
Period. Math. Hung.
Guy Louchard, Helmut Prodinger
2003 — conf
The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis.
DRW
Guy Louchard
2002 J jnl
Phase transition for Parking blocks, Brownian excursion and coalescence.
Random Struct. Algorithms
Philippe Chassaing, Guy Louchard
2002 J jnl
Probabilistic Analysis of Carlitz Compositions.
Discret. Math. Theor. Comput. Sci.
Guy Louchard, Helmut Prodinger
2002 A* conf
Random Sampling from Boltzmann Principles.
ICALP
Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer
2002 J jnl
Reflected Brownian Bridge area conditioned on its local time at the origin.
J. Algorithms
Philippe Chassaing, Guy Louchard
2001 J jnl
Analytic Variations on the Airy Distribution.
Algorithmica
Philippe Flajolet, Guy Louchard
2001 J jnl
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Electron. Notes Discret. Math.
Guy Louchard, Helmut Prodinger
2001 J jnl
Distinctness of compositions of an integer: A probabilistic analysis.
Random Struct. Algorithms
Pawel Hitczenko, Guy Louchard
2000 B conf
Generalized Covariances of Multi-dimensional Brownian Excursion Local Times.
LATIN
Guy Louchard
1999 J jnl
Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms.
Theor. Comput. Sci.
Guy Louchard
1999 J jnl
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm.
SIAM J. Comput.
Guy Louchard, Wojciech Szpankowski, Jing Tang
1999 J jnl
Probabilistic analysis of column-convex and directed diagonally-convex animals. II: Trajectories and shapes.
Random Struct. Algorithms
Guy Louchard
1998 J jnl
The Complete Solution of the Competitive Rank Selection Problem.
Algorithmica
F. Thomas Bruss, Michael Drmota, Guy Louchard
1997 J jnl
Data Structures' Maxima.
SIAM J. Comput.
Guy Louchard, Claire Kenyon, René Schott
1997 J jnl
On the average redundancy rate of the Lempel-Ziv code.
IEEE Trans. Inf. Theory
Guy Louchard, Wojciech Szpankowski
1997 J jnl
Probabilistic analysis of adaptative sampling.
Random Struct. Algorithms
Guy Louchard
1997 J jnl
Probabilistic analysis of column-convex and directed diagonally-convex animals.
Random Struct. Algorithms
Guy Louchard
1996 B conf
On the Average Redundancy Rate of the Lempel-Ziv Code.
Data Compression Conference
Guy Louchard, Wojciech Szpankowski
1996 J jnl
Probabilistic Analysis of Some (Un)Directed Animals.
Theor. Comput. Sci.
Guy Louchard
1995 J jnl
A probabilistic Analysis of a String Editing Problem and its Variations.
Comb. Probab. Comput.
Guy Louchard, Wojciech Szpankowski
1995 J jnl
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm.
IEEE Trans. Inf. Theory
Guy Louchard, Wojciech Szpankowski
1995 J jnl
Dynamic Analysis of some Relational Databases Parameters.
Theor. Comput. Sci.
Danièle Gardy, Guy Louchard
1995 A conf
Dynamic Analysis of the Sizes of Relations.
STACS
Danièle Gardy, Guy Louchard
1995 A conf
Finding the Maximum with Linear Error Probabilities: A Sequential Analysis Approach.
STACS
Guy Louchard
1995 B conf
Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile.
Data Compression Conference
Guy Louchard, Wojciech Szpankowski
1994 J jnl
Trie Size in a Dynamic List Structure.
Random Struct. Algorithms
Guy Louchard
1993 B conf
Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract).
CPM
Guy Louchard, Wojciech Szpankowski
1993 — conf
Trie Size in a Dynamic List Structure.
TAPSOFT
Guy Louchard
1992 J jnl
Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis.
Theor. Comput. Sci.
Guy Louchard, B. Randrianarimanana, René Schott
1991 B conf
Data Structures Maxima.
FCT
Guy Louchard, Claire Kenyon, René Schott
1991 J jnl
Probabilistic Analysis of Some Distributed Algorithms.
Random Struct. Algorithms
Guy Louchard, René Schott
1991 J jnl
Robust variations of interpolation search: An asymptotic analysis.
Computing
Guy Louchard
1990 — conf
Probabilistic Analysis of Some Distributed Algorithms.
CAAP
Guy Louchard, René Schott
1989 A* conf
Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis.
ICALP
Guy Louchard, B. Randrianarimanana, René Schott
1987 J jnl
Exact and Asymptotic Distributions in Digital and Binary Search Trees.
RAIRO Theor. Informatics Appl.
Guy Louchard
1987 J jnl
Random Walks, Gaussian Processes and List Structures.
Theor. Comput. Sci.
Guy Louchard
1986 J jnl
Brownian Motion and Algorithm Complexity.
BIT
Guy Louchard
1986 — conf
Random Walks, Gaussian Processes, and List Structures.
CAAP
Guy Louchard
1983 J jnl
The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulation.
RAIRO Theor. Informatics Appl.
Guy Louchard
1977 — conf
Using Auxiliary Variables in Parallel Programs Verification.
International Computing Symposium
Raymond Devillers, Guy Louchard
1976 J jnl
Improvement of Parallelism in a Finite Buffer Sharing Policy.
Comput. J.
Raymond Devillers, Guy Louchard
1973 J jnl
Realization of Petri Nets Without Conditional Statements.
Inf. Process. Lett.
Raymond Devillers, Guy Louchard