Laurent Alonso

According to our database, Laurent Alonso authored at least 34 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Uniform random generations and rejection method(I) with binomial majorant.

Laurent Alonso

CoRR, 2023

2021

Restricted Power Diagrams on the GPU.

Justine Basselin, Laurent Alonso, Nicolas Ray, Dmitry Sokolov, Sylvain Lefebvre, Bruno Lévy

Comput. Graph. Forum, 2021

2013

Analysis of Boyer and Moore's MJRTY algorithm.

Laurent Alonso, Edward M. Reingold

Inf. Process. Lett., 2013

2011

Improved bounds for cops-and-robber pursuit.

Laurent Alonso, Edward M. Reingold

Comput. Geom., 2011

Computing 2D Periodic Centroidal Voronoi Tessellation.

Dong-Ming Yan, Kai Wang, Bruno Lévy, Laurent Alonso

Proceedings of the Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011

2010

Bounds for cops and robber pursuit.

Laurent Alonso, Edward M. Reingold

Comput. Geom., 2010

2009

Geometry-aware direction field processing.

Nicolas Ray, Bruno Vallet, Laurent Alonso, Bruno Lévy

ACM Trans. Graph., 2009

Average-case analysis of some plurality algorithms.

Laurent Alonso, Edward M. Reingold

ACM Trans. Algorithms, 2009

2008

Average-case lower bounds for the plurality problem.

Laurent Alonso, Edward M. Reingold

ACM Trans. Algorithms, 2008

Determining plurality.

Laurent Alonso, Edward M. Reingold

ACM Trans. Algorithms, 2008

2005

Master-element vector irradiance for large tessellated models.

Grégory Lecot, Bruno Lévy, Laurent Alonso, Jean-Claude Paul

Proceedings of the 3rd International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia 2005, Dunedin, New Zealand, November 29, 2005

2004

The worst-case chip problem.

Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott

Inf. Process. Lett., 2004

Quicksort with Unreliable Comparisons: A Probabilistic Analysis.

Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott

Comb. Probab. Comput., 2004

Combining Higher-Order Wavelets and Discontinuity meshing: A Compact Representation for Radiosity.

Nicolas Holzschuch, Laurent Alonso

Proceedings of the 15th Eurographics Workshop on Rendering Techniques, 2004

2001

The virtual mesh: a geometric abstraction for efficiently computing radiosity.

Laurent Alonso, François Cuny, Sylvain Petitjean, Jean-Claude Paul, Sylvain Lazard, Eric Wies

ACM Trans. Graph., 2001

On the tree inclusion problem.

Laurent Alonso, René Schott

Acta Informatica, 2001

2000

Partitioning and Scheduling Large Radiosity Computations in Parallel.

Xavier Cavin, Jean-Claude Paul, Laurent Alonso

Scalable Comput. Pract. Exp., 2000

Using Graphics Hardware to Speed Up Visibility Queries.

Laurent Alonso, Nicolas Holzschuch

J. Graphics, GPU, & Game Tools, 2000

A novel approach makes higher order wavelets really efficient for radiosity.

François Cuny, Laurent Alonso, Nicolas Holzschuch

Comput. Graph. Forum, 2000

Wavelet Radiosity on Arbitrary Planar Surfaces.

Nicolas Holzschuch, François Cuny, Laurent Alonso

Proceedings of the Eurographics Workshop on Rendering Techniques 2000, 2000

Parallel Management of Large Dynamic Shared Memory Space: A Hierarchical FEM Application.

Xavier Cavin, Laurent Alonso

Proceedings of the Parallel and Distributed Processing, 2000

1999

Overlapping multi-processing and graphics hardware acceleration: performance evaluation.

Xavier Cavin, Laurent Alonso, Jean-Claude Paul

Proceedings of the 1999 IEEE Symposium on Parallel Visualization and Graphics, 1999

1997

The Average-Case Complexity of Determining the Majority.

Laurent Alonso, Edward M. Reingold, René Schott

SIAM J. Comput., 1997

Uniform Generation of a Schröder Tree.

Laurent Alonso, Jean-Luc Rémy, René Schott

Inf. Process. Lett., 1997

A Linear-Time Algorithm for the Generation of Trees.

Laurent Alonso, Jean-Luc Rémy, René Schott

Algorithmica, 1997

1996

A Parallel Algorithm for the Generation of a Permutation and Applications.

Laurent Alonso, René Schott

Theor. Comput. Sci., 1996

The average complexity of a coin-weighing problem.

Laurent Alonso, Philippe Chassaing, René Schott

Random Struct. Algorithms, 1996

The three dimensional polyominoes of minimal area.

Laurent Alonso, Raphaël Cerf

Electron. J. Comb., 1996

1995

Multidimensional Divide-and-Conquer Maximin Recurrences.

Laurent Alonso, Edward M. Reingold, René Schott

SIAM J. Discret. Math., 1995

Random Generation of Colored Trees.

Laurent Alonso, René Schott

Proceedings of the LATIN '95: Theoretical Informatics, 1995

Random generation of trees - random generators in computer science.

Laurent Alonso, René Schott

Kluwer, ISBN: 978-0-7923-9528-7, 1995

1994

Uniform Generation of a Motzkin Word.

Laurent Alonso

Theor. Comput. Sci., 1994

1993

Determining the Majority.

Laurent Alonso, Edward M. Reingold, René Schott

Inf. Process. Lett., 1993

1992

"Lion and Man": Upper and Lower Bounds.

Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold

INFORMS J. Comput., 1992