Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Nikolai K. Vereshchagin

◀ ▶ joint publications with Michal Koucký 0001

> Home > Persons > Nikolai K. Vereshchagin

Publications

2021
[j37]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BuhrmanCKLPV21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BuhrmanCKLPV21
Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin:
High Entropy Random Selection Protocols. Algorithmica 83(2): 667-694 (2021)
2016
[j29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BrodyBKLSV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BrodyBKLSV16
Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica 76(3): 749-781 (2016)
2013
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/BrodyBKLSV13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BrodyBKLSV13
Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. CCC 2013: 24-33
2010
[j24]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/BuhrmanFKRV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BuhrmanFKRV10
Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Theory Comput. Syst. 46(1): 143-156 (2010)
2008
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/BuhrmanKV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BuhrmanKV08
Harry Buhrman, Michal Koucký, Nikolai K. Vereshchagin:
Randomised Individual Communication Complexity. CCC 2008: 321-331
2007
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/BuhrmanCKLPV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/BuhrmanCKLPV07
Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin:
High Entropy Random Selection Protocols. APPROX-RANDOM 2007: 366-379
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/csr/BuhrmanFKRV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/BuhrmanFKRV07
Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Inverting Onto Functions and Polynomial Hierarchy. CSR 2007: 92-103
[i19]
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/VereshchaginBCKLP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/VereshchaginBCKLP07
Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir:
High Entropy Random Selection Protocols. Algebraic Methods in Computational Complexity 2007
2006
[i18]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/BuhrmanFKRV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/BuhrmanFKRV06
Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Inverting onto functions might not be hard. Electron. Colloquium Comput. Complex. TR06 (2006)

a service of

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.