Theoretical Computer Science - Algorithms,automata, complexity and games
An asymptotic theory for recurrence relations based on minimization and maximization
Theoretical Computer Science
Greedy sums of distinct squares
Mathematics of Computation
On the Number of Optimal Base 2 Representations of Integers
Designs, Codes and Cryptography
The enumeration of prudent polygons by area and its unusual asymptotics
Journal of Combinatorial Theory Series A
Some New Self-avoiding Walk and Polygon Models
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
| Hi-index | 5.23 |