Carola Doerr

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 Kasper Green Larsen

> Home > Persons > Carola Doerr

Publications

2019
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/AfshaniADDLM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AfshaniADDLM19
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. 260: 28-50 (2019)
2018
[i30]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1812-08480
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1812-08480
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR abs/1812.08480 (2018)
2013
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/birthday/AfshaniADDLM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/AfshaniADDLM13
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of Finding a Hidden Permutation. Space-Efficient Data Structures, Streams, and Algorithms 2013: 1-11
2012
[i11]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - details & citations
- export record
  dblp key:
  - journals/eccc/AfshaniADCLM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/AfshaniADCLM12
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn:
The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. TR12 (2012)

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.