Haim Kaplan
Orcid: 0000-0001-9586-8002Affiliations:
- Tel Aviv University, School of Computer Science
According to our database1,
Haim Kaplan
authored at least 292 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on cs.tau.ac.il
On csauthors.net:
Bibliography
2024
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
IEEE Trans. Netw. Serv. Manag., December, 2023
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
Proceedings of the IEEE INFOCOM 2022, 2022
Proceedings of the International Conference on Machine Learning, 2022
Proceedings of the International Conference on Machine Learning, 2022
Proceedings of the 38th International Symposium on Computational Geometry, 2022
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
2021
Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach.
ACM Trans. Parallel Comput., 2021
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n<sup>5/3</sup>) Time.
SIAM J. Comput., 2021
Discret. Comput. Geom., 2021
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Proceedings of the SOSR '21: The ACM SIGCOMM Symposium on SDN Research, Virtual Event, USA, October 11, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021
Proceedings of the Conference on Learning Theory, 2021
Proceedings of the Conference on Learning Theory, 2021
2020
IEEE/ACM Trans. Netw., 2020
ACM Trans. Algorithms, 2020
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications.
Discret. Comput. Geom., 2020
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location.
Discret. Comput. Geom., 2020
CoRR, 2020
Comput. Geom., 2020
Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020
Proceedings of the 36th International Symposium on Computational Geometry, 2020
Proceedings of the Conference on Learning Theory, 2020
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies.
Proceedings of the Algorithmic Learning Theory, 2020
Proceedings of the Algorithmic Learning Theory, 2020
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
SIAM J. Discret. Math., 2019
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points.
Comput. Geom., 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem.
Proceedings of the 35th International Symposium on Computational Geometry, 2019
2018
Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies.
CoRR, 2018
CoRR, 2018
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic <i>Õ</i>(<i>n</i><sup>5/3</sup>) Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2017
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications.
ACM Trans. Algorithms, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Approximation, 2017
2016
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays.
CoRR, 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection.
ACM Trans. Algorithms, 2015
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions.
Discret. Comput. Geom., 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015
Proceedings of the Algorithms - ESA 2015, 2015
Proceedings of the 31st International Symposium on Computational Geometry, 2015
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees.
Proceedings of the Approximation, 2015
2014
Perform. Evaluation, 2014
J. Comput. Syst. Sci., 2014
Discret. Comput. Geom., 2014
Distributed Comput., 2014
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014
2013
Int. J. Comput. Geom. Appl., 2013
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques.
CoRR, 2013
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013
Proceedings of the Symposium on Computational Geometry 2013, 2013
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013
2012
SIAM J. Comput., 2012
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique.
Discret. Comput. Geom., 2012
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
Proceedings of the Distributed Computing - 26th International Symposium, 2012
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012
2011
SIAM J. Comput., 2011
Discret. Comput. Geom., 2011
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting.
Discret. Comput. Geom., 2011
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011
Get the most out of your sample: optimal unbiased estimators using partial information.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011
Proceedings of the Algorithms - ESA 2011, 2011
2010
Proceedings of the 13th International Workshop on the Web and Databases 2010, 2010
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
2009
ACM Trans. Algorithms, 2009
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles.
ACM Trans. Algorithms, 2009
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments.
Proc. VLDB Endow., 2009
Proc. VLDB Endow., 2009
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs.
Discret. Appl. Math., 2009
Algorithmica, 2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009
2008
ACM Trans. Algorithms, 2008
SIAM J. Comput., 2008
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008
2007
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213].
Inf. Comput., 2007
Comput. Geom., 2007
Comput. Networks, 2007
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2007
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007
2006
Proceedings of the Algorithm Theory, 2006
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Proceedings of the Shortest Path Problem, 2006
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006
2005
ACM Trans. Program. Lang. Syst., 2005
Theor. Comput. Sci., 2005
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
J. ACM, 2005
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems.
Discret. Math., 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005
Secure Exchange of Modifiable Data and Queries.
Proceedings of the 21èmes Journées Bases de Données Avancées, 2005
2004
Proceedings of the Handbook of Data Structures and Applications., 2004
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment.
Theory Comput. Syst., 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004
2003
IEEE J. Sel. Areas Commun., 2003
Comput. Networks, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003
2002
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems.
Math. Program., 2002
Distributed Comput., 2002
Prefetching the means for document transfer: a new approach for reducing Web latency.
Comput. Networks, 2002
Algorithmica, 2002
Algorithmica, 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
2001
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001
Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001
Aging through cascaded caches: performance issues in the distribution of web content.
Proceedings of the ACM SIGCOMM 2001 Conference on Applications, 2001
2000
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000
1999
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs.
SIAM J. Comput., 1999
SIAM J. Comput., 1999
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
1998
ACM Trans. Program. Lang. Syst., 1998
Proceedings of the Algorithm Theory, 1998
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
1996
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques.
SIAM J. Comput., 1996
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
Physical Maps and Interval Sandwich Problems: Bounded Degrees Help.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996
1995
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995
1994
Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993