|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 81 occurrences of 65 keywords
|
|
|
|
|
Results
Found 192 publication records. Showing 192 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Edith Cohen, Haim Kaplan |
How to Estimate Change from Samples  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir |
Computing the Discrete Fréchet Distance in Subquadratic Time |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Natan Rubin, Haim Kaplan, Micha Sharir |
Improved Bounds for Geometric Permutations. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi |
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky |
Envy-Free Makespan Approximation. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir |
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov |
How to split a flow? |
INFOCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov |
Upward Max Min Fairness. |
INFOCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | György Elekes, Haim Kaplan, Micha Sharir |
On lines, joints, and incidences in three dimensions. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Yahav Nussbaum |
Maximum Flow in Directed Planar Graphs with Vertex Capacities. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Yahav Nussbaum |
A Simpler Linear-Time Recognition of Circular-Arc Graphs. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck |
Data structures for mergeable trees. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Edgar Ramos, Micha Sharir |
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Edgar Ramos, Micha Sharir |
The Overlay of Minimization Diagrams in a Randomized Incremental Construction. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan |
Get the Most out of Your Sample: Optimal Unbiased Estimators using Partial Information |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Micha Sharir |
Finding the Maximal Empty Rectangle Containing a Query Point |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir |
Kinetic Stable Delaunay Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan |
Non-Price Equilibria in Markets of Discrete Goods |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
A kinetic triangulation scheme for moving points in the plane. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit |
Foreword. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir |
Optimal Cover of Points by Disks in a Simple Polygon. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck |
Maximum Flows by Incremental Breadth-First Search. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky |
Truth, Envy, and Truthful Market Clearing Bundle Pricing. |
WINE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Yahav Nussbaum |
Minimum s-t cut in undirected planar graphs when the source and the sink are close. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan |
Non-price equilibria in markets of discrete goods. |
ACM Conference on Electronic Commerce |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan |
Get the most out of your sample: optimal unbiased estimators using partial information. |
PODS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu |
Guarding a Terrain by Two Watchtowers. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Micha Sharir, Eugenii Shustin |
On Lines and Joints. |
Discrete & Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky |
On the Interplay between Incentive Compatibility and Envy Freeness |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky |
Truth and Envy in Capacitated Allocation Games |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
A Kinetic Triangulation Scheme for Moving Points in The Plane |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Natan Rubin, Haim Kaplan, Micha Sharir |
Improved Bounds for Geometric Permutations |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line Transversals of Convex Polyhedra in R3. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan, Tova Milo |
Labeling Dynamic XML Trees. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir |
Optimal Cover of Points by Disks in a Simple Polygon. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
A kinetic triangulation scheme for moving points in the plane. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
moving points, triangulation, convex hull, kinetic data structures |
| 1 | Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir |
Kinetic stable Delaunay graphs. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
Voronoi diagram, Delaunay triangulation, kinetic data structure |
| 1 | Rubi Boim, Haim Kaplan, Tova Milo, Ronitt Rubinfeld |
Improved Recommendations via (More) Collaboration. |
WebDB |
2010 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan (eds.) |
Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky |
Envy-free makespan approximation: extended abstract. |
ACM Conference on Electronic Commerce |
2010 |
DBLP DOI BibTeX RDF |
envy free, job scheduling, makespan |
| 1 | Natan Rubin, Haim Kaplan, Micha Sharir |
Improved Bounds for Geometric Permutations. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Computational geometry, Ray-shooting, Convex polyhedra, Lines in space |
| 1 | Yoav Giyora, Haim Kaplan |
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Ray shooting, planar point location |
| 1 | Ke Chen 0006, Haim Kaplan, Micha Sharir |
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Conflict free coloring, online algorithms, coloring |
| 1 | Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky |
Envy-Free Makespan Approximation |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Micha Sharir, Eugenii Shustin |
On lines and Joints |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | György Elekes, Haim Kaplan, Micha Sharir |
On Lines, Joints, and Incidences in Three Dimensions |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Yahav Nussbaum |
Maximum Flow in Directed Planar Graphs with Vertex Capacities |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan, Subhabrata Sen |
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan |
Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. |
PVLDB |
2009 |
DBLP BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan, Subhabrata Sen |
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. |
PVLDB |
2009 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Yahav Nussbaum |
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Yahav Nussbaum |
Maximum Flow in Directed Planar Graphs with Vertex Capacities. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
Stream sampling for variance-optimal estimation of subset sums. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line transversals of convex polyhedra in R3. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Uri Zwick |
A simpler implementation and analysis of Chazelle's soft heaps. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim |
Private coresets. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
privacy, differential privacy, coresets |
| 1 | Edith Cohen, Haim Kaplan |
Leveraging discarded samples for tighter estimation of multiple-set aggregates. |
SIGMETRICS/Performance |
2009 |
DBLP DOI BibTeX RDF |
bottom-k sampling, coordinated sampling, multiple-set aggregates, order sampling, sketches, approximate query processing |
| 1 | Haim Kaplan, Robert Endre Tarjan |
Thin heaps, thick heaps. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
binomial queue, decrease key operation, fibonacci heap, melding, thick heap, thin heap, Data structure, priority queue, heap |
| 1 | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir |
Kinetic and dynamic data structures for closest pair and all nearest neighbors. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
computational geometry, nearest neighbors, Kinetic data structures, closest pair |
| 1 | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky |
Weak &epsis;-nets and interval chains. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
Interval chain, inverse Ackermann function, moment curve, weak epsilon-net |
| 1 | Edith Cohen, Nadav Grossaug, Haim Kaplan |
Processing top-k queries from samples. |
Computer Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan |
Sketch-Based Estimation of Subpopulation-Weight |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line Transversals of Convex Polyhedra in R3 |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
Variance optimal sampling based estimation of subset sums |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan |
Tighter estimation using bottom k sketches. |
PVLDB |
2008 |
DBLP BibTeX RDF |
|
| 1 | Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery Westbrook |
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin |
Efficient Colored Orthogonal Range Counting. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan |
Estimating Aggregates over Multiple Sets. |
ICDM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Nira Shafrir |
Path Minima in Incremental Unrooted Trees. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky |
Weak ε-nets and interval chains. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Hershcovitch, Haim Kaplan |
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Shir Landau, Elad Verbin |
A simpler analysis of Burrows-Wheeler-based compression. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern |
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Amos Fiat, Haim Kaplan |
Associative search in peer to peer networks: Harnessing latent semantics. |
Computer Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck |
Data Structures for Mergeable Trees |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Tova Milo, Ronen Shabo |
Compact Labeling Scheme for XML Ancestor Queries. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Giora Alexandron, Haim Kaplan, Micha Sharir |
Kinetic and dynamic data structures for convex hulls and upper envelopes. |
Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan |
Spatially-decaying aggregation over a network. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Chen 0006, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl |
Online Conflict-Free Coloring for Intervals. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoav Giyora, Haim Kaplan |
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin |
Counting colors in boxes. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky |
Strong Price of Anarchy for Machine Load Balancing. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
Strong Nash equilibria, Load balancing, Game theory, Price of Anarchy |
| 1 | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir |
Computing the volume of the union of cubes. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
union of objects, arrangements |
| 1 | Amos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky |
Strong Price of Anarchy for Machine Load Balancing. |
Fair Division |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck |
Better Landmarks Within Reach. |
WEA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Elad Verbin |
Most Burrows-Wheeler Based Compressors Are Not Optimal. |
CPM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Haim Kaplan |
Summarizing data using bottom-k sketches. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
all-distances sketches, bottom-k sketches, data streams |
| 1 | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
Sketching unaggregated data streams for subpopulation-size queries. |
PODS |
2007 |
DBLP DOI BibTeX RDF |
subpopulation size, data streams, sketches, IP flows |
| 1 | Edith Cohen, Haim Kaplan |
Bottom-k sketches: better and more efficient estimation of aggregates. |
SIGMETRICS |
2007 |
DBLP DOI BibTeX RDF |
bottom-k, sampling, sketches, approximate query processing |
| 1 | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
Algorithms and estimators for accurate summarization of internet traffic. |
Internet Measurement Comference |
2007 |
DBLP DOI BibTeX RDF |
ip flows, subpopulation queries, data streams, network management, sketches, netflow |
| 1 | Haim Kaplan, Nira Shafrir |
The greedy algorithm for edit distance with moves. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arye Barkan, Haim Kaplan |
Partial alphabetic trees. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe |
Compact Labeling Scheme for Ancestor Queries. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Yahav Nussbaum |
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Micha Sharir |
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo |
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 192 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")