Krzysztof Onak

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 Piotr Indyk

> Home > Persons > Krzysztof Onak

Publications

2019
[c31]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icml/BackursIOSVW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/BackursIOSVW19
Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. ICML 2019: 405-413
[i21]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1902-03519
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1902-03519
Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. CoRR abs/1902.03519 (2019)
2010
[p3]
- view
  authority control:
- export record
  dblp key:
  - conf/propertytesting/AndoniIOR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/propertytesting/AndoniIOR10
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld:
Sublinear Algorithms in the External Memory Model. Property Testing 2010: 240-243
2009
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/AndoniIOR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/AndoniIOR09
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld:
External Sampling. ICALP (1) 2009: 83-94

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.