BibTeX records: Anna Malova

download as .bib file

@inproceedings{DBLP:conf/europar/AksenovGKMR17,
  author       = {Vitaly Aksenov and
                  Vincent Gramoli and
                  Petr Kuznetsov and
                  Anna Malova and
                  Srivatsan Ravi},
  editor       = {Francisco F. Rivera and
                  Tom{\'{a}}s F. Pena and
                  Jos{\'{e}} Carlos Cabaleiro},
  title        = {A Concurrency-Optimal Binary Search Tree},
  booktitle    = {Euro-Par 2017: Parallel Processing - 23rd International Conference
                  on Parallel and Distributed Computing, Santiago de Compostela, Spain,
                  August 28 - September 1, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10417},
  pages        = {580--593},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-64203-1\_42},
  doi          = {10.1007/978-3-319-64203-1\_42},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/europar/AksenovGKMR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AksenovGKMR17,
  author       = {Vitaly Aksenov and
                  Vincent Gramoli and
                  Petr Kuznetsov and
                  Anna Malova and
                  Srivatsan Ravi},
  title        = {A Concurrency-Optimal Binary Search Tree},
  journal      = {CoRR},
  volume       = {abs/1702.04441},
  year         = {2017},
  url          = {http://arxiv.org/abs/1702.04441},
  eprinttype    = {arXiv},
  eprint       = {1702.04441},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AksenovGKMR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ItsyksonMOS14,
  author       = {Dmitry Itsykson and
                  Anna Malova and
                  Vsevolod Oparin and
                  Dmitry Sokolov},
  title        = {Tree-like resolution complexity of two planar problems},
  journal      = {CoRR},
  volume       = {abs/1412.1124},
  year         = {2014},
  url          = {http://arxiv.org/abs/1412.1124},
  eprinttype    = {arXiv},
  eprint       = {1412.1124},
  timestamp    = {Thu, 10 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/ItsyksonMOS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}