BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
languag (4)
word (3)
problem (2)
finit (2)
optim (2)

Stem shuffl$ (all stems)

27 papers:

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

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.