BibTeX record conf/mfcs/HubacekV21

download as .bib file

@inproceedings{DBLP:conf/mfcs/HubacekV21,
  author       = {Pavel Hub{\'{a}}cek and
                  Jan V{\'{a}}clavek},
  editor       = {Filippo Bonchi and
                  Simon J. Puglisi},
  title        = {On Search Complexity of Discrete Logarithm},
  booktitle    = {46th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
  series       = {LIPIcs},
  volume       = {202},
  pages        = {60:1--60:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2021.60},
  doi          = {10.4230/LIPICS.MFCS.2021.60},
  timestamp    = {Tue, 21 Mar 2023 21:01:55 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/HubacekV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.