Skip lists - some results on a recent data structure.
Kirschenhofer, Peter (1994)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Displaying similar documents to “A note on alternating sums.”
Skip lists - some results on a recent data structure.
Evaluations of -fold Euler/Zagier sums: a compendium of results for arbitrary .
Borwein, J.M., Bradley, D.M., Broadhurst, D.J. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Locally restricted compositions. III: Adjacent-part periodic inequalities.
Bender, Edward A., Canfield, E.Rodney (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting defective parking functions.
Cameron, Peter J., Johannsen, Daniel, Prellberg, Thomas, Schweitzer, Pascal (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Asymptotics of the average height of 2-watermelons with a wall.
Fulmek, Markus (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Experimental determination of Apéry-like identities for .
Bailey, David H., Borwein, Jonathan M., Bradley, David M. (2006)
Experimental Mathematics
Similarity:
Generalized reciprocity laws for sums of harmonic numbers.
Kuba, Markus, Prodinger, Helmut, Schneider, Carsten (2008)
Integers
Similarity:
Airy phenomena and analytic combinatorics of connected graphs.
Flajolet, Philippe, Salvy, Bruno, Schaeffer, Gilles (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics.
Flajolet, Philippe, Fusy, Eric, Gourdon, Xavier, Panario, Daniel, Pouyanne, Nicolas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Integer powers of arcsin.
Borwein, Jonathan M., Chamberland, Marc (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The visibility parameter for words and permutations
Ligia Cristea, Helmut Prodinger (2013)
Open Mathematics
Similarity:
We investigate the visibility parameter, i.e., the number of visible pairs, first for words over a finite alphabet, then for permutations of the finite set {1, 2, …, n}, and finally for words over an infinite alphabet whose letters occur with geometric probabilities. The results obtained for permutations correct the formula for the expectation obtained in a recent paper by Gutin et al. [Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics...
Combinatorial aspects of multiple zeta values.
Borwein, Jonathan M., Bradley, David M., Broadhurst, David J., Lisoněk, Petr (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity: