You are on page 1of 2

SAMPLE IN-TEXT APA MLA CMOS

QUOTATIONS CITATION:
OPERATIO
NS
“Researchers and students will NO AUTHOR According to SAGE Publications According to Statistics for People Who According to SAGE Publications.
appreciate the book′s unhurried pace and (2007). Statistics for People Who (Think They) Hate Statistics, Thousand Statistics for People Who (Think They)
thorough, friendly presentation.“ (Think They) Hate Statistics, Oaks: SAGE Publications p.29: Hate Statistics. (2007) p.29:
Thousand Oaks p.29: “Researchers “Researchers and students will “Researchers and students will
and students will appreciate the appreciate the book′s unhurried pace appreciate the book′s unhurried pace
book′s unhurried pace and and thorough, friendly presentation.“ and thorough, friendly presentation.“
thorough, friendly presentation.“
 ”The diversity of teaching institutions, ONE AUTHOR As stated by Bruter, C.P. (2002). As stated by Bruter, Claude P. As stated by Bruter, Claude P.
coupled with their internal diversity, Mathematics and Art:Mathematical Mathematics and Art:Mathematical Mathematics and Art:Mathematical
local customs and traditions, as well as Visualization in Art and Visualization in Art and Education. Visualization in Art and Education.
the diversity of their publics, lead us to Education.New York, NY:Springer- Springer-Verlag Berlin Heidelberg, New York, NY: Springer-Verlag Berlin
tread cautiously concerning various Verlag Berlin Heidelberg p.34: 2002. New York, NY p.34:  ”The Heidelberg, 2000 p.34:  ”The diversity
suggestions and recommendations.“ ”The diversity of teaching diversity of teaching institutions, of teaching institutions, coupled with
institutions, coupled with their coupled with their internal diversity, their internal diversity, local customs
internal diversity, local customs and local customs and traditions, as well as and traditions, as well as the diversity
traditions, as well as the diversity of the diversity of their publics, lead us to of their publics, lead us to tread
their publics, lead us to tread tread cautiously concerning various cautiously concerning various
cautiously concerning various suggestions and recommendations.“ suggestions and recommendations.“
suggestions and recommendations.“

“ We also prove a verification theorem 2 AUTHORS As presented by Gensbittel,F.& As presented by Gensbittel, Fabien & As presented by Gensbittel, Fabien &
for optimal stopping rules, which allows Grun, C. (2018). Mathematics of Grun, Christine. Mathematics of Grun, Christine. Mathematics of
to construct optimal stopping times. Operations Research:Zero-Sum Operations Research:Zero-Sum Operations Research:Zero-Sum
Finally we use our results to solve Stopping Games with Asymmetric Stopping Games with Asymmetric Stopping Games with Asymmetric
explicitly two generic examples.” Information.Catonsville, Information. Informs.org, 2018. Information. Catonsville, USA:
USA:Informs.org p.21: “ We also Catonsville, USA p.21: “ We also Informs.org, 2018 p.21: “ We also
prove a verification theorem for prove a verification theorem for prove a verification theorem for
optimal stopping rules, which optimal stopping rules, which allows optimal stopping rules, which allows to
allows to construct optimal to construct optimal stopping times. construct optimal stopping times.
stopping times. Finally we use our Finally we use our results to solve Finally we use our results to solve
results to solve explicitly two explicitly two generic examples.” explicitly two generic examples.”
generic examples.”
“We revisit lower bounds on the regret 3-5 AUTHORS According to Garivier, A. & According to Garivier, Aurélien, According to Garivier, Aurélien,
in the case of multiarmed bandit Ménard,P. & Stoltz, G. (2018). Ménard, Pierre & Stoltz, Gilles. Ménard, Pierre & Stoltz, Gilles.
problems. The proof techniques come Explore First, Exploit Next: The Explore First, Exploit Next: The True Explore First, Exploit Next: The True
to the essence of the information- True Shape of Regret in Bandit Shape of Regret in Bandit Problems. Shape of Regret in Bandit Problems.
theoretic arguments used and they Problems. Catonsville, USA: Informs.org, 2018. Catonsville, USA Catonsville, USA: Informs.org, 2018
involve no unnecessary complications.” Informs.org p.7: “We revisit lower p.7: “We revisit lower bounds on the p.7: “We revisit lower bounds on the
bounds on the regret in the case of regret in the case of multiarmed bandit regret in the case of multiarmed bandit
multiarmed bandit problems. The problems. The proof techniques come problems. The proof techniques come
proof techniques come to the to the essence of the information- to the essence of the information-
essence of the information-theoretic theoretic arguments used and they theoretic arguments used and they
arguments used and they involve no involve no unnecessary involve no unnecessary
unnecessary complications.” complications.” complications.”
“Addition is a binary operation.” 6 AUTHORS AND Del Rosario et al. (1985) stated According to Del Rosario et al., “Addition is a binary operation” ,
(sample only) that “Addition is a binary “Addition is a binary operation” as stated2by Del Rosario,
MORE operation.” (4). Evangelista, Ambalong, Malaza,
Digo, and Minon et al. 1985

2. Evangelista Del Rosario et al.,


Math I Modern Mathematics:
“Operations on Whole Numbers”
(Navotas, Metro Manila: Navotas
Press, 1985), p. 4

You might also like