Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Nikolai K. Vereshchagin

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 Zvi Lotker

> 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)
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
[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

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.