According to our database1, Laurent Alonso authored at least 32 papers between 1992 and 2013.
Legend:Book In proceedings Article PhD thesis Other
Analysis of Boyer and Moore's MJRTY algorithm.
Inf. Process. Lett., 2013
Improved bounds for cops-and-robber pursuit.
Comput. Geom., 2011
Computing 2D Periodic Centroidal Voronoi Tessellation.
Proceedings of the Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011
Bounds for cops and robber pursuit.
Comput. Geom., 2010
Geometry-aware direction field processing.
ACM Trans. Graph., 2009
Average-case analysis of some plurality algorithms.
ACM Trans. Algorithms, 2009
Average-case lower bounds for the plurality problem.
ACM Trans. Algorithms, 2008
ACM Trans. Algorithms, 2008
Master-element vector irradiance for large tessellated models.
Proceedings of the 3rd International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia 2005, Dunedin, New Zealand, November 29, 2005
The worst-case chip problem.
Inf. Process. Lett., 2004
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing, 2004
Combining Higher-Order Wavelets and Discontinuity meshing: A Compact Representation for Radiosity.
Proceedings of the 15th Eurographics Workshop on Rendering Techniques, 2004
The virtual mesh: a geometric abstraction for efficiently computing radiosity.
ACM Trans. Graph., 2001
On the tree inclusion problem.
Acta Inf., 2001
Partitioning and Scheduling Large Radiosity Computations in Parallel.
Scalable Computing: Practice and Experience, 2000
Using Graphics Hardware to Speed Up Visibility Queries.
J. Graphics, GPU, & Game Tools, 2000
A novel approach makes higher order wavelets really efficient for radiosity.
Comput. Graph. Forum, 2000
Wavelet Radiosity on Arbitrary Planar Surfaces.
Proceedings of the Eurographics Workshop on Rendering Techniques 2000, 2000
Parallel Management of Large Dynamic Shared Memory Space: A Hierarchical FEM Application.
Proceedings of the Parallel and Distributed Processing, 2000
The Average-Case Complexity of Determining the Majority.
SIAM J. Comput., 1997
Uniform Generation of a Schröder Tree.
Inf. Process. Lett., 1997
A Linear-Time Algorithm for the Generation of Trees.
A Parallel Algorithm for the Generation of a Permutation and Applications.
Theor. Comput. Sci., 1996
The average complexity of a coin-weighing problem.
Random Struct. Algorithms, 1996
The three dimensional polyominoes of minimal area.
Electr. J. Comb., 1996
Multidimensional Divide-and-Conquer Maximin Recurrences.
SIAM J. Discrete Math., 1995
Random Generation of Colored Trees.
Proceedings of the LATIN '95: Theoretical Informatics, 1995
Random generation of trees - random generators in computer science.
Kluwer, ISBN: 978-0-7923-9528-7, 1995
Uniform Generation of a Motzkin Word.
Theor. Comput. Sci., 1994
Determining the Majority.
Inf. Process. Lett., 1993
On the Tree Inclusion Problem.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993
"Lion and Man": Upper and Lower Bounds.
INFORMS Journal on Computing, 1992