We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-complete. Our proof applies to the perfect-information version where the bubble sequence is known in advance, and it uses just three bubble colors. “A girl runs up with somethin’ to prove. So don’t just stand there. Bust a move!” — Young MC [YDD89]

during recent decades publishing articles in academic journals has become a worldwide urge for all members of academia. there is, however, a widespread belief according to which more value is given to the articles published in internationally-recognized, high standard journals. an issue raised in this regard is whether the articles published in highly prestigious journals are remarkably differe...

the significance of research article (ra) abstract as a key academic genre has recently motivated analysts to focus on this neglected area. considering a summary function for abstracts, most genre researchers have adopted the conventionally proposed introduction- method- results- discussion (or conclusion) (imrd) model for analysis. however, the problems reported, especially for results and dis...

Vancomycin Solution for the Treatment of Severe Clostridium Defficile Infection Rania Saleh, MD; Sharon Sam, PharmD; Lisa Russell, MD; Paiboon Jungsuwadee, PhD; Diane Cluxton, PharmD Candidate; Alex Mersch, PharmD Candidate; Infectious Disease, Mount Sinai Hospital, Chicago, IL; Pharmacy, Roosevelt University College of Pharmacy, Schaumburg, IL; Pharmacy, Mount Sinai Hospital, Chicago, IL; Moun...

We consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan 13] and subsequent literature allowed for several competitiveness results of the move-to-front rule (MTF). We present an oo-line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be c-competitive ...

We consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan (1985) and subsequent literature allowed for several competitiveness results of the move-to-front rule (MTF). We present an o -line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be c-competiti...