2009 |
23 | EE | Laurent Alonso,
Edward M. Reingold:
Average-case analysis of some plurality algorithms.
ACM Transactions on Algorithms 5(2): (2009) |
2008 |
22 | EE | Laurent Alonso,
Edward M. Reingold:
Average-case lower bounds for the plurality problem.
ACM Transactions on Algorithms 4(3): (2008) |
21 | EE | Laurent Alonso,
Edward M. Reingold:
Determining plurality.
ACM Transactions on Algorithms 4(3): (2008) |
2005 |
20 | EE | Grégory Lecot,
Bruno Lévy,
Laurent Alonso,
Jean-Claude Paul:
Master-element vector irradiance for large tessellated models.
GRAPHITE 2005: 315-322 |
2004 |
19 | | Nicolas Holzschuch,
Laurent Alonso:
Combining Higher-Order Wavelets and Discontinuity meshing: A Compact Representation for Radiosity.
Rendering Techniques 2004: 275-286 |
18 | EE | Laurent Alonso,
Philippe Chassaing,
Florent Gillet,
Svante Janson,
Edward M. Reingold,
René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing 13(4-5): 419-449 (2004) |
17 | EE | Laurent Alonso,
Philippe Chassaing,
Edward M. Reingold,
René Schott:
The worst-case chip problem.
Inf. Process. Lett. 89(6): 303-308 (2004) |
2001 |
16 | EE | Laurent Alonso,
François Cuny,
Sylvain Petitjean,
Jean-Claude Paul,
Sylvain Lazard,
Eric Wies:
The virtual mesh: a geometric abstraction for efficiently computing radiosity.
ACM Trans. Graph. 20(3): 169-201 (2001) |
15 | EE | Laurent Alonso,
René Schott:
On the tree inclusion problem.
Acta Inf. 37(9): 653-670 (2001) |
2000 |
14 | EE | Xavier Cavin,
Laurent Alonso:
Parallel Management of Large Dynamic Shared Memory Space: A Hierarchical FEM Application.
IPDPS Workshops 2000: 428-434 |
13 | | Nicolas Holzschuch,
François Cuny,
Laurent Alonso:
Wavelet Radiosity on Arbitrary Planar Surfaces.
Rendering Techniques 2000: 161-172 |
12 | | François Cuny,
Laurent Alonso,
Nicolas Holzschuch:
A novel approach makes higher order wavelets really efficient for radiosity.
Comput. Graph. Forum 19(3): (2000) |
1997 |
11 | | Laurent Alonso,
Jean-Luc Remy,
René Schott:
A Linear-Time Algorithm for the Generation of Trees.
Algorithmica 17(2): 162-183 (1997) |
10 | EE | Laurent Alonso,
Jean-Luc Remy,
René Schott:
Uniform Generation of a Schröder Tree.
Inf. Process. Lett. 64(6): 305-308 (1997) |
9 | | Laurent Alonso,
Edward M. Reingold,
René Schott:
The Average-Case Complexity of Determining the Majority.
SIAM J. Comput. 26(1): 1-14 (1997) |
1996 |
8 | EE | Laurent Alonso,
Raphaë Cerf:
The three dimensional polyominoes of minimal area.
Electr. J. Comb. 3(1): (1996) |
7 | | Laurent Alonso,
Philippe Chassaing,
René Schott:
The average complexity of a coin-weighing problem.
Random Struct. Algorithms 9(1-2): 1-14 (1996) |
6 | EE | Laurent Alonso,
René Schott:
A Parallel Algorithm for the Generation of a Permutation and Applications.
Theor. Comput. Sci. 159(1): 15-28 (1996) |
1995 |
5 | | Laurent Alonso,
René Schott:
Random Generation of Colored Trees.
LATIN 1995: 16-35 |
4 | EE | Laurent Alonso,
Edward M. Reingold,
René Schott:
Multidimensional Divide-and-Conquer Maximin Recurrences.
SIAM J. Discrete Math. 8(3): 428-447 (1995) |
1994 |
3 | | Laurent Alonso:
Uniform Generation of a Motzkin Word.
Theor. Comput. Sci. 134(2): 529-536 (1994) |
1993 |
2 | | Laurent Alonso,
René Schott:
On the Tree Inclusion Problem.
MFCS 1993: 211-221 |
1 | | Laurent Alonso,
Edward M. Reingold,
René Schott:
Determining the Majority.
Inf. Process. Lett. 47(5): 253-255 (1993) |