Result 1 to 20 of 35 total
Asymptotics of multivariate sequences. III: Quadratic points. (English)
Adv. Math. 228, No. 6, 3127-3206 (2011).
1
Asymptotic expansions of oscillatory integrals with complex phase. (English)
Lladser, Manuel E. (ed.) et al., Algorithmic probability and combinatorics. AMS special sessions, Chicago, IL, USA, October 5‒6, 2007 and Vancouver, BC, Canada, October 4‒5, 2008. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4783-1/pbk). Contemporary Mathematics 520, 221-240 (2010).
2
Analytic combinatorics in $d$ variables: an overview. (English)
Lladser, Manuel E. (ed.) et al., Algorithmic probability and combinatorics. Papers from the AMS special sessions, Chicago, IL, USA, October 5‒6, 2007 and Vancouver, BC, Canada, October 4‒5, 2008. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4783-1/pbk). Contemporary Mathematics 520, 195-220 (2010).
3
Quantum random walk on the integer lattice: examples and phenomena. (English)
Lladser, Manuel E. (ed.) et al., Algorithmic probability and combinatorics. Papers from the AMS special sessions, Chicago, IL, USA, October 5‒6, 2007 and Vancouver, BC, Canada, October 4‒5, 2008. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4783-1/pbk). Contemporary Mathematics 520, 41-59 (2010).
4
Search cost for a nearly optimal path in a binary tree. (English)
Ann. Appl. Probab. 19, No. 4, 1273-1291 (2009).
5
Poisson matching. (English)
Ann. Inst. Henri Poincaré, Probab. Stat. 45, No. 1, 266-287 (2009).
6
Counting nondecreasing integer sequences that Lie below a barrier. (English)
Electron. J. Comb. 16, No. 1, Research Paper R60, 7 p. (2009).
7
Learning to signal: Analysis of a micro-level reinforcement model. (English)
Stochastic Processes Appl. 119, No. 2, 373-390 (2009).
8
Twenty combinatorial examples of asymptotics derived from multivariate generating functions. (English)
SIAM Rev. 50, No. 2, 199-272 (2008).
9
Running time predictions for factoring algorithms. (English)
van der Poorten, Alfred J. (ed.) et al., Algorithmic number theory. 8th international symposium, ANTS-VIII Banff, Canada, May 17‒22, 2008 Proceedings. Berlin: Springer (ISBN 978-3-540-79455-4/pbk). Lecture Notes in Computer Science 5011, 1-36 (2008).
10
Running time predictions for factoring algorithms (English)
ANTS, 1-36 (2008).
11
Quantum random walks in one dimension via generating functions. (English)
2007 Conference on analysis of algorithms, AofA 07. Papers from the 13th Conference held in Juan-les-Pins, France, June 17‒22, 2007. Nancy: The Association Discrete Mathematics \& Theoretical Science (DMTCS). 403-414, electronic only (2007).
12
When is $0.999\dots$ equal to 1. (English)
Am. Math. Mon. 114, No. 4, 344-350 (2007).
13
The klee-minty random edge chain moves with linear speed (English)
Random Struct. Algorithms 30, No. 4, 464-483 (2007).
14
Common intervals in permutations. (English)
Discrete Math. Theor. Comput. Sci. 8, No. 1, 189-216, electronic only (2006).
15
Common intervals in permutations (English)
Discrete Mathematics & Theoretical Computer Science 8, No. 1, 189-214 (2006).
16
Cycles in random $k$-ary maps and the poor performance of random number generation. (English)
J. Algorithms 54, No. 1, 72-84 (2005).
17
A probabilistic model for the degree of the cancellation polynomial in Gosper’s algorithm. (English)
J. Algorithms 54, No. 1, 58-71 (2005).
18
Asymptotics of multivariate sequences. II: Multiple points of the singular variety. (English)
Comb. Probab. Comput. 13, No. 4-5, 735-761 (2004).
19
Common intervals of permutations. (English)
Drmota, Michael (ed.) et al., Mathematics and computer science III. Algorithms, trees, combinatorics and probabilities. Proceedings of the international colloquium of mathematics and computer sciences, Vienna, September 13‒17, 2004. Basel: Birkhäuser (ISBN 3-7643-7128-5/hbk). Trends in Mathematics, 3-14 (2004).
20
Result 1 to 20 of 35 total
Start
Contact
Print
General Help
