Gregory Vorsanger

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 Vladimir Braverman

> Home > Persons > Gregory Vorsanger

Publications

2016
[c5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/approx/BravermanRV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/BravermanRV16
Vladimir Braverman, Alan Roytman, Gregory Vorsanger:
Approximating Subadditive Hadamard Functions on Implicit Matrices. APPROX-RANDOM 2016: 25:1-25:19
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/sigcomm/LiuMVSB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigcomm/LiuMVSB16
Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, Vladimir Braverman:
One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon. SIGCOMM 2016: 101-114
2015
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/BravermanOV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BravermanOV15
Vladimir Braverman, Rafail Ostrovsky, Gregory Vorsanger:
Weighted sampling without replacement from data streams. Inf. Process. Lett. 115(12): 923-926 (2015)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/hotnets/LiuVBS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hotnets/LiuVBS15
Zaoxing Liu, Gregory Vorsanger, Vladimir Braverman, Vyas Sekar:
Enabling a "RISC" Approach for Software-Defined Monitoring using Universal Streaming. HotNets 2015: 21:1-21:7
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BravermanOV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BravermanOV15
Vladimir Braverman, Rafail Ostrovsky, Gregory Vorsanger:
Weighted Sampling Without Replacement from Data Streams. CoRR abs/1506.01747 (2015)
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BravermanRV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BravermanRV15
Vladimir Braverman, Alan Roytman, Gregory Vorsanger:
Approximating Subadditive Hadamard Functions on Implicit Matrices. CoRR abs/1511.00838 (2015)
2014
[c2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/approx/BravermanKSV14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/BravermanKSV14
Vladimir Braverman, Jonathan Katzman, Charles Seidell, Gregory Vorsanger:
An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits. APPROX-RANDOM 2014: 531-544
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/BravermanV14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/BravermanV14
Vladimir Braverman, Gregory Vorsanger:
Sampling from Dense Streams without Penalty - Improved Bounds for Frequency Moments and Heavy Hitters. COCOON 2014: 13-24
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BravermanKSV14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BravermanKSV14
Vladimir Braverman, Jonathan Katzman, Charles Seidell, Gregory Vorsanger:
Approximating Large Frequency Moments with O(n^1-2/k) Bits. CoRR abs/1401.1763 (2014)

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.