default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Stauffer
Person information
- affiliation: University of Bath, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Alessandra Caraceni
, Alexandre Stauffer:
Growing uniform planar maps face by face. Random Struct. Algorithms 63(4): 942-967 (2023)- 2022
- [i16]Andrea Lelli, Alexandre Stauffer:
Mixing time of random walk on dynamical random cluster. CoRR abs/2209.03227 (2022)
2010 – 2019
- 2019
- [j6]Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. Comb. Probab. Comput. 28(3): 365-387 (2019) - [c12]Nicolás Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester:
The Dispersion Time of Random Walks on Finite Graphs. SPAA 2019: 103-113 - 2018
- [c11]Peter Gracar, Alexandre Stauffer:
Percolation of Lipschitz Surface and Tight Bounds on the Spread of Information Among Mobile Agents. APPROX-RANDOM 2018: 39:1-39:17 - [i15]Peter Gracar, Alexandre Stauffer:
Percolation of Lipschitz surface and tight bounds on the spread of information among mobile agents. CoRR abs/1806.01140 (2018) - [i14]Nicolas Rivera, Alexandre Stauffer, Thomas Sauerwald, John Sylvester:
The dispersion time of random walks on finite graphs. CoRR abs/1808.09219 (2018) - 2017
- [c10]Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. APPROX-RANDOM 2017: 34:1-34:21 - 2016
- [j5]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: Cover time and maximum load. Random Struct. Algorithms 48(4): 681-702 (2016) - [i13]Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings. CoRR abs/1611.03636 (2016) - 2015
- [i12]Alexandre Stauffer:
A Lyapunov function for Glauber dynamics on lattice triangulations. CoRR abs/1504.07980 (2015) - [i11]Pietro Caputo, Fabio Martinelli, Alistair Sinclair, Alexandre Stauffer:
Dynamics of Lattice Triangulations on Thin Rectangles. CoRR abs/1505.06161 (2015) - 2014
- [c9]George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer:
Randomized Rumor Spreading in Dynamic Graphs. ICALP (2) 2014: 495-507 - [c8]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. STACS 2014: 187-198 - 2013
- [j4]Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. Algorithmica 67(1): 65-88 (2013) - [j3]Jose H. Blanchet, Alexandre Stauffer:
Characterizing optimal sampling of binary contingency tables via the configuration model. Random Struct. Algorithms 42(2): 159-184 (2013) - [c7]Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into Bins via Local Search. SODA 2013: 16-34 - [c6]Petra Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre Stauffer:
Balls-into-bins with nearly optimal load distribution. SPAA 2013: 326-335 - [c5]Pietro Caputo, Fabio Martinelli, Alistair Sinclair, Alexandre Stauffer:
Random lattice triangulations: structure and algorithms. STOC 2013: 615-624 - [i10]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. CoRR abs/1310.0801 (2013) - [i9]Vladas Sidoravicius, Alexandre Stauffer:
Phase transition for finite-speed detection among moving particles. CoRR abs/1312.7862 (2013) - 2012
- [i8]Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into Bins via Local Search. CoRR abs/1207.2125 (2012) - 2011
- [b1]Alexandre Stauffer:
Structural and Algorithmic Properties of Static and Mobile Random Geometric Graphs. University of California, Berkeley, USA, 2011 - [c4]Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. ISAAC 2011: 190-199 - [c3]Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer:
Mobile Geometric Graphs: Detection, Coverage and Percolation. SODA 2011: 412-428 - [c2]Thomas Sauerwald, Alexandre Stauffer:
Rumor Spreading and Vertex Expansion on Regular Graphs. SODA 2011: 462-475 - 2010
- [c1]Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Efficient Broadcast on Random Geometric Graphs. SODA 2010: 1412-1421 - [i7]Alistair Sinclair, Alexandre Stauffer:
Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks. CoRR abs/1005.1117 (2010) - [i6]Jose H. Blanchet, Alexandre Stauffer:
Characterizing Optimal Sampling of Binary Contingency Tables via the Configuration Model. CoRR abs/1007.1214 (2010) - [i5]Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer:
Mobile Geometric Graphs: Detection, Coverage and Percolation. CoRR abs/1008.0075 (2010)
2000 – 2009
- 2007
- [j2]Alexandre O. Stauffer, Valmir Carneiro Barbosa:
Probabilistic heuristics for disseminating information in networks. IEEE/ACM Trans. Netw. 15(2): 425-435 (2007) - 2006
- [j1]Alexandre O. Stauffer, Valmir Carneiro Barbosa:
Local heuristics and the emergence of spanning subgraphs in complex networks. Theor. Comput. Sci. 355(1): 80-95 (2006) - 2005
- [i4]Alexandre O. Stauffer, Valmir Carneiro Barbosa:
A dissemination strategy for immunizing scale-free networks. CoRR abs/cs/0511080 (2005) - [i3]Alexandre O. Stauffer, Valmir Carneiro Barbosa:
A study of the edge-switching Markov-chain method for the generation of random graphs. CoRR abs/cs/0512105 (2005) - 2004
- [i2]Alexandre O. Stauffer, Valmir Carneiro Barbosa:
Probabilistic heuristics for disseminating information in networks. CoRR cs.NI/0409001 (2004) - [i1]Alexandre O. Stauffer, Valmir Carneiro Barbosa:
Local heuristics and the emergence of spanning subgraphs in complex networks. CoRR cs.NI/0411090 (2004)
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-06-10 21:22 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:
