Literature list of implemented data structures in SDSL
(not complete yet)

// used in include/sdsl/hybrid_bitvector.hpp
@inproceedings{KAR:KEM:PUG:2014,
  title={Hybrid Compression of Bitvectors for the FM-Index},
  author={K{\"a}rkk{\"a}inen, Juha and Kempa, Dominik and Puglisi, Simon J},
  booktitle={Proceedings of the Data Compression Conference (DCC 2014)},
  pages={302--311},
  year={2014}
}

// used in include/sdsl/csa_sampling_strategy.hpp 
@inproceedings{GOG:NAV:2014,
author    = {S. Gog and G. Navarro},
title     = {Improved and Extended Locating Functionality on Compressed Suffix Arrays},
booktitle = {Proceedings of 13th International Symposium on Experimental Algorithms (SEA 2014)},
year      = {2014},
pages    = {436--447}
}

// used in include/sdsl/k2_treap.hpp
@INPROCEEDINGS{BRI:BER:KON:NAV:2014,
author    = {N. Brisaboa and G. de Bernardo and R. Konow and G. Navarro},
title     = {$K^2$-Treaps: Range Top-$k$ Queries in Compact Space},
booktitle = {Proceedings of String Processing and Information Retrieval, 21th International
             Symposium (SPIRE 2014)},
year      = {2014},
pages     = {215--226}
}

// used in include/sdsl/construct_sa.hpp
@inproceedings{BEL:ZWE:GOG:OHL:2013,
author    = {Timo Beller and Maike Zwerger and Simon Gog and Enno Ohlebusch},
title     = {Space-Efficient Construction of the Burrows-Wheeler Transform},
booktitle = {Proceedings of String Processing and Information Retrieval, 20th International
             Symposium, (SPIRE 2013)},
year      = {2013},
pages     = {5-16},
ee        = {http://dx.doi.org/10.1007/978-3-319-02432-5_5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/wt_gmr.hpp
@inproceedings{GOL:MUN:RAO:2006,
author    = {Alexander Golynski and J. Ian Munro and S. Srinivasa Rao},
title     = {Rank/select operations on large alphabets: a tool for text
             indexing},
booktitle = {Proceedings of the 17th Annual ACM-SIAM Symposium
             on Discrete Algorithms (SODA 2006)},
year      = {2006},
pages     = {368-373},
ee        = {http://dl.acm.org/citation.cfm?id=1109557.1109599},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/wm_int.hpp
@inproceedings{CLA:NAV:2012,
author    = {Francisco Claude and Gonzalo Navarro},
title     = {The Wavelet Matrix},
booktitle = {Proceedings of String Processing and Information Retrieval, 19th 
             International Symposium, (SPIRE 2012)},
year      = {2012},
pages     = {167-179},
ee        = {http://dx.doi.org/10.1007/978-3-642-34109-0_18},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/inv_perm_support.hpp
// used in include/sdsl/wt_gmr.hpp
@inproceedings{MUN:RAM:RAM:RAO:2003,
  author    = {J. Ian Munro and Rajeev Raman and Venkatesh Raman and S. Srinivasa Rao},
  title     = {Succinct Representations of Permutations},
  booktitle = {Proceedings of the 30th International Colloquium on Automata, Languages
               and Programming (ICALP2003)},
  year      = {2003},
  pages     = {345-356}
}

// used in include/sdsl/wt_int.hpp
@article{GAG:NAV:PUG:2012,
author    = {Travis Gagie and Gonzalo Navarro and Simon J. Puglisi},
title     = {New algorithms on wavelet trees and applications to information retrieval},
journal   = {Theoretical Computer Science},
volume    = {426},
year      = {2012},
pages     = {25-41},
ee        = {http://dx.doi.org/10.1016/j.tcs.2011.12.002},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/algorithms_for_compressed_suffix_trees.hpp
@inproceedings{FIS:2010,
author    = {Johannes Fischer},
title     = {Optimal Succinctness for Range Minimum Queries},
booktitle = {Proceedings of the 9th Latin American Symposium
             on Theoretical Informatics (LATIN 2010)},
year      = {2010},
pages     = {158-169},
ee        = {http://dx.doi.org/10.1007/978-3-642-12200-2_16},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/wt_int.hpp
@inproceedings{CUL:NAV:PUG:TUR:2010,
author    = {J. Shane Culpepper and Gonzalo Navarro and Simon J. Puglisi and Andrew Turpin},
title     = {Top-{\it k} Ranked Document Search in General Text Databases},
booktitle = {Proceedings Part II of the 18th Annual European Symposium on Algorithms (ESA 2010)},
year      = {2010},
pages     = {194-205},
ee        = {http://dx.doi.org/10.1007/978-3-642-15781-3_17},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/construct_lcp.hpp
@inproceedings{KAR:MAN:PUG:2009,
author    = {Juha K{\"a}rkk{\"a}inen and Giovanni Manzini and Simon J. Puglisi},
title     = {Permuted Longest-Common-Prefix Array},
booktitle = {Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching,
             (CPM 2009)},
year      = {2009},
pages     = {181-192},
ee        = {http://dx.doi.org/10.1007/978-3-642-02441-2_17},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/construct_lcp.hpp
@inproceedings{KAS:LEE:ARI:ARI:PAR:2001,
author    = {Toru Kasai and Gunho Lee and Hiroki Arimura and Setsuo Arikawa and Kunsoo Park},
title     = {Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications},
booktitle = {Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching,
             (CPM 2001)},
year      = {2001},
pages     = {181-192},
ee        = {http://link.springer.de/link/service/series/0558/bibs/2089/20890181.htm},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/construct_lcp.hpp
@inproceedings{GOG:OHL:2011,
author    = {Simon Gog and Enno Ohlebusch},
title     = {Fast and Lightweight LCP-Array Construction Algorithms},
booktitle = {Proceedings of the 13th Workshop on Algorithm Engineering and Experiments,
             (ALENEX 2011)},
year      = {2011},
pages     = {25-34},
ee        = {http://www.siam.org/proceedings/alenex/2011/alx11_03_gogs.pdf},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/construct_lcp.hpp
@article{GOG:OHL:2010,
author    = {Simon Gog and Enno Ohlebusch},
title     = {Lightweight LCP-Array Construction in Linear Time},
journal   = {CoRR},
volume    = {abs/1012.4263},
year      = {2010},
ee        = {http://arxiv.org/abs/1012.4263},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/construct_lcp.hpp
@inproceedings{BEL:GOG:OHL:SCH:2011,
author    = {Timo Beller and Simon Gog and Enno Ohlebusch and Thomas Schnattinger},
title     = {Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform},
booktitle = {Proceedings of String Processing and Information Retrieval, 18th International
             Symposium, (SPIRE 2011)},
year      = {2011},
pages     = {197-208},
ee        = {http://dx.doi.org/10.1007/978-3-642-24583-1_20},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/construct_lcp.hpp
@article{BEL:GOG:OHL:SCH:2013,
author     = {Timo Beller and Simon Gog and Enno Ohlebusch and Thomas Schnattinger},
title      = {Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform},
journal    = {Journal of Discrete Algorithms},
issue_date = {January, 2013},
volume     = {18},
number     = {0},
month      = {January},
year       = {2013},
issn       = {1570-8667},
pages      = {22-31},
numpages   = {10},
url        = {http://dx.doi.org/10.1016/j.jda.2012.07.007},
doi        = {10.1016/j.jda.2012.07.007},
acmid      = {2428912},
publisher  = {Elsevier Science Publishers B. V.},
address    = {Amsterdam, The Netherlands, The Netherlands},
}

// used in include/sdsl/rrr_vector.hpp
@inproceedings{RAM:RAM:RAO:2002,
author    = {Rajeev Raman and Venkatesh Raman and S. Srinivasa Rao},
title     = {Succinct indexable dictionaries with applications to encoding k-ary trees and multisets},
booktitle = {Proceedings of the 13th Annual ACM-SIAM Symposium
             on Discrete Algorithms (SODA 2002)},
year      = {2002},
pages     = {233-242},
ee        = {http://dl.acm.org/citation.cfm?id=545381.545411},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/csa_sampling_strategy.hpp
@inproceedings{FER:SIR:VEN:2011,
author    = {Paolo Ferragina and Jouni Sir{\'e}n and Rossano Venturini},
title     = {Distribution-Aware Compressed Full-Text Indexes},
booktitle = {Proceedings of the 19th Annual European Symposium on Algorithms (ESA 2011)},
year      = {2011},
pages     = {760-771},
ee        = {http://dx.doi.org/10.1007/978-3-642-23719-5_64},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/rmq_support_sparse_table.hpp
@inproceedings{BEN:FAR:2000,
author    = {Michael A. Bender and Martin Farach-Colton},
title     = {The LCA Problem Revisited},
booktitle = {Proceedings of the 4th Latin American Symposium
             on Theoretical Informatics (LATIN 2000)},
year      = {2000},
pages     = {88-94},
ee        = {http://dx.doi.org/10.1007/10719839_9},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/bp_support_gg.hpp
@article{GEA:RAH:RAM:RAM:2006,
author    = {Richard F. Geary and Naila Rahman and Rajeev Raman and Venkatesh Raman},
title     = {A simple optimal representation for balanced parentheses},
journal   = {Theoretical Computer Science},
volume    = {368},
number    = {3},
year      = {2006},
pages     = {231-246},
ee        = {http://dx.doi.org/10.1016/j.tcs.2006.09.014},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/rank_support_v.hpp
@inproceedings{VIG:2008,
author    = {Sebastiano Vigna},
title     = {Broadword Implementation of Rank/Select Queries},
booktitle = {Proceedings of the 7th Workshop on Experimental Algorithms, 
             WEA (2008 WEA)},
year      = {2008},
pages     = {154-168},
ee        = {http://dx.doi.org/10.1007/978-3-540-68552-4_12},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/wt.hpp
@inproceedings{GRO:VIT:2003,
author    = {Roberto Grossi and Ankur Gupta and Jeffrey Scott Vitter},
title     = {High-order entropy-compressed text indexes},
booktitle = {Proceedings of the 14th Annual ACM-SIAM Symposium
             on Discrete Algorithms (SODA 2003)},
year      = {2003},
pages     = {841-850},
ee        = {http://dl.acm.org/citation.cfm?id=644108.644250},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/wt_rlmn.hpp
// used in include/sdsl/wt_huff.hpp
@inproceedings{MAK:NAV:2005,
author    = {Veli M{\"a}kinen and Gonzalo Navarro},
title     = {Succinct Suffix Arrays Based on Run-Length Encoding},
booktitle = {Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching,
             (CPM 2005)},
year      = {2005},
pages     = {45-56},
ee        = {http://dx.doi.org/10.1007/11496656_5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/rrr_vector_15.hpp
@inproceedings{CLA:NAV:2008,
author    = {Francisco Claude and Gonzalo Navarro},
title     = {Practical Rank/Select Queries over Arbitrary Sequences},
booktitle = {Proceedings of String Processing and Information Retrieval, 15th International
             Symposium, (SPIRE 2008)},
year      = {2008},
pages     = {176-187},
ee        = {http://dx.doi.org/10.1007/978-3-540-89097-3_18},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/lcp_dac.hpp
@inproceedings{BRI:LAD:NAV:2009,
author    = {Nieves R. Brisaboa and Susana Ladra and Gonzalo Navarro},
title     = {Directly Addressable Variable-Length Codes},
booktitle = {Proceedings of String Processing and Information Retrieval, 16th International
             Symposium, (SPIRE 2009)},
year      = {2009},
pages     = {122-130},
ee        = {http://dx.doi.org/10.1007/978-3-642-03784-9_12},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/lcp_sada.hpp
@inproceedings{SAD:2002,
author    = {Kunihiko Sadakane},
title     = {Succinct representations of {LCP} information and improvements
             in the compressed suffix arrays},
booktitle = {Proceedings of the 13th Annual ACM-SIAM Symposium
             on Discrete Algorithms (SODA 2002)},
year      = {2002},
pages     = {225-232},
ee        = {http://dl.acm.org/citation.cfm?id=545381.545410},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/bp_support_sada.hpp
@techreport{SAD:2008,
author      = {Kunihiko Sadakane},
title       = {The Ultimate Balanced Parentheses},
institution = {Dept. of Computer Science and Communication Engineering,
               Kyushu University, Japan},
year        = {2008}
}

// used in include/sdsl/bp_support_g.hpp
@inproceedings{GOG:FIS:2010,
author    = {Simon Gog and Johannes Fischer},
title     = {Advantages of Shared Data Structures for Sequences of Balanced
             Parentheses},
booktitle = {Proceedings of 2010 Data Compression Conference (DCC 2010)},
year      = {2010},
pages     = {406-415},
ee        = {http://doi.ieeecomputersociety.org/10.1109/DCC.2010.43},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/rrr_vector.hpp
@inproceedings{NAV:PRO:2012,
author    = {Gonzalo Navarro and Eliana Providel},
title     = {Fast, Small, Simple Rank/Select on Bitmaps},
booktitle = {Proceedings of the 11th International Symposium on Experimental Algorithms
             (SEA 2013)},
year      = {2012},
pages     = {295-306},
ee        = {http://dx.doi.org/10.1007/978-3-642-30850-5_26},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in qsufsort.hpp 
@article{LAR:SAD:2007,
author    = {N. Jesper Larsson and Kunihiko Sadakane},
title     = {Faster suffix sorting},
journal   = {Theoretical Computer Science},
volume    = {387},
number    = {3},
year      = {2007},
pages     = {258-272},
ee        = {http://dx.doi.org/10.1016/j.tcs.2007.07.017},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/sd_vector.hpp
@inproceedings{OKA:SAD:2007,
author    = {Daisuke Okanohara and Kunihiko Sadakane},
title     = {Practical Entropy-Compressed Rank/Select Dictionary},
booktitle = {Proceedings of the 9th Workshop on Algorithm Engineering and Experiments
             (ALENEX 2007)},
year      = {2007},
ee        = {http://www.siam.org/proceedings/alenex/2007/alx07_007okanoharad2.pdf},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/csa_sada.hpp
@article{SAD:2003,
author    = {Kunihiko Sadakane},
title     = {New text indexing functionalities of the compressed suffix arrays},
journal   = {Journal of Algorithms},
volume    = {48},
number    = {2},
year      = {2003},
pages     = {294-313},
ee        = {http://dx.doi.org/10.1016/S0196-6774(03)00087-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/cst_sada.hpp
@article{SAD:2007,
author    = {Kunihiko Sadakane},
title     = {Compressed Suffix Trees with Full Functionality},
journal   = {Theory of Computing Systems},
volume    = {41},
number    = {4},
year      = {2007},
pages     = {589-607},
ee        = {http://dx.doi.org/10.1007/s00224-006-1198-x},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in include/sdsl/cst_sct3.hpp
@inproceedings{OHL:FIS:GOG:2010,
author    = {Enno Ohlebusch and Johannes Fischer and Simon Gog},
title     = {CST++},
booktitle = {Proceedings of String Processing and Information Retrieval, 17th International
             Symposium, (SPIRE 2010)},
year      = {2010},
pages     = {322-333},
ee        = {http://dx.doi.org/10.1007/978-3-642-16321-0_34},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

// used in tutorial/document_listing/document_listing_sada.hpp
@article{SAD:JDA:2007,
author     = {Kunihiko Sadakane},
title      = {Succinct data structures for flexible text retrieval systems},
journal    = {Journal of Discrete Algorithms},
issue_date = {March, 2007},
volume     = {5},
number     = {1},
month      = {March},
year       = {2007},
issn       = {1570-8667},
pages      = {12-22},
numpages   = {11},
url        = {http://dx.doi.org/10.1016/j.jda.2006.03.011},
doi        = {10.1016/j.jda.2006.03.011},
acmid      = {1224678},
publisher  = {Elsevier Science Publishers B. V.},
address    = {Amsterdam, The Netherlands, The Netherlands},
}

// used in include/sdsl/lcp_dac.hpp
@article{TRA:SAN:2010,
author     = {Frederik Transier and Peter Sanders},
title      = {Engineering Basic Algorithms of an In-Memory Text Search Engine},
journal    = {ACM Transactions on Information Systems},
issue_date = {December 2010},
volume     = {29},
number     = {1},
month      = {December},
year       = {2010},
issn       = {1046-8188},
pages      = {2:1-2:37},
articleno  = {2},
numpages   = {37},
url        = {http://doi.acm.org/10.1145/1877766.1877768},
doi        = {10.1145/1877766.1877768},
acmid      = {1877768},
publisher  = {ACM},
address    = {New York, NY, USA},
}

// used in include/sdsl/lcp_dac.hpp
@article{WIL:ZOB:1999,
author     = {Hugh E. Williams and Justin Zobel},
title      = {Compressing Integers for Fast File Access},
journal    = {The Computer Journal},
volume     = {42},
number     = {3},
year       = {1999},
pages      = {193-201},
url        = {http://comjnl.oxfordjournals.org/content/42/3/193.abstract},
doi        = {10.1093/comjnl/42.3.193},
}

// used in include/sdsl/sd_vector.hpp
@article{ELI:1974,
author     = {Elias, Peter},
title      = {Efficient Storage and Retrieval by Content and Address of Static Files},
journal    = {Journal of the ACM},
issue_date = {April 1974},
volume     = {21},
number     = {2},
month      = {April},
year       = {1974},
issn       = {0004-5411},
pages      = {246-260},
numpages   = {15},
url        = {http://doi.acm.org/10.1145/321812.321820},
doi        = {10.1145/321812.321820},
acmid      = {321820},
publisher  = {ACM},
address    = {New York, NY, USA},
}

// used in include/sdsl/sd_vector.hpp
@book{FAN:1971,
title      = {On the Number of Bits Required to Implement an Associative Memory},
author     = {Robert Mario Fano},
series     = {Computation Structures Group Memo},
year       = {1971},
publisher  = {Massachusetts Institute of Technology, Project MAC},
}

// used in include/sdsl/bp_support_g.hpp
// used in include/sdsl/bp_support_gg.hpp
@inproceedings{GEA:RAH:RAM:RAM:2004,
author    = {Richard F. Geary and Naila Rahman and Rajeev Raman and Venkatesh Raman},
title     = {A Simple Optimal Representation for Balanced Parentheses},
booktitle = {Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching,
             (CPM 2004)},
year      = {2004},
pages     = {159-172},
ee        = {http://dx.doi.org/10.1007/978-3-540-27801-6_12},
bibsource = {DBLP, http://dblp.uni-trier.de},
}

// used in include/sdsl/suffix_array_algorithm.hpp
@inproceedings{FER:MAN:2000,
author    = {Paolo Ferragina and Giovanni Manzini},
title     = {Opportunistic Data Structures with Applications},
booktitle = {Proceedings of the 41st Annual Symposium on Foundations of Computer Science,
             (FOCS 2000)},
year      = {2000},
pages     = {390-398},
ee        = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892127},
bibsource = {DBLP, http://dblp.uni-trier.de},
}

// used in include/sdsl/suffix_array_algorithm.hpp
@article{SCH:OHL:GOG:2013,
author    = {Thomas Schnattinger and Enno Ohlebusch and Simon Gog},
title     = {Bidirectional search in a string with wavelet trees and bidirectional matching statistics},
journal   = {Information and Computation},
volume    = {213},
year      = {2012},
issn      = {0890-5401},
pages     = {13-22},
ee        = {http://dx.doi.org/10.1016/j.ic.2011.03.007},
bibsource = {DBLP, http://dblp.uni-trier.de},
}

// used in include/sdsl/lcp_byte.hpp
@article{ABO:KUR:OHL:2004,
author    = {Mohamed Ibrahim Abouelhoda and Stefan Kurtz and Enno Ohlebusch},
title     = {Replacing suffix trees with enhanced suffix arrays},
journal   = {Journal of Discrete Algorithms},
volume    = {2},
number    = {1},
year      = {2004},
issn      = {1570-8667},
pages     = {53-86},
ee        = {http://dx.doi.org/10.1016/S1570-8667(03)00065-0},
bibsource = {DBLP, http://dblp.uni-trier.de},
}

// used in include/sdsl/rrr_vector.hpp
@inproceedings{PAG:1999,
author    = {Rasmus Pagh},
title     = {Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time},
booktitle = {Proceedings of the 26th International Colloquium on Automata, Languages and Programming
             (ICALP 1999)},
year      = {1999},
pages     = {595-604},
ee        = {http://dx.doi.org/10.1007/3-540-48523-6_56},
bibsource = {DBLP, http://dblp.uni-trier.de},
}

// used in include/sdsl/bp_support_gg.hpp
@inproceedings{OHL:GOG:2009,
author    = {Enno Ohlebusch and Simon Gog},
title     = {A Compressed Enhanced Suffix Array Supporting Fast String Matching},
booktitle = {Proceedings of String Processing and Information Retrieval, 16th International
             Symposium, (SPIRE 2009)},
year      = {2009},
pages     = {51-62},
ee        = {http://dx.doi.org/10.1007/978-3-642-03784-9_6},
bibsource = {DBLP, http://dblp.uni-trier.de},
}

// used in include/sdsl/select_support_mcl.hpp
@phdthesis{CLA:1996,
title     = {Compact Pat Trees},
author    = {David Clark},
year      = {1996},
school    = {Department of Computer Science, University of Waterloo},
ee        = {http://www.nlc-bnc.ca/obj/s4/f2/dsk3/ftp04/nq21335.pdf},
}

// use gamma code for csa_sada
@inproceedings{GRO:GUP:VIT:2004,
author    = {Roberto Grossi and Ankur Gupta and Jeffrey Scott Vitter},
title     = {When indexing equals compression: experiments with compressing suffix arrays and applications},
booktitle = {Processings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004)},
year      = {2004},
pages     = {636-645},
ee        = {http://dl.acm.org/citation.cfm?id=982792.982888},
}
