Output details
11 - Computer Science and Informatics
University of St Andrews
Return to search
Output 0 of 0 in the submission
Article title
Permutations Generated by Stacks and Deques
Type
D - Journal article
Title of journal
Annals of Combinatorics
Article number
-
Volume number
14
Issue number
1
First page of article
3
ISSN of journal
0218-0006
Year of publication
2010
URL
-
Number of additional authors
2
Additional information
<12>This paper reports the first substantial progress on a fundamental problem about basic data structures first raised by Knuth and Tarjan in 1972 – the number of permutations of n objects achievable using a deque, or using two stacks in parallel or series. Two entirely novel computational methods are used to obtain dramatically improved new upper and lower bounds on the growth of these numbers. For deques, and stacks in parallel, the bounds are quite close, narrowly constraining the growth rate
Interdisciplinary
Yes
Cross-referral requested
-
Research group
C - Artificial intelligence
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
