Andrea Sportiello

Orcid: 0000-0002-6502-3954

According to our database1, Andrea Sportiello authored at least 17 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Natural Measures on Polyominoes Induced by the Abelian Sandpile Model.
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024

2021
Boltzmann sampling of irreducible context-free structures in linear time.
CoRR, 2021

2020
The p-Airy distribution.
CoRR, 2020

The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings.
Proceedings of the 31st International Conference on Probabilistic, 2020

2018
Linear-time exact sampling of sum-constrained random variables.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

The complexity of the Multiple Pattern Matching Problem for random strings.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2016
Complexity of Anticipated Rejection Algorithms and the Darling-Mandelbrot Distribution.
Algorithmica, 2016

2015
Linear-time generation of inhomogeneous random directed walks.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014
A one-parameter refinement of the Razumov-Stroganov correspondence.
J. Comb. Theory A, 2014

2013
Linear-time generation of specifiable combinatorial structures: general theory and first examples.
CoRR, 2013

Algebraic/combinatorial proofs of Cayley-type identities for derivatives of determinants and pfaffians.
Adv. Appl. Math., 2013

2012
Asymptotic enumeration of Minimal Automata.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011
Proof of the Razumov-Stroganov conjecture.
J. Comb. Theory A, 2011

2009
Noncommutative determinants, Cauchy-Binet formulae, and Capelli-type identities I. Generalizations of the Capelli and Turnbull identities.
Electron. J. Comb., 2009

2008
A randomized polynomial-time algorithm for the Spanning Hypertree Problem on 3-uniform hypergraphs
CoRR, 2008

2007
A Hike in the Phases of the 1-in-3 Satisfiability
CoRR, 2007

2006
One-in-Two-Matching Problem is NP-complete
CoRR, 2006


  Loading...