Complete sets of transformations for general E-unification
- 作者Jean H. Gallier; Wayne Snyder
- 卷第67卷
- 印刷ISSN0304-3975
- 文件大小1833.58KB
- 发表时间1989
- DOI10.1016/0304-3975(89)90004-2
- 页码203-260
On Ramanujan's Q-functionPhilippe Flajolet; Peter J. Grabner; Peter Kirschenhofer; Helmut Prodinger · 1995
Mellin transforms and asymptotics: digital sumsPhilippe Flajolet; Peter Grabner; Peter Kirschenhofer; Helmut Prodinger; Robert F. Tichy · 1994
Return statistics of simple random walksPeter Kirschenhofer; Helmut Prodinger · 1996
Multidimensional digital searching—alternative data structuresPeter Kirschenhofer; Helmut Prodinger · 1994
Approximate counting : an alternative approachKirschenhofer, Peter; Prodinger, Helmut · RAIRO - Theoretical Informatics and Applications · 1991
Comparisons in Hoare's Find AlgorithmKIRSCHENHOFER, PETER; PRODINGER, HELMUT · Combinatorics, Probability and Computing · 1998
The path length of random skip listsPeter Kirschenhofer; Helmut Prodinger · 1994