skip to main content
column
Free Access

Solving Rubik's Cube: disk is the new RAM

Published:01 April 2008Publication History
Skip Abstract Section

Abstract

Substituting disk for RAM, disk-based computation is a way to increase working memory and achieve results that are not otherwise economical.

References

  1. Kunkle, D. and Cooperman, G. Twenty-six moves suffice for Rubik's Cube. In Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation (Waterloo, Ontario, Canada, July 29--Aug. 1). ACM Press, New York, 2007, 235--242. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Robinson, R., Kunkle, D., and Cooperman, G. A comparative analysis of parallel disk-based methods for enumerating implicit graphs. In Proceedings of the 2007 International Workshop on Parallel Symbolic Computation (London, Ontario, Canada, July 27--28). ACM Press, New York, 2007, 78--87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Vitter, J. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys 33, 2 (June 2001), 209--271. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Solving Rubik's Cube: disk is the new RAM

                    Recommendations

                    Comments

                    Login options

                    Check if you have access through your login credentials or your institution to get full access on this article.

                    Sign in

                    Full Access

                    • Published in

                      cover image Communications of the ACM
                      Communications of the ACM  Volume 51, Issue 4
                      The psychology of security: why do good users make bad decisions?
                      April 2008
                      94 pages
                      ISSN:0001-0782
                      EISSN:1557-7317
                      DOI:10.1145/1330311
                      Issue’s Table of Contents

                      Copyright © 2008 ACM

                      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                      Publisher

                      Association for Computing Machinery

                      New York, NY, United States

                      Publication History

                      • Published: 1 April 2008

                      Permissions

                      Request permissions about this article.

                      Request Permissions

                      Check for updates

                      Qualifiers

                      • column
                      • Popular
                      • Pre-selected

                    PDF Format

                    View or Download as a PDF file.

                    PDF

                    eReader

                    View online with eReader.

                    eReader

                    HTML Format

                    View this article in HTML Format .

                    View HTML Format