default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarry Lang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Vladimir Braverman
, Dan Feldman, Harry Lang, Daniela Rus, Adiel Statman:
Least-Mean-Squares Coresets for Infinite Streams. IEEE Trans. Knowl. Data Eng. 35(9): 8699-8712 (2023)- [j2]Enayat Ullah, Harry Lang, Raman Arora, Vladimir Braverman:
Clustering using Approximate Nearest Neighbour Oracles. Trans. Mach. Learn. Res. 2023 (2023) - 2021
- [j1]Vladimir Braverman, Harry Lang, Keith D. Levin, Yevgeniy Rudoy:
Metric k-median clustering in insertion-only streams. Discret. Appl. Math. 304: 164-180 (2021) - [c14]Vladimir Braverman, Dan Feldman, Harry Lang, Adiel Statman, Samson Zhou:
Efficient Coreset Constructions via Sensitivity Sampling. ACML 2021: 948-963 - [c13]Alaa Maalouf, Harry Lang, Daniela Rus, Dan Feldman:
Deep Learning meets Projective Clustering. ICLR 2021 - 2020
- [c12]Lucas Liebenwein, Cenk Baykal, Harry Lang, Dan Feldman, Daniela Rus:
Provable Filter Pruning for Efficient Neural Networks. ICLR 2020 - [i10]Vladimir Braverman, Dan Feldman, Harry Lang, Daniela Rus, Adiel Statman:
Sparse Coresets for SVD on Infinite Streams. CoRR abs/2002.06296 (2020) - [i9]Alaa Maalouf, Harry Lang, Daniela Rus, Dan Feldman:
Deep Learning Meets Projective Clustering. CoRR abs/2010.04290 (2020)
2010 – 2019
- 2019
- [c11]Vladimir Braverman, Harry Lang, Enayat Ullah, Samson Zhou:
Improved Algorithms for Time Decay Streams. APPROX-RANDOM 2019: 27:1-27:17 - [c10]Vladimir Braverman, Dan Feldman, Harry Lang, Daniela Rus:
Streaming Coreset Constructions for M-Estimators. APPROX-RANDOM 2019: 62:1-62:15 - [c9]Harry Lang, Cenk Baykal, Najib Abu Samra, Tony Tannous, Dan Feldman, Daniela Rus:
Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank. TAMC 2019: 410-423 - [i8]Vladimir Braverman, Harry Lang, Enayat Ullah, Samson Zhou:
Improved Algorithms for Time Decay Streams. CoRR abs/1907.07574 (2019) - [i7]Lucas Liebenwein, Cenk Baykal, Harry Lang, Dan Feldman, Daniela Rus:
Provable Filter Pruning for Efficient Neural Networks. CoRR abs/1911.07412 (2019) - 2018
- [c8]Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou:
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. APPROX-RANDOM 2018: 7:1-7:22 - [c7]Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, Lin F. Yang:
Approximate Convex Hull of Data Streams. ICALP 2018: 21:1-21:13 - [c6]Harry Lang:
Online Facility Location against a t-Bounded Adversary. SODA 2018: 1002-1014 - [i6]Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou:
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. CoRR abs/1805.00212 (2018) - 2017
- [c5]Vladimir Braverman, Harry Lang, Keith D. Levin:
Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams. CALDAM 2017: 72-82 - [c4]Vladimir Braverman, Gereon Frahling, Harry Lang, Christian Sohler, Lin F. Yang:
Clustering High Dimensional Dynamic Data Streams. ICML 2017: 576-585 - [i5]Vladimir Braverman, Gereon Frahling, Harry Lang, Christian Sohler, Lin F. Yang:
Clustering High Dimensional Dynamic Data Streams. CoRR abs/1706.03887 (2017) - [i4]Harry Lang:
Online Facility Location on Semi-Random Streams. CoRR abs/1711.09384 (2017) - [i3]Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, Lin F. Yang:
Approximate Convex Hull of Data Streams. CoRR abs/1712.04564 (2017) - 2016
- [c3]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
Clustering Problems on Sliding Windows. SODA 2016: 1374-1390 - [i2]Vladimir Braverman, Dan Feldman, Harry Lang:
New Frameworks for Offline and Streaming Coreset Constructions. CoRR abs/1612.00889 (2016) - 2015
- [c2]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
Clustering on Sliding Windows in Polylogarithmic Space. FSTTCS 2015: 350-364 - [i1]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
A Unified Approach for Clustering Problems on Sliding Windows. CoRR abs/1504.05553 (2015)
2000 – 2009
- 2002
- [c1]Scott W. Brown, Ivar Babb, Paula R. Johnson, Peter M. Scheifele, Harry Lang, Dongping Zheng, Denise Monte, Mary LaPorta:
Classroom of the Sea: Problem-Based Learning for the Deaf. ICCE 2002: 1340-1341
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 2025-01-09 13:08 CET 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:
