Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Guy Louchard
2010 – today
- 2012
[j46]Helmut Prodinger, Guy Louchard: The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis. Discrete Mathematics & Theoretical Computer Science 14(2): 91-128 (2012)- [j45]Guy Louchard, Helmut Prodinger, Mark Daniel Ward: Number of survivors in the presence of a demon. Periodica Mathematica Hungarica 64(1): 101-117 (2012)
- 2011
- [c18]Guy Louchard, Conrado Martinez, Helmut Prodinger: The Swedish Leader Election Protocol: Analysis and Variations. ANALCO 2011: 127-134
- 2010
- [j44]Guy Louchard: Asymptotics of the Stirling numbers of the first kind revisited: A saddle point approach. Discrete Mathematics & Theoretical Computer Science 12(2): 167-184 (2010)
- [j43]Guy Louchard, Helmut Prodinger: Asymptotic results for silent elimination. Discrete Mathematics & Theoretical Computer Science 12(2): 185-196 (2010)
2000 – 2009
- 2009
- [j42]F. Thomas Bruss, Guy Louchard, Mark Daniel Ward: Inverse auctions: Injecting unique minima into random sets. ACM Transactions on Algorithms 6(1) (2009)
- 2008
- [j41]Guy Louchard, Helmut Prodinger: On gaps and unoccupied urns in sequences of geometrically distributed random variables. Discrete Mathematics 308(9): 1538-1562 (2008)
- [j40]Svante Janson, Christian Lavault, Guy Louchard: Convergence of Some Leader Election Algorithms. Discrete Mathematics & Theoretical Computer Science 10(3) (2008)
- [j39]Guy Louchard, Helmut Prodinger: Generalized approximate counting revisited. Theor. Comput. Sci. 391(1-2): 109-125 (2008)
- [i2]Svante Janson, Christian Lavault, Guy Louchard: Convergence of some leader election algorithms. CoRR abs/0802.1389 (2008)
- 2007
- [j38]Helmut Prodinger, Guy Louchard: A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations. Discrete Mathematics & Theoretical Computer Science 9(1) (2007)
- [c17]Vandy Berten, Raymond R. Devillers, Guy Louchard: FIFO Queuing of Constant Length Fully Synchronous Jobs. GSEM 2007: 81-95
- [c16]Guy Louchard, Helmut Prodinger: Representations of Numbers as åk=-nn ek k\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach. ILC 2007: 87-96
- 2006
- [j37]Guy Louchard, Helmut Prodinger: Asymptotics of the Moments of Extreme-Value Related Distribution Functions. Algorithmica 46(3-4): 431-467 (2006)
- [j36]Sylvie Corteel, Guy Louchard, Robin Pemantle: Common intervals in permutations. Discrete Mathematics & Theoretical Computer Science 8(1): 189-214 (2006)
- [j35]Christian Lavault, Guy Louchard: Asymptotic analysis of a leader election algorithm. Theor. Comput. Sci. 359(1-3): 239-254 (2006)
- [i1]Christian Lavault, Guy Louchard: Asymptotic Analysis of a Leader Election Algorithm. CoRR abs/cs/0607032 (2006)
- 2005
- [j34]Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna: The Guessing Secrets problem: a probabilistic approach. J. Algorithms 55(2): 142-176 (2005)
- [j33]Guy Louchard: Monotone runs of uniformly distributed integer random variables: A probabilistic analysis. Theor. Comput. Sci. 346(2-3): 358-387 (2005)
- 2004
- [j32]Olivier Dubois, Guy Louchard, Jacques Mandler: Additive Decompositions, Random Allocations, and Threshold Phenomena. Combinatorics, Probability & Computing 13(4-5): 537-575 (2004)
- [j31]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer: Boltzmann Samplers for the Random Generation of Combinatorial Structures. Combinatorics, Probability & Computing 13(4-5): 577-625 (2004)
- [c15]Eythan Levy, Guy Louchard, Jordi Petit: A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs. CAAN 2004: 63-74
- 2003
- [j30]Guy Louchard, Helmut Prodinger: Random 0-1 rectangular matrices: a probabilistic analysis. Periodica Mathematica Hungarica 47(1-2): 169-193 (2003)
- [j29]Guy Louchard, Helmut Prodinger: Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. Theor. Comput. Sci. 1-3(304): 59-86 (2003)
- [j28]Guy Louchard, John W. Turner: Generalized covariances of multi-dimensional Brownian excursion local times. Theor. Comput. Sci. 297(1-3): 317-336 (2003)
- [c14]Guy Louchard: The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis. DRW 2003: 155-170
- 2002
- [j27]Guy Louchard, Helmut Prodinger: Probabilistic Analysis of Carlitz Compositions. Discrete Mathematics & Theoretical Computer Science 5(1): 71-96 (2002)
- [j26]Philippe Chassaing, Guy Louchard: Reflected Brownian Bridge area conditioned on its local time at the origin. J. Algorithms 44(1): 29-51 (2002)
- [j25]Philippe Chassaing, Guy Louchard: Phase transition for Parking blocks, Brownian excursion and coalescence. Random Struct. Algorithms 21(1): 76-119 (2002)
- [c13]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer: Random Sampling from Boltzmann Principles. ICALP 2002: 501-513
- 2001
- [j24]Philippe Flajolet, Guy Louchard: Analytic Variations on the Airy Distribution. Algorithmica 31(3): 361-377 (2001)
- [j23]Guy Louchard, Helmut Prodinger: Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. Electronic Notes in Discrete Mathematics 10: 181-186 (2001)
- [j22]Pawel Hitczenko, Guy Louchard: Distinctness of compositions of an integer: A probabilistic analysis. Random Struct. Algorithms 19(3-4): 407-437 (2001)
- 2000
- [c12]Guy Louchard: Generalized Covariances of Multi-dimensional Brownian Excursion Local Times. LATIN 2000: 463-472
1990 – 1999
- 1999
- [j21]Guy Louchard: Probabilistic analysis of column-convex and directed diagonally-convex animals. II: Trajectories and shapes. Random Struct. Algorithms 15(1): 1-23 (1999)
- [j20]Guy Louchard, Wojciech Szpankowski, Jing Tang: Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm. SIAM J. Comput. 28(3): 904-934 (1999)
- [j19]Guy Louchard: Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms. Theor. Comput. Sci. 218(2): 249-262 (1999)
- 1998
- [j18]F. Thomas Bruss, Michael Drmota, Guy Louchard: The Complete Solution of the Competitive Rank Selection Problem. Algorithmica 22(4): 413-447 (1998)
- 1997
- [j17]Guy Louchard: Probabilistic analysis of adaptative sampling. Random Struct. Algorithms 10(1-2): 157-168 (1997)
- [j16]Guy Louchard: Probabilistic analysis of column-convex and directed diagonally-convex animals. Random Struct. Algorithms 11(2): 151-178 (1997)
- [j15]Guy Louchard, Claire Kenyon, René Schott: Data Structures' Maxima. SIAM J. Comput. 26(4): 1006-1042 (1997)
- [j14]Guy Louchard, Wojciech Szpankowski: On the average redundancy rate of the Lempel-Ziv code. IEEE Transactions on Information Theory 43(1): 2-8 (1997)
- 1996
- [j13]Guy Louchard: Probabilistic Analysis of Some (Un)Directed Animals. Theor. Comput. Sci. 159(1): 65-79 (1996)
- [c11]Guy Louchard, Wojciech Szpankowski: On the Average Redundancy Rate of the Lempel-Ziv Code. Data Compression Conference 1996: 92-101
- 1995
- [j12]Guy Louchard, Wojciech Szpankowski: A probabilistic Analysis of a String Editing Problem and its Variations. Combinatorics, Probability & Computing 4: 143-166 (1995)
- [j11]Danièle Gardy, Guy Louchard: Dynamic Analysis of some Relational Databases Parameters. Theor. Comput. Sci. 144(1&2): 125-159 (1995)
- [j10]Guy Louchard, Wojciech Szpankowski: Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm. IEEE Transactions on Information Theory 41(2): 478-488 (1995)
- [c10]Guy Louchard, Wojciech Szpankowski: Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile. Data Compression Conference 1995: 262-271
- [c9]Guy Louchard: Finding the Maximum with Linear Error Probabilities: A Sequential Analysis Approach. STACS 1995: 14-25
- [c8]
- 1994
- [j9]
- 1993
- [c7]Guy Louchard, Wojciech Szpankowski: Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract). CPM 1993: 152-163
- [c6]
- 1992
- [j8]Guy Louchard, B. Randrianarimanana, René Schott: Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis. Theor. Comput. Sci. 93(2): 201-225 (1992)
- 1991
- [j7]Guy Louchard, René Schott: Probabilistic Analysis of Some Distributed Algorithms. Random Struct. Algorithms 2(2): 151-186 (1991)
- [c5]
- 1990
- [c4]Guy Louchard, René Schott: Probabilistic Analysis of Some Distributed Algorithms. CAAP 1990: 239-253
1980 – 1989
- 1989
- [c3]Guy Louchard, B. Randrianarimanana, René Schott: Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis. ICALP 1989: 521-533
- 1987
- [j6]Guy Louchard: Exact and Asymptotic Distributions in Digital and Binary Search Trees. ITA 21(4): 479-495 (1987)
- [j5]Guy Louchard: Random Walks, Gaussian Processes and List Structures. Theor. Comput. Sci. 53: 99-124 (1987)
- 1986
- [j4]
- [c2]
- 1983
- [j3]Guy Louchard: The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulation. ITA 17(4): 365-385 (1983)
1970 – 1979
- 1977
- [c1]Raymond R. Devillers, Guy Louchard: Using Auxiliary Variables in Parallel Programs Verification. International Computing Symposium 1977: 217-225
- 1976
- [j2]Raymond R. Devillers, Guy Louchard: Improvement of Parallelism in a Finite Buffer Sharing Policy. Comput. J. 19(3): 238-245 (1976)
- 1973
- [j1]Raymond R. Devillers, Guy Louchard: Realization of Petri Nets Without Conditional Statements. Inf. Process. Lett. 2(4): 105-107 (1973)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-15 21:58 CEST by the dblp team