Radu Berinde

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 Martin Strauss 0001

> Home > Persons > Radu Berinde

Publications

2010
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tods/BerindeICS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tods/BerindeICS10
Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss:
Space-optimal heavy hitters with strong error bounds. ACM Trans. Database Syst. 35(4): 26:1-26:28 (2010)
2009
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/pods/BerindeCIS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pods/BerindeCIS09
Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss:
Space-optimal heavy hitters with strong error bounds. PODS 2009: 157-166
2008
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/allerton/BerindeGIKS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/allerton/BerindeGIKS08
Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss:
Combining geometry and combinatorics: A unified approach to sparse signal recovery. Allerton 2008: 798-805
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0804-4666
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0804-4666
Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss:
Combining geometry and combinatorics: A unified approach to sparse signal recovery. CoRR abs/0804.4666 (2008)

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.