Search results

  1. 1.
    0507748 - MÚ 2020 RIV DE eng C - Conference Paper (international conference)
    Gavinsky, Dmitry - Lee, T. - Santha, M. - Sanyal, S.
    A composition theorem for randomized query complexity via Max-conflict complexity.
    46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2019 - (Baier, C.; Chatzigiannakis, I.; Flocchini, P.; Leonardi, S.), č. článku 64. Leibniz International Proceedings in Informatics (LIPIcs), 132. ISBN 978-3-95977-109-2. ISSN 1868-8969.
    [46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Patras (GR), 08.07.2019-12.07.2019]
    R&D Projects: GA ČR(CZ) GX19-27871X
    Institutional support: RVO:67985840
    Keywords : query complexity * lower bounds
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    http://drops.dagstuhl.de/opus/volltexte/2019/10640/
    Permanent Link: http://hdl.handle.net/11104/0298723
    FileDownloadSizeCommentaryVersionAccess
    Gavinsky.pdf1616.2 KBPublisher’s postprintrequire
     
     
  2. 2.
    0487435 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
    Anshu, A. - Gavinsky, Dmitry - Jain, R. - Kundu, S. - Lee, T. - Mukhopadhyay, P. - Santha, M. - Sanyal, S.
    A composition theorem for randomized query complexity.
    37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2018 - (Lokam, S.; Ramanujam, R.), s. 1-13, č. článku 10. Leibniz International Proceedings in Informatics, 93. ISBN 978-3-95977-055-2. ISSN 1868-8969.
    [37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Kanpur (IN), 11.12.2017-15.12.2017]
    R&D Projects: GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : query algorithms and complexity * decision trees * composition theorem
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    http://drops.dagstuhl.de/opus/volltexte/2018/8396/
    Permanent Link: http://hdl.handle.net/11104/0282096
    FileDownloadSizeCommentaryVersionAccess
    Gavinsky.pdf0554.5 KBPublisher’s postprintrequire
     
     


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.