Dmitry Gavinsky

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Swagato Sanyal

> Home > Persons > Dmitry Gavinsky

Publications

2019
[c24]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/GavinskyLSS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/GavinskyLSS19
Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. ICALP 2019: 64:1-64:13
2018
[i38]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1811-10752
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1811-10752
Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
A composition theorem for randomized query complexity via max conflict complexity. CoRR abs/1811.10752 (2018)
2017
[c23]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/AnshuGJKLMSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/AnshuGJKLMSS17
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13
[i36]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AnshuG0KLMSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AnshuG0KLMSS17
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. CoRR abs/1706.00335 (2017)
[i35]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1708-00822
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1708-00822
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CoRR abs/1708.00822 (2017)
[i34]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/AnshuGJKLMSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/AnshuGJKLMSS17
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. TR17 (2017)
[i33]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GavinskyJKKLSSV17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GavinskyJKKLSSV17
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR17 (2017)

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.