default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSofya Vorotnikova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i6]Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, Sofya Vorotnikova:
Vertex Ordering Problems in Directed Graph Streams. CoRR abs/2105.08215 (2021)- 2020
- [c10]Andrew McGregor, Sofya Vorotnikova:
Triangle and Four Cycle Counting in the Data Stream Model. PODS 2020: 445-456 - [c9]Amit Chakrabarti, Prantar Ghosh
, Andrew McGregor, Sofya Vorotnikova:
Vertex Ordering Problems in Directed Graph Streams. SODA 2020: 1786-1802 - [i5]Sofya Vorotnikova:
Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming. CoRR abs/2007.13466 (2020)
2010 – 2019
- 2019
- [j2]Marc Bury, Elena Grigorescu, Andrew McGregor, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, Samson Zhou:
Structural Results on Matching Estimation with Applications to Streaming. Algorithmica 81(1): 367-392 (2019) - [j1]Arya Mazumdar, Andrew McGregor, Sofya Vorotnikova:
Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate. IEEE Trans. Inf. Theory 65(9): 5580-5591 (2019) - [c8]John Kallaugher, Andrew McGregor, Eric Price, Sofya Vorotnikova:
The Complexity of Counting Cycles in the Adjacency List Streaming Model. PODS 2019: 119-133 - 2018
- [c7]Andrew McGregor, Sofya Vorotnikova:
A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs. SOSA 2018: 14:1-14:4 - 2017
- [c6]Arya Mazumdar, Andrew McGregor, Sofya Vorotnikova:
Storage capacity as an information-theoretic analogue of vertex cover. ISIT 2017: 2810-2814 - [i4]Arya Mazumdar, Andrew McGregor, Sofya Vorotnikova:
Storage Capacity as an Information-Theoretic Analogue of Vertex Cover. CoRR abs/1706.09197 (2017) - 2016
- [c5]Andrew McGregor, Sofya Vorotnikova:
Planar Matching in Streams Revisited. APPROX-RANDOM 2016: 17:1-17:12 - [c4]Andrew McGregor, Sofya Vorotnikova, Hoa T. Vu:
Better Algorithms for Counting Triangles in Data Streams. PODS 2016: 401-411 - [c3]Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. SODA 2016: 1326-1344 - [i3]Andrew McGregor, Sofya Vorotnikova:
A Note on Logarithmic Space Stream Algorithms for Matchings in Low Arboricity Graphs. CoRR abs/1612.02531 (2016) - 2015
- [c2]Andrew McGregor, David Tench, Sofya Vorotnikova, Hoa T. Vu:
Densest Subgraph in Dynamic Graph Streams. MFCS (2) 2015: 472-482 - [i2]Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Dynamic Graph Streams. CoRR abs/1505.01731 (2015) - [i1]Andrew McGregor, David Tench, Sofya Vorotnikova, Hoa T. Vu:
Densest Subgraph in Dynamic Graph Streams. CoRR abs/1506.04417 (2015) - 2014
- [c1]Andrew McGregor, Eric Price, Sofya Vorotnikova:
Trace Reconstruction Revisited. ESA 2014: 689-700
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
