BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × China
1 × France
1 × Italy
1 × Japan
1 × Poland
1 × Switzerland
2 × Greece
9 × USA
Collaborated with:
E.Cohen R.E.Tarjan A.Fiat U.Zwick M.Thorup T.Milo M.Levy S.Olonetsky N.G.Duffield C.Lund S.Sen E.Kushilevitz Y.Mansour E.Molad N.Shafrir E.Halperin H.N.Gabow T.D.Hansen S.Alstrup I.Lotosh S.Novgorodov D.Feldman K.Nissim A.L.Buchsbaum A.Rogers J.Westbrook R.Shabo Y.Azar H.Räcke N.Alon M.Krivelevich D.Malkhi J.P.Stern
Talks about:
algorithm (3) weight (3) estim (3) cach (3) use (3) unaggreg (2) scalabl (2) network (2) sketch (2) machin (2)

Person: Haim Kaplan

DBLP DBLP: Kaplan:Haim

Contributed to:

ICALP (1) 20152015
STOC 20152015
VLDB 20132013
PODS 20112011
STOC 20092009
VLDB 20092009
VLDB 20082008
ICALP 20072007
PODS 20072007
ICALP (1) 20062006
STOC 20052005
SIGMOD 20042004
STOC 20032003
PODS 20022002
STOC 20022002
ICALP 20012001
ICALP 20002000
STOC 19991999
STOC 19981998
STOC 19961996
STOC 19951995

Wrote 25 papers:

Hollow Heaps (TDH, HK, RET, UZ), pp. 689–700.
STOC-2015-AlstrupKTZ #graph
Adjacency Labeling Schemes and Induced-Universal Graphs (SA, HK, MT, UZ), pp. 625–634.
VLDB-2013-KaplanLMN #query
Answering Planning Queries with the Crowd (HK, IL, TM, SN), pp. 697–708.
PODS-2011-CohenK #using
Get the most out of your sample: optimal unbiased estimators using partial information (EC, HK), pp. 13–24.
Private coresets (DF, AF, HK, KN), pp. 361–370.
VLDB-2009-CohenDKLT #composition #scalability #set #summary
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets (EC, NGD, HK, CL, MT), pp. 431–442.
VLDB-2009-CohenKS #coordination #multi
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments (EC, HK, SS), pp. 646–657.
VLDB-2008-CohenK #estimation #sketching #using
Tighter estimation using bottom k sketches (EC, HK), pp. 213–224.
Strong Price of Anarchy for Machine Load Balancing (AF, HK, ML, SO), pp. 583–594.
PODS-2007-CohenDKLT #data type #query #sketching
Sketching unaggregated data streams for subpopulation-size queries (EC, NGD, HK, CL, MT), pp. 253–262.
ICALP-v1-2006-FiatKLOS #design #network #on the
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (AF, HK, ML, SO, RS), pp. 608–618.
STOC-2005-KaplanKM #learning
Learning with attribute costs (HK, EK, YM), pp. 356–365.
SIGMOD-2004-CohenK #algorithm #network
Spatially-decaying aggregation over a network: model and algorithms (EC, HK), pp. 707–718.
STOC-2003-AzarCFKR #polynomial
Optimal oblivious routing in polynomial time (YA, EC, AF, HK, HR), pp. 383–388.
Dynamic rectangular intersection with priorities (HK, EM, RET), pp. 639–648.
PODS-2002-CohenKM #xml
Labeling Dynamic XML Trees (EC, HK, TM), pp. 271–281.
Meldable heaps and boolean union-find (HK, NS, RET), pp. 573–582.
ICALP-2001-CohenHK #aspect-oriented #consistency #distributed #performance #using
Performance Aspects of Distributed Caches Using TTL-Based Consistency (EC, EH, HK), pp. 744–756.
ICALP-2000-AlonKKMS #scalability
Scalable Secure Storage when Half the System Is Faulty (NA, HK, MK, DM, JPS), pp. 576–587.
STOC-1999-CohenK #web
Exploiting Regularities in Web Traffic Patterns for Cache Replacement (EC, HK), pp. 109–118.
Connection Caching (EC, HK, UZ), pp. 612–621.
STOC-1999-GabowKT #algorithm
Unique Maximum Matching Algorithms (HNG, HK, RET), pp. 70–78.
STOC-1998-BuchsbaumKRW #algorithm #linear #verification
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators (ALB, HK, AR, JW), pp. 279–288.
STOC-1996-KaplanT #functional
Purely Functional Representations of Catenable Sorted Lists (HK, RET), pp. 202–211.
STOC-1995-KaplanT #persistent #recursion
Persistent lists with catenation via recursive slow-down (HK, RET), pp. 93–102.

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.