| 2013 | ||
|---|---|---|
| j24 | Laurent Alonso, Edward M. Reingold: Analysis of Boyer and Moore's MJRTY algorithm. Inf. Process. Lett. 113(13): 495-497 (2013) | |
| 2011 | ||
| j23 | Laurent Alonso, Edward M. Reingold: Improved bounds for cops-and-robber pursuit. Comput. Geom. 44(8): 365-369 (2011) | |
| c7 | Dong-Ming Yan, Kai Wang, Bruno Lévy, Laurent Alonso: Computing 2D Periodic Centroidal Voronoi Tessellation. ISVD 2011: 177-184 | |
| 2010 | ||
| j22 | Laurent Alonso, Edward M. Reingold: Bounds for cops and robber pursuit. Comput. Geom. 43(9): 749-766 (2010) | |
| 2009 | ||
| j21 | Laurent Alonso, Edward M. Reingold: Average-case analysis of some plurality algorithms. ACM Transactions on Algorithms 5(2) (2009) | |
| j20 | Nicolas Ray, Bruno Vallet, Laurent Alonso, Bruno Lévy: Geometry-aware direction field processing. ACM Trans. Graph. 29(1) (2009) | |
| 2008 | ||
| j19 | Laurent Alonso, Edward M. Reingold: Determining plurality. ACM Transactions on Algorithms 4(3) (2008) | |
| j18 | Laurent Alonso, Edward M. Reingold: Average-case lower bounds for the plurality problem. ACM Transactions on Algorithms 4(3) (2008) | |
| 2005 | ||
| c6 | Grégory Lecot, Bruno Lévy, Laurent Alonso, Jean-Claude Paul: Master-element vector irradiance for large tessellated models. GRAPHITE 2005: 315-322 | |
| 2004 | ||
| j17 | 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) | |
| j16 | Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott: The worst-case chip problem. Inf. Process. Lett. 89(6): 303-308 (2004) | |
| c5 | Nicolas Holzschuch, Laurent Alonso: Combining Higher-Order Wavelets and Discontinuity meshing: A Compact Representation for Radiosity. Rendering Techniques 2004: 275-286 | |
| 2001 | ||
| j15 | ||
| j14 | 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) | |
| 2000 | ||
| j13 | François Cuny, Laurent Alonso, Nicolas Holzschuch: A novel approach makes higher order wavelets really efficient for radiosity. Comput. Graph. Forum 19(3): 99-108 (2000) | |
| j12 | Laurent Alonso, Nicolas Holzschuch: Using Graphics Hardware to Speed Up Visibility Queries. J. Graphics, GPU, & Game Tools 5(2): 33-47 (2000) | |
| j11 | Xavier Cavin, Jean-Claude Paul, Laurent Alonso: Partitioning and Scheduling Large Radiosity Computations in Parallel. Scalable Computing: Practice and Experience 3(3) (2000) | |
| c4 | Xavier Cavin, Laurent Alonso: Parallel Management of Large Dynamic Shared Memory Space: A Hierarchical FEM Application. IPDPS Workshops 2000: 428-434 | |
| c3 | Nicolas Holzschuch, François Cuny, Laurent Alonso: Wavelet Radiosity on Arbitrary Planar Surfaces. Rendering Techniques 2000: 161-172 | |
| 1997 | ||
| j10 | Laurent Alonso, Jean-Luc Remy, René Schott: A Linear-Time Algorithm for the Generation of Trees. Algorithmica 17(2): 162-183 (1997) | |
| j9 | Laurent Alonso, Jean-Luc Remy, René Schott: Uniform Generation of a Schröder Tree. Inf. Process. Lett. 64(6): 305-308 (1997) | |
| j8 | Laurent Alonso, Edward M. Reingold, René Schott: The Average-Case Complexity of Determining the Majority. SIAM J. Comput. 26(1): 1-14 (1997) | |
| 1996 | ||
| j7 | Laurent Alonso, Raphaël Cerf: The three dimensional polyominoes of minimal area. Electr. J. Comb. 3(1) (1996) | |
| j6 | Laurent Alonso, Philippe Chassaing, René Schott: The average complexity of a coin-weighing problem. Random Struct. Algorithms 9(1-2): 1-14 (1996) | |
| j5 | Laurent Alonso, René Schott: A Parallel Algorithm for the Generation of a Permutation and Applications. Theor. Comput. Sci. 159(1): 15-28 (1996) | |
| 1995 | ||
| b1 | Laurent Alonso, René Schott: Random generation of trees - random generators in computer science. Kluwer 1995, isbn 978-0-7923-9528-7, pp. I-XI, 1-208 | |
| j4 | Laurent Alonso, Edward M. Reingold, René Schott: Multidimensional Divide-and-Conquer Maximin Recurrences. SIAM J. Discrete Math. 8(3): 428-447 (1995) | |
| c2 | ||
| 1994 | ||
| j3 | ||
| 1993 | ||
| j2 | Laurent Alonso, Edward M. Reingold, René Schott: Determining the Majority. Inf. Process. Lett. 47(5): 253-255 (1993) | |
| c1 | ||
| 1992 | ||
| j1 | Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold: "Lion and Man": Upper and Lower Bounds. INFORMS Journal on Computing 4(4): 447-452 (1992) | |
Data released under the ODC-BY 1.0 license — See also our legal information page