Остановите войну!
for scientists:
default search action
Guy Louchard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j51]Matthew Drescher, Guy Louchard, Yvik Swan:
The Adaptive sampling revisited. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [i4]Guy Louchard, Yvik Swan:
The Adaptive sampling revisited. CoRR abs/1805.08043 (2018) - 2017
- [j50]Guy Louchard, Mark Daniel Ward:
Asymptotic Analysis of Sums of Powers of Multinomial Coefficients: A Saddle Point Approach. Integers 17: A47 (2017) - [i3]Guy Louchard:
A refined and asymptotic analysis of optimal stopping problems of Bruss and Weber. CoRR abs/1705.09482 (2017) - 2016
- [j49]F. Thomas Bruss, Guy Louchard:
Sequential selection of the k best out of nrankable objects. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - 2015
- [j48]Jeffrey Gaither, Guy Louchard, Stephan G. Wagner, Mark Daniel Ward:
Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics. Comb. Probab. Comput. 24(1): 195-215 (2015) - 2012
- [j47]Helmut Prodinger, Guy Louchard:
The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis. Discret. Math. Theor. Comput. Sci. 14(2): 91-128 (2012) - [j46]Guy Louchard, Helmut Prodinger, Mark Daniel Ward:
Number of survivors in the presence of a demon. Period. Math. Hung. 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
- [j45]Guy Louchard:
Asymptotics of the Stirling numbers of the first kind revisited: A saddle point approach. Discret. Math. Theor. Comput. Sci. 12(2): 167-184 (2010) - [j44]Guy Louchard, Helmut Prodinger:
Asymptotic results for silent elimination. Discret. Math. Theor. Comput. Sci. 12(2): 185-196 (2010)
2000 – 2009
- 2009
- [j43]F. Thomas Bruss, Guy Louchard, Mark Daniel Ward:
Inverse auctions: Injecting unique minima into random sets. ACM Trans. Algorithms 6(1): 21:1-21:19 (2009) - 2008
- [j42]Guy Louchard, Helmut Prodinger:
On gaps and unoccupied urns in sequences of geometrically distributed random variables. Discret. Math. 308(9): 1538-1562 (2008) - [j41]Svante Janson, Christian Lavault, Guy Louchard:
Convergence of Some Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j40]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
- [j39]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. Discret. Math. Theor. Comput. Sci. 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
- [j38]Guy Louchard, Helmut Prodinger:
Asymptotics of the Moments of Extreme-Value Related Distribution Functions. Algorithmica 46(3-4): 431-467 (2006) - [j37]Sylvie Corteel, Guy Louchard, Robin Pemantle:
Common intervals in permutations. Discret. Math. Theor. Comput. Sci. 8(1): 189-214 (2006) - [j36]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
- [j35]Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna:
The Guessing Secrets problem: a probabilistic approach. J. Algorithms 55(2): 142-176 (2005) - [j34]Guy Louchard:
Monotone runs of uniformly distributed integer random variables: A probabilistic analysis. Theor. Comput. Sci. 346(2-3): 358-387 (2005) - 2004
- [j33]Olivier Dubois, Guy Louchard, Jacques Mandler:
Additive Decompositions, Random Allocations, and Threshold Phenomena. Comb. Probab. Comput. 13(4-5): 537-575 (2004) - [j32]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer:
Boltzmann Samplers for the Random Generation of Combinatorial Structures. Comb. Probab. Comput. 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
- [j31]Guy Louchard, Helmut Prodinger:
Random 0-1 rectangular matrices: a probabilistic analysis. Period. Math. Hung. 47(1-2): 169-193 (2003) - [j30]Guy Louchard, John W. Turner:
Generalized covariances of multi-dimensional Brownian excursion local times. Theor. Comput. Sci. 297(1-3): 317-336 (2003) - [j29]Guy Louchard, Helmut Prodinger:
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. Theor. Comput. Sci. 304(1-3): 59-86 (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
- [j28]Guy Louchard, Helmut Prodinger:
Probabilistic Analysis of Carlitz Compositions. Discret. Math. Theor. Comput. Sci. 5(1): 71-96 (2002) - [j27]Philippe Chassaing, Guy Louchard:
Reflected Brownian Bridge area conditioned on its local time at the origin. J. Algorithms 44(1): 29-51 (2002) - [j26]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
- [j25]Philippe Flajolet, Guy Louchard:
Analytic Variations on the Airy Distribution. Algorithmica 31(3): 361-377 (2001) - [j24]Guy Louchard, Helmut Prodinger:
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. Electron. Notes Discret. Math. 10: 181-186 (2001) - [j23]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
- [j22]Guy Louchard:
Probabilistic analysis of column-convex and directed diagonally-convex animals. II: Trajectories and shapes. Random Struct. Algorithms 15(1): 1-23 (1999) - [j21]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) - [j20]Guy Louchard:
Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms. Theor. Comput. Sci. 218(2): 249-262 (1999) - 1998
- [j19]F. Thomas Bruss, Michael Drmota, Guy Louchard:
The Complete Solution of the Competitive Rank Selection Problem. Algorithmica 22(4): 413-447 (1998) - 1997
- [j18]Guy Louchard:
Probabilistic analysis of adaptative sampling. Random Struct. Algorithms 10(1-2): 157-168 (1997) - [j17]Guy Louchard:
Probabilistic analysis of column-convex and directed diagonally-convex animals. Random Struct. Algorithms 11(2): 151-178 (1997) - [j16]Guy Louchard, Claire Kenyon, René Schott:
Data Structures' Maxima. SIAM J. Comput. 26(4): 1006-1042 (1997) - [j15]Guy Louchard, Wojciech Szpankowski:
On the average redundancy rate of the Lempel-Ziv code. IEEE Trans. Inf. Theory 43(1): 2-8 (1997) - 1996
- [j14]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
- [j13]Guy Louchard, Wojciech Szpankowski:
A probabilistic Analysis of a String Editing Problem and its Variations. Comb. Probab. Comput. 4: 143-166 (1995) - [j12]Danièle Gardy, Guy Louchard:
Dynamic Analysis of some Relational Databases Parameters. Theor. Comput. Sci. 144(1&2): 125-159 (1995) - [j11]Guy Louchard, Wojciech Szpankowski:
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm. IEEE Trans. Inf. 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]Danièle Gardy, Guy Louchard:
Dynamic Analysis of the Sizes of Relations. STACS 1995: 433-444 - 1994
- [j10]Guy Louchard:
Trie Size in a Dynamic List Structure. Random Struct. Algorithms 5(5): 665-702 (1994) - 1993
- [c7]Guy Louchard, Wojciech Szpankowski:
Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract). CPM 1993: 152-163 - [c6]Guy Louchard:
Trie Size in a Dynamic List Structure. TAPSOFT 1993: 717-731 - 1992
- [j9]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
- [j8]Guy Louchard:
Robust variations of interpolation search: An asymptotic analysis. Computing 46(3): 193-222 (1991) - [j7]Guy Louchard, René Schott:
Probabilistic Analysis of Some Distributed Algorithms. Random Struct. Algorithms 2(2): 151-186 (1991) - [c5]Guy Louchard, Claire Kenyon, René Schott:
Data Structures Maxima. FCT 1991: 339-349 - 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. RAIRO Theor. Informatics Appl. 21(4): 479-495 (1987) - [j5]Guy Louchard:
Random Walks, Gaussian Processes and List Structures. Theor. Comput. Sci. 53: 99-124 (1987) - 1986
- [j4]Guy Louchard:
Brownian Motion and Algorithm Complexity. BIT 26(1): 17-34 (1986) - [c2]Guy Louchard:
Random Walks, Gaussian Processes, and List Structures. CAAP 1986: 211-224 - 1983
- [j3]Guy Louchard:
The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulation. RAIRO Theor. Informatics Appl. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-23 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint