default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Alonso
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Laurent Alonso:
Uniform random generations and rejection method(I) with binomial majorant. CoRR abs/2303.09338 (2023)- 2021
- [j25]Justine Basselin
, Laurent Alonso, Nicolas Ray, Dmitry Sokolov, Sylvain Lefebvre, Bruno Lévy:
Restricted Power Diagrams on the GPU. Comput. Graph. Forum 40(2): 1-12 (2021)
2010 – 2019
- 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) - [c8]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)
2000 – 2009
- 2009
- [j21]Laurent Alonso, Edward M. Reingold:
Average-case analysis of some plurality algorithms. ACM Trans. Algorithms 5(2): 17:1-17:36 (2009) - [j20]Nicolas Ray, Bruno Vallet, Laurent Alonso, Bruno Lévy:
Geometry-aware direction field processing. ACM Trans. Graph. 29(1): 1:1-1:11 (2009) - 2008
- [j19]Laurent Alonso, Edward M. Reingold:
Determining plurality. ACM Trans. Algorithms 4(3): 26:1-26:19 (2008) - [j18]Laurent Alonso, Edward M. Reingold:
Average-case lower bounds for the plurality problem. ACM Trans. Algorithms 4(3): 27:1-27:17 (2008) - 2005
- [c7]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. Comb. Probab. Comput. 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) - [c6]Nicolas Holzschuch, Laurent Alonso:
Combining Higher-Order Wavelets and Discontinuity meshing: A Compact Representation for Radiosity. Rendering Techniques 2004: 275-286 - 2001
- [j15]Laurent Alonso, René Schott:
On the tree inclusion problem. Acta Informatica 37(9): 653-670 (2001) - [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. Parallel Distributed Comput. Pract. 3(3) (2000) - [c5]Xavier Cavin, Laurent Alonso:
Parallel Management of Large Dynamic Shared Memory Space: A Hierarchical FEM Application. IPDPS Workshops 2000: 428-434 - [c4]Nicolas Holzschuch, François Cuny, Laurent Alonso:
Wavelet Radiosity on Arbitrary Planar Surfaces. Rendering Techniques 2000: 161-172
1990 – 1999
- 1999
- [c3]Xavier Cavin, Laurent Alonso, Jean-Claude Paul:
Overlapping multi-processing and graphics hardware acceleration: performance evaluation. PVGS 1999: 79-88 - 1997
- [j10]Laurent Alonso, Jean-Luc Rémy, René Schott:
A Linear-Time Algorithm for the Generation of Trees. Algorithmica 17(2): 162-183 (1997) - [j9]Laurent Alonso, Jean-Luc Rémy, 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. Electron. 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. Discret. Math. 8(3): 428-447 (1995) - [c2]Laurent Alonso, René Schott:
Random Generation of Colored Trees. LATIN 1995: 16-35 - 1994
- [j3]Laurent Alonso:
Uniform Generation of a Motzkin Word. Theor. Comput. Sci. 134(2): 529-536 (1994) - 1993
- [j2]Laurent Alonso, Edward M. Reingold, René Schott:
Determining the Majority. Inf. Process. Lett. 47(5): 253-255 (1993) - [c1]Laurent Alonso, René Schott:
On the Tree Inclusion Problem. MFCS 1993: 211-221 - 1992
- [j1]Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold:
"Lion and Man": Upper and Lower Bounds. INFORMS J. Comput. 4(4): 447-452 (1992)
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 2024-07-02 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
