Robin Pemantle

According to our database1, Robin Pemantle authored at least 30 papers between 1992 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Critical points at infinity for analytic combinatorics.
CoRR, 2019

Asymptotics of multivariate sequences in the presence of a lacuna.
CoRR, 2019

2018
Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability.
Proceedings of the Conference On Learning Theory, 2018

Diagonal Asymptotics for Symmetric Rational Functions via ACSV.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Multivariate CLT follows from strong Rayleigh property.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Four random permutations conjugated by an adversary generate <i>S</i><sub>n</sub> with high probability.
Random Struct. Algorithms, 2016

Double-dimers, the Ising model and the hexahedron recurrence.
J. Comb. Theory, Ser. A, 2016

2015
Corruption Detection on Networks.
CoRR, 2015

On the Longest $k$-Alternating Subsequence.
Electron. J. Comb., 2015

2014
Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures.
Comb. Probab. Comput., 2014

Four Random Permutations Conjugated by an Adversary Generate $S_n$ with High Probability.
CoRR, 2014

2009
Counting Nondecreasing Integer Sequences that Lie Below a Barrier.
Electron. J. Comb., 2009

2008
Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions.
SIAM Rev., 2008

Running Time Predictions for Factoring Algorithms.
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007
When Is 0.999... Equal to 1?
Am. Math. Mon., 2007

The Klee-Minty random edge chain moves with linear speed.
Random Struct. Algorithms, 2007

2006
Common intervals in permutations.
Discret. Math. Theor. Comput. Sci., 2006

Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005
Cycles in random k-ary maps and the poor performance of random number generation.
J. Algorithms, 2005

A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm.
J. Algorithms, 2005

2004
Network formation by reinforcement learning: the long and medium run.
Math. Soc. Sci., 2004

Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety.
Comb. Probab. Comput., 2004

Economic Properties of Social Networks.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

2002
Asymptotics of Multivariate Sequences: I. Smooth Points of the Singular Variety.
J. Comb. Theory, Ser. A, 2002

Generating a Random Sink-free Orientation in Quadratic Time.
Electron. J. Comb., 2002

2000
Sojourn Times of Brownian Sheet.
Period. Math. Hung., 2000

1999
On near-critical and dynamical percolation in the tree case.
Random Struct. Algorithms, 1999

Resistance Bounds for First-Passage Percolation and Maximum Flow.
J. Comb. Theory, Ser. A, 1999

1994
A Shuffle that Mixes Sets of Any Fixed Size Much Faster than It Mixes the Whole Deck.
Random Struct. Algorithms, 1994

1992
On Tensor Powers of Integer Programs.
SIAM J. Discret. Math., 1992


  Loading...