27 papers:
LATA-2015-Restivo #research- The Shuffle Product: New Research Directions (AR), pp. 70–81.
- LATA-2015-SulzmannT
- Derivatives for Regular Shuffle Expressions (MS, PT), pp. 275–286.
CIAA-2014-BieglerM #automaton #finite #on the #word- On Comparing Deterministic Finite Automata and the Shuffle of Words (FB, IM), pp. 98–109.
ICALP-v1-2014-CzumajV #markov- Thorp Shuffling, Butterflies, and Non-Markovian Couplings (AC, BV), pp. 344–355.
- ICALP-v2-2014-OhrimenkoGTU #in the cloud
- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (OO, MTG, RT, EU), pp. 556–567.
- ICALP-v2-2013-CharlierKPZ #self #word
- Self-shuffling Words (EC, TK, SP, LQZ), pp. 113–124.
DLT-2012-FlickK #on the- On a Hierarchy of Languages with Catenation and Shuffle (NEF, MK), pp. 452–458.
- ICALP-v2-2012-GoodrichM #parallel
- Anonymous Card Shuffling and Its Applications to Parallel Mixnets (MTG, MM), pp. 549–560.
- LATA-2011-BerglundBH
- Recognizing Shuffled Languages (MB, HB, JH), pp. 142–154.
- LATA-2011-ReidenbachS #memory management #scheduling #word
- Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access (DR, MLS), pp. 465–476.
CASE-2010-HassanzadehMB #algorithm #mobile #optimisation- Mobile robot path planning based on shuffled frog leaping optimization algorithm (IH, KM, MAB), pp. 680–685.
- LATA-2009-Akama #commutative #learning
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory (YA), pp. 93–104.
- DLT-2006-DAlessandroRV #finite #order #set
- Well Quasi Orders and the Shuffle Closure of Finite Sets (FD, GR, SV), pp. 260–269.
VLDB-2005-PandeyROCC #random #ranking- Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results (SP, SR, CO, JC, SC), pp. 781–792.
STOC-2005-Morris- The mixing time of the Thorp shuffle (BM), pp. 403–412.
- DLT-2004-Domaratzki #semantics
- Semantic Shuffle on and Deletion Along Trajectories (MD), pp. 163–174.
- DLT-2001-CampeanuSV
- Shuffle Quotient and Decompositions (CC, KS, SV), pp. 186–196.
SAC-2000-DeifKSB- Optical Hierarchical Fully Shuffled Tree (SHD, OHK, SIS, AEMYB), pp. 667–676.
- DLT-1997-Kudlek
- Mix Operation with Catenation and Shuffle (MK), pp. 387–398.
- DLT-1997-TokudaYW #re-engineering
- Deterministic Reconstruction of Context-Free Derivations for a Sentence with Shuffled Terminal Symbols (TT, KY, YW), pp. 551–558.
HPCA-1996-ChenL #named- Shuffle-Ring: Overcoming the Increasing Degree of Hypercube (GC, FCML), pp. 130–138.
PLDI-1995-BurgerWD #lazy evaluation #using- Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling (RGB, OW, RKD), pp. 130–138.
- DLT-1995-Jedrzejowicz #decidability #problem
- An Undecidable Problem for Shuffle Languages (JJ), pp. 112–118.
- ICALP-1995-EsikB #axiom #equation
- Nonfinite Axiomatizability of the Equational Theory of Shuffle (ZÉ, MB), pp. 27–38.
DAC-1988-BhandariHS #problem #towards- The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement (ISB, MH, DPS), pp. 681–685.
- STOC-1983-Iwama #communication #multi #string
- Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication (KI), pp. 374–381.
- STOC-1981-KleitmanLLM #graph
- New Layouts for the Shuffle-Exchange Graph (Extended Abstract) (DJK, FTL, ML, GLM), pp. 278–292.
