A constant-time algorithm for middle levels Gray codes
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12516
- Type
- D - Journal article
- DOI
-
10.1007/s00453-019-00640-2
- Title of journal
- Algorithmica
- Article number
- -
- First page
- 1239
- Volume
- 82
- Issue
- -
- ISSN
- 0178-4617
- Open access status
- Deposit exception
- Month of publication
- May
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper appeared in a top algorithms journal, with an extended abstract at SODA'17, the top algorithms conference. It attracted attention from several leading researchers, including Zeilberger (Rutgers): "This was a major tour-de-force." Moreover, Knuth (Stanford), author of "The Art of Computer Programming" wrote: "Congratulations on a wonderful achievement!" The paper also supported several successful national research grant applications, totaling £400k in funding. In addition, the developed techniques enabled several other algorithmic breakthroughs (STOC'18, ICALP'18, ICALP'20, SODA'21). This algorithm improves previously known algorithms by several orders of magnitude, and has been made publicly available on the Combinatorial Object Server (http://combos.org/middle).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -