BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × United Kingdom
4 × USA
Collaborated with:
J.Nelson D.P.Woodruff ∅ R.Meka K.Mehlhorn T.Sauerwald H.Sun E.Porat
Talks about:
stream (2) space (2) optim (2) data (2) lipschitz (1) intersect (1) arbitrari (1) algorithm (1) subgraph (1) sparsest (1)

Person: Daniel M. Kane

DBLP DBLP: Kane:Daniel_M=

Contributed to:

STOC 20142014
STOC 20132013
ICALP (2) 20122012
STOC 20112011
PODS 20102010

Wrote 5 papers:

STOC-2014-Kane
The average sensitivity of an intersection of half spaces (DMK), pp. 437–440.
STOC-2013-KaneM
A PRG for lipschitz functions of polynomials with applications to sparsest cut (DMK, RM), pp. 1–10.
ICALP-v2-2012-KaneMSS #data type
Counting Arbitrary Subgraphs in Data Streams (DMK, KM, TS, HS), pp. 598–609.
STOC-2011-KaneNPW #data type #estimation #performance
Fast moment estimation in data streams in optimal space (DMK, JN, EP, DPW), pp. 745–754.
PODS-2010-KaneNW #algorithm #problem
An optimal algorithm for the distinct elements problem (DMK, JN, DPW), pp. 41–52.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.