Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,849,678 papers from all fields of science
Search
Sign In
Create Free Account
Pancake sorting
Known as:
Burnt pancake problem
, Pancake sort
Pancake sorting is the colloquial term for the mathematical problem of sorting a disordered stack of pancakes in order of size when a spatula can be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
DNA computing
Index of computing articles
List of NP-complete problems
List of algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An Experimental Investigation on the Pancake Problem
B. Bouzy
CGW/GIGA@IJCAI
2015
Corpus ID: 36460141
In this paper, we present an experimental investigation on the pancake problem. Also called sorting by prefix reversals (SBPR…
Expand
2015
2015
An algorithm for sorting pancake by restricted reversals
Jung-hyun Seo
,
Jong-Seok Kim
,
Hyeong-Ok Lee
Journal of Supercomputing
2015
Corpus ID: 255061322
In this paper, we propose an algorithm for sorting n pancakes. The previous studies were focused on finding upper bound or lower…
Expand
2012
2012
Characteristics of Magnets Depending on the Width of High Temperature Superconducting Tapes Applied to the Outer Pancake Windings
Myunghun Kang
,
Youngmin Kim
,
G. Cha
,
Kyoungho Paik
,
Heejoong Lee
IEEE transactions on applied superconductivity
2012
Corpus ID: 43067684
In a High Temperature Superconducting (HTS) magnet consisting of pancake windings, HTS tape with the same width has been used for…
Expand
2011
2011
Magnetic Field and Critical Current of a BSCCO HTS Magnet at Various Aspect Ratios
Myunghun Kang
,
Youngmin Kim
,
Heejoong Lee
,
G. Cha
,
K. Ryu
IEEE transactions on applied superconductivity
2011
Corpus ID: 24390231
When the length of wire used to make an HTS magnet is fixed, the magnetic properties of the HTS magnet including the central…
Expand
2011
2011
A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems
M. Keshtkaran
,
R. Taghizadeh
,
K. Ziarati
Symposium on Combinatorial Search
2011
Corpus ID: 10220912
In this paper we present a lossless technique to compress pattern databases (PDBs) in the Pancake Sorting problems. This…
Expand
2010
2010
Electrical Test of Bifilar-Wound Pancake Limiting Module Based on Multi-Stacked Coated Conductor for Application to a Power System
Seongeun Yang
,
D. Park
,
K. Chang
,
Young Jae Kim
,
J. Na
,
T. Ko
IEEE transactions on applied superconductivity
2010
Corpus ID: 10879234
Development of superconducting power equipments is closely related to that of superconducting wires. Recently, continuing from…
Expand
2010
2010
PERBANDINGAN WAKTU PROSES PENGURUTAN DATA DENGAN ALGORITMA PANCAKE SORT DAN ALGORITMA MSD RADIX SORT
Robert Aditya
2010
Corpus ID: 60785053
Pengurutan data secara umum dapat didefinisikan sebagai suatu proses untuk mengatur suatu kumpulan objek dalam urutan tertentu…
Expand
2009
2009
Average number of flips in pancake sorting
Josef Cibulka
arXiv.org
2009
Corpus ID: 45305663
2007
2007
On the complexity of the pancake problem
Fuxiang Yu
Mathematical Logic Quarterly
2007
Corpus ID: 11512784
We study the computational complexity of finding a line that bisects simultaneously two sets in the two‐dimensional plane, called…
Expand
2007
2007
On the Complexity of the Pancake Problem
YuFuxiang
2007
Corpus ID: 216002603
We study the computational complexity of finding a line that bisects simultaneously two sets in the two-dimensional plane, called…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE