Haim Kaplan

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Load Balancing With Minimal Deviation in Switch Memories.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Serv. Manag., December, 2023

On Differentially Private Online Predictions.

[BibT_eX]

[DOI]

CoRR, 2023

Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Almost Tight Bounds for Online Facility Location in the Random-Order Model.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Black-Box Differential Privacy for Interactive ML.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Concurrent Shuffle Differential Privacy Under Continual Observation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Fast Approximation of Search Trees on Trees with Centroid Trees.

[BibT_eX]

[DOI]

Benjamin Aram Berendsohn

Ishay Golinsky

László Kozma

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player.

[BibT_eX]

[DOI]

Daniel Agassy

Dani Dorfman

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Optimal Energetic Paths for Electric Cars.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Optimal Weighted Load Balancing in TCAMs.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2022

Differentially Private Learning of Geometric Concepts.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Adversarially Robust Streaming Algorithms via Differential Privacy.

[BibT_eX]

[DOI]

J. ACM, 2022

Codes for Load Balancing in TCAMs: Size Analysis.

[BibT_eX]

[DOI]

CoRR, 2022

Differentially-Private Bayes Consistency.

[BibT_eX]

[DOI]

CoRR, 2022

Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds.

[BibT_eX]

[DOI]

Thatchaphol Saranurak

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Simulating a stack using queues.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Online Weighted Matching with a Sample.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Coding Size of Traffic Partition in Switch Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Minimal Total Deviation in TCAM Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2022, 2022

FriendlyCore: Practical Differentially Private Aggregation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Differentially Private Approximate Quantiles.

[BibT_eX]

[DOI]

Shachar Schnapp

Proceedings of the International Conference on Machine Learning, 2022

Dynamic Connectivity in Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Monotone Learning.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Shay Solomon

ACM Trans. Parallel Comput., 2021

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Stabbing pairwise intersecting disks by five points.

[BibT_eX]

[DOI]

Discret. Math., 2021

Union of Hypercubes and 3D Minkowski Sums with Random Sizes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

A Note on Sanitizing Streams with Differential Privacy.

[BibT_eX]

[DOI]

CoRR, 2021

Online Weighted Bipartite Matching with a Sample.

[BibT_eX]

[DOI]

CoRR, 2021

Separating Adaptive Streaming from Oblivious Streaming.

[BibT_eX]

[DOI]

CoRR, 2021

Locality Sensitive Hashing for Efficient Similar Polygon Retrieval.

[BibT_eX]

[DOI]

Jay Tenenbaum

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

How Much TCAM do we Need for Splitting Traffic?

[BibT_eX]

[DOI]

Proceedings of the SOSR '21: The ACM SIGCOMM Symposium on SDN Research, Virtual Event, USA, October 11, 2021

Differentially Private Multi-Armed Bandits in the Shuffle Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Differentially-Private Clustering of Easy Instances.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

The Sparse Vector Technique, Revisited.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Online Markov Decision Processes with Aggregate Bandit Feedback.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

2020

Optimal Representations of a Traffic Distribution in Switch Memories.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2020

Clustering in Hypergraphs to Minimize Average Edge Service Time.

[BibT_eX]

[DOI]

Avinatan Hassidim

ACM Trans. Algorithms, 2020

Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Duality-based approximation algorithms for depth queries and maximum depth.

[BibT_eX]

[DOI]

CoRR, 2020

On Radial Isotropic Position: Theory and Algorithms.

[BibT_eX]

[DOI]

Shiri Artstein-Avidan

CoRR, 2020

Output sensitive algorithms for approximate incidences and their applications.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Reachability Oracles for Directed Transmission Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2020

Unknown mixing times in apprenticeship and reinforcement learning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations.

[BibT_eX]

[DOI]

Jay Tenenbaum

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Competitive Analysis with a Sample and the Secretary Problem.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Sample Complexity Bounds for Influence Maximization.

[BibT_eX]

[DOI]

Gal Sadeh

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Near-optimal Regret Bounds for Stochastic Shortest Path.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Optimal approximations for traffic distribution in bounded switch memories.

[BibT_eX]

[DOI]

Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020

How to Find a Point in the Convex Hull Privately.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Privately Learning Thresholds: Closing the Exponential Gap.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2020

Thompson Sampling for Adversarial Bit Prediction.

[BibT_eX]

[DOI]

Yuval Lewi

Proceedings of the Algorithmic Learning Theory, 2020

Apprenticeship Learning via Frank-Wolfe.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Adjacency Labeling Schemes and Induced-Universal Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Influence Maximization with Few Simulations.

[BibT_eX]

[DOI]

Gal Sadeh

CoRR, 2019

Average reward reinforcement learning with unknown mixing times.

[BibT_eX]

[DOI]

CoRR, 2019

Learning and Generalization for Matching Problems.

[BibT_eX]

[DOI]

CoRR, 2019

Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points.

[BibT_eX]

[DOI]

Sasanka Roy

Comput. Geom., 2019

Faster k-SAT algorithms using biased-PPSZ.

[BibT_eX]

[DOI]

Thomas Dueholm Hansen

Or Zamir

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

A sort of an adversary.

[BibT_eX]

[DOI]

Or Zamir

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Learning to Screen.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Dani Dorfman

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Triangles and Girth in Disk Graphs and Transmission Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Spanners for Directed Transmission Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Accurate Traffic Splitting on SDN Switches.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2018

Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies.

[BibT_eX]

[DOI]

CoRR, 2018

Representations of Sparse Distributed Networks: A Locality-Sensitive Approach.

[BibT_eX]

[DOI]

Shay Solomon

CoRR, 2018

Routing in Unit Disk Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Accurate Traffic Splitting on Commodity Switches.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Prophet Secretary: Surpassing the 1-1/e Barrier.

[BibT_eX]

[DOI]

Yossi Azar

Ashish Chiplunkar

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Differentially Private k-Means with Constant Multiplicative Error.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Pairing heaps: the forward variant.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Approximate Minimum-Weight Matching with Outliers Under Translation.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS.

[BibT_eX]

[DOI]

Shiri Chechik

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.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Hollow Heaps.

[BibT_eX]

[DOI]

Thomas Dueholm Hansen

Robert E. Tarjan

ACM Trans. Algorithms, 2017

Minimum-Cost Flows in Unit-Capacity Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Upward Max-Min Fairness.

[BibT_eX]

[DOI]

J. ACM, 2017

Clustering over Multi-Objective Samples: The one2all Sample.

[BibT_eX]

[DOI]

Shiri Chechik

CoRR, 2017

(1 + ∊)-Approximate f-Sensitive Distance Oracles.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yossi Azar

Ashish Chiplunkar

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Min-Cost Bipartite Perfect Matching with Delays.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2017

2016

Optimal In/Out TCAM Encodings of Ranges.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

The AND-OR Game.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

Approximating the $k$-Level in Three-Dimensional Plane Arrangements.

[BibT_eX]

[DOI]

Sariel Har-Peled

CoRR, 2016

Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays.

[BibT_eX]

[DOI]

Yossi Azar

Ashish Chiplunkar

CoRR, 2016

Bottleneck Paths and Trees and Deterministic Graphical Games.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Approximating the k-Level in Three-Dimensional Plane Arrangements.

[BibT_eX]

[DOI]

Sariel Har-Peled

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.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Minimal indices for predecessor search.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Stable Delaunay Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

On the Complexity of Hub Labeling.

[BibT_eX]

[DOI]

CoRR, 2015

A faster algorithm for the discrete Fréchet distance under translation.

[BibT_eX]

[DOI]

Rinat Ben Avraham

CoRR, 2015

Minimum Cost Flows in Graphs with Unit Capacities.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

The amortized cost of finding the minimum.

[BibT_eX]

[DOI]

Or Zamir

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On the Complexity of Hub Labeling (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

The Temp Secretary Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

Spanners and Reachability Oracles for Directed Transmission Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Shiri Chechik

Proceedings of the Approximation, 2015

2014

Reporting Neighbors in High-Dimensional Euclidean Space.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Computing the Discrete Fréchet Distance in Subquadratic Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Probe scheduling for efficient detection of silent failures.

[BibT_eX]

[DOI]

Perform. Evaluation, 2014

Algorithms and estimators for summarization of unaggregated data streams.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Union of Random Minkowski Sums and Network Vulnerability Analysis.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

The CB tree: a practical concurrent self-adjusting search tree.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Fibonacci Heaps Revisited.

[BibT_eX]

[DOI]

CoRR, 2014

Epsilon-Nets for Halfspaces Revisited.

[BibT_eX]

[DOI]

CoRR, 2014

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.

[BibT_eX]

[DOI]

Thomas Dueholm Hansen

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.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Soft Heaps Simplified.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Answering Planning Queries with the Crowd.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Finding the largest Empty Disk containing a Query Point.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2013

Min-Cost Flow Duality in Planar Networks.

[BibT_eX]

[DOI]

CoRR, 2013

A Labeling Approach to Incremental Cycle Detection.

[BibT_eX]

[DOI]

CoRR, 2013

Minimal Indices for Successor Search.

[BibT_eX]

[DOI]

CoRR, 2013

The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques.

[BibT_eX]

[DOI]

CoRR, 2013

I/O Efficient Dynamic Data Structures for Longest Prefix Queries.

[BibT_eX]

[DOI]

Moshe Hershcovitch

Algorithmica, 2013

Joint Cache Partition and Job Assignment on Multi-core Processors.

[BibT_eX]

[DOI]

Avinatan Hassidim

Omry Tuval

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Reporting neighbors in high-dimensional Euclidean spaces.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Minimal Indices for Successor Search - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On finding an optimal TCAM encoding scheme for packet classification.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Union of random minkowski sums and network vulnerability analysis.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

Scheduling Subset Tests: One-Time, Continuous, and How They Relate.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

What You Can Do with Coordinated Samples.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Improved Bounds for Geometric Permutations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Envy-Free Makespan Approximation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique.

[BibT_eX]

[DOI]

Jirí Matousek

Discret. Comput. Geom., 2012

Unit Distances in Three Dimensions.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

A Case for Customizing Estimators: Coordinated Samples

[BibT_eX]

[DOI]

CoRR, 2012

How to Estimate Change from Samples

[BibT_eX]

[DOI]

CoRR, 2012

The AND-OR Game: Equilibrium Characterization - (Working Paper).

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

CBTree: A Practical Concurrent Self-Adjusting Search Tree.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

How to split a flow?

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Finding the maximal empty disk containing a query point.

[BibT_eX]

[DOI]

Renato Fonseca F. Werneck

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Data structures for mergeable trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Optimal Cover of Points by Disks in a Simple Polygon.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

On lines, joints, and incidences in three dimensions.

[BibT_eX]

[DOI]

György Elekes

J. Comb. Theory A, 2011

The Overlay of Minimization Diagrams in a Randomized Incremental Construction.

[BibT_eX]

[DOI]

Edgar Ramos

Discret. Comput. Geom., 2011

Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting.

[BibT_eX]

[DOI]

Edgar Ramos

Discret. Comput. Geom., 2011

Foreword.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Finding the Maximal Empty Rectangle Containing a Query Point

[BibT_eX]

[DOI]

CoRR, 2011

A kinetic triangulation scheme for moving points in the plane.

[BibT_eX]

[DOI]

Comput. Geom., 2011

A Simpler Linear-Time Recognition of Circular-Arc Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2011

Maximum Flow in Directed Planar Graphs with Vertex Capacities.

[BibT_eX]

[DOI]

Algorithmica, 2011

Truth, Envy, and Truthful Market Clearing Bundle Pricing.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Minimum s-t cut in undirected planar graphs when the source and the sink are close.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Non-price equilibria in markets of discrete goods.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Renato Fonseca F. Werneck

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Maximum Flows by Incremental Breadth-First Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Line Transversals of Convex Polyhedra in R3.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Labeling Dynamic XML Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

On Lines and Joints.

[BibT_eX]

[DOI]

Eugenii Shustin

Discret. Comput. Geom., 2010

On the Interplay between Incentive Compatibility and Envy Freeness

[BibT_eX]

[DOI]

CoRR, 2010

Truth and Envy in Capacitated Allocation Games

[BibT_eX]

[DOI]

CoRR, 2010

Guarding a Terrain by Two Watchtowers.

[BibT_eX]

[DOI]

Algorithmica, 2010

Improved Recommendations via (More) Collaboration.

[BibT_eX]

[DOI]

Proceedings of the 13th International Workshop on the Web and Databases 2010, 2010

Envy-free makespan approximation: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Kinetic stable Delaunay graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Optimal dynamic vertical ray shooting in rectilinear planar subdivisions.

[BibT_eX]

[DOI]

Yoav Giyora

ACM Trans. Algorithms, 2009

Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles.

[BibT_eX]

[DOI]

Ke Chen

ACM Trans. Algorithms, 2009

Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments.

[BibT_eX]

[DOI]

Subhabrata Sen

Proc. VLDB Endow., 2009

Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2009

Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra.

[BibT_eX]

[DOI]

Algorithmica, 2009

Private coresets.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

A simpler implementation and analysis of Chazelle's soft heaps.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Line transversals of convex polyhedra in R3.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Stream sampling for variance-optimal estimation of subset sums.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Leveraging discarded samples for tighter estimation of multiple-set aggregates.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

2008

Thin heaps, thick heaps.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Kinetic and dynamic data structures for closest pair and all nearest neighbors.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Efficient Colored Orthogonal Range Counting.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Tighter estimation using bottom k sketches.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2008

Weak ε-nets and interval chains.

[BibT_eX]

[DOI]

J. ACM, 2008

Variance optimal sampling based estimation of subset sums

[BibT_eX]

[DOI]

CoRR, 2008

Sketch-Based Estimation of Subpopulation-Weight

[BibT_eX]

[DOI]

CoRR, 2008

Processing top-k queries from samples.

[BibT_eX]

[DOI]

Nadav Grossaug

Comput. Networks, 2008

Estimating Aggregates over Multiple Sets.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

Path Minima in Incremental Unrooted Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

A simpler analysis of Burrows-Wheeler-based compression.

[BibT_eX]

[DOI]

Shir Landau

Theor. Comput. Sci., 2007

Online Conflict-Free Coloring for Intervals.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Compact Labeling Scheme for XML Ancestor Queries.

[BibT_eX]

[DOI]

Ronen Shabo

Theory Comput. Syst., 2007

Spatially-decaying aggregation over a network.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213].

[BibT_eX]

[DOI]

Inf. Comput., 2007

Kinetic and dynamic data structures for convex hulls and upper envelopes.

[BibT_eX]

[DOI]

Giora Alexandron

Comput. Geom., 2007

Associative search in peer to peer networks: Harnessing latent semantics.

[BibT_eX]

[DOI]

Comput. Networks, 2007

Better Landmarks Within Reach.

[BibT_eX]

[DOI]

Andrew V. Goldberg

Renato Fonseca F. Werneck

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Counting colors in boxes.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Bottom-k sketches: better and more efficient estimation of aggregates.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2007

Sketching unaggregated data streams for subpopulation-size queries.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Summarizing data using bottom-k sketches.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Algorithms and estimators for accurate summarization of internet traffic.

[BibT_eX]

[DOI]

Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

Strong Price of Anarchy for Machine Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Most Burrows-Wheeler Based Compressors Are Not Optimal.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Computing the volume of the union of cubes.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Compact Labeling Scheme for Ancestor Queries.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Partial alphabetic trees.

[BibT_eX]

[DOI]

Arye Barkan

J. Algorithms, 2006

The greedy algorithm for edit distance with moves.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Finding the Position of the k-Mismatch and Approximate Tandem Repeats.

[BibT_eX]

[DOI]

Ely Porat

Proceedings of the Algorithm Theory, 2006

Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Reach for A*: Shortest Path Algorithms with Preprocessing.

[BibT_eX]

[DOI]

Andrew V. Goldberg

Renato F. Werneck

Proceedings of the Shortest Path Problem, 2006

Colored intersection searching via sparse rectangular matrix multiplication.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms.

[BibT_eX]

[DOI]

Andrew V. Goldberg

Renato F. Werneck

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005

Corrigendum: a new, simpler linear-time dominators algorithm.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2005

Performance aspects of distributed caches using TTL-based consistency.

[BibT_eX]

[DOI]

Eran Halperin

Theor. Comput. Sci., 2005

Sorting signed permutations by reversals, revisited.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.

[BibT_eX]

[DOI]

J. ACM, 2005

The greedy algorithm for shortest superstrings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems.

[BibT_eX]

[DOI]

Discret. Math., 2005

Learning with attribute costs.

[BibT_eX]

[DOI]

Eyal Kushilevitz

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Guarding a terrain by two watchtowers.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Secure Exchange of Modifiable Data and Queries.

[BibT_eX]

Proceedings of the 21èmes Journées Bases de Données Avancées, 2005

2004

Persistent Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Balanced-Replication Algorithms for Distribution Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

Optimal oblivious routing in polynomial time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Efficient estimation algorithms for neighborhood variance and other moments.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Spatially-decaying aggregation over a network: model and algorithms.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

2003

Reachability and Distance Queries via 2-Hop Labels.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Predicting and bypassing end-to-end Internet service degradations.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2003

Connection caching: model and algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Making data structures confluently persistent.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Proactive caching of DNS records: addressing a performance bottleneck.

[BibT_eX]

[DOI]

Comput. Networks, 2003

A case for associative peer to peer overlays.

[BibT_eX]

[DOI]

Comput. Commun. Rev., 2003

Dynamic rectangular intersection with priorities.

[BibT_eX]

[DOI]

Eyal Molad

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Efficient sequences of trials.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Sanjeev Arora

Alan M. Frieze

Math. Program., 2002

Scalable Secure Storage When Half the System Is Faulty.

[BibT_eX]

[DOI]

Inf. Comput., 2002

Restoration by path concatenation: fast recovery of MPLS paths.

[BibT_eX]

[DOI]

Distributed Comput., 2002

Prefetching the means for document transfer: a new approach for reducing Web latency.

[BibT_eX]

[DOI]

Comput. Networks, 2002

Refreshment policies for Web content caches.

[BibT_eX]

[DOI]

Comput. Networks, 2002

Competitive Analysis of the LRFU Paging Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2002

Exploiting Regularities in Web Traffic Patterns for Cache Replacement.

[BibT_eX]

[DOI]

Algorithmica, 2002

Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach.

[BibT_eX]

[DOI]

Algorithmica, 2002

Meldable heaps and boolean union-find.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Nearest common ancestors: a survey and a new distributed algorithm.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Union-find with deletions.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

A comparison of labeling schemes for ancestor queries.

[BibT_eX]

[DOI]

Ronen Shabo

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Unique Maximum Matching Algorithms.

[BibT_eX]

[DOI]

Harold N. Gabow

J. Algorithms, 2001

Short and Simple Labels for Small Distances and Other Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

The Age Penalty and Its Effect on Cache Performance.

[BibT_eX]

[DOI]

Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, 2001

Faster kinetic heaps and their use in broadcast scheduling.

[BibT_eX]

[DOI]

Kostas Tsioutsiouliklis

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Compact labeling schemes for ancestor queries.

[BibT_eX]

[DOI]

Serge Abiteboul

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Restoration path concatenation: fast recovery of MPLS paths.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2001 Conference on Applications, 2001

2000

Simple Confluently Persistent Catenable Lists.

[BibT_eX]

[DOI]

Chris Okasaki

SIAM J. Comput., 2000

Connection caching under vaious models of communication.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Managing TCP Connections Under Persistent HTTP.

[BibT_eX]

[DOI]

Jeffrey D. Oldham

Comput. Networks, 1999

Bounded Degree Interval Sandwich Problems.

[BibT_eX]

[DOI]

Algorithmica, 1999

Connection Caching.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data.

[BibT_eX]

[DOI]

Martin Strauss

Mario Szegedy

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On-line Complexity of Monotone Set Systems.

[BibT_eX]

[DOI]

Mario Szegedy

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

LP-based Analysis of Greedy-dual-size.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

A New, Simpler Linear-Time Dominators Algorithm.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1998

Simple Confluently Persistent Catenable Lists (Extended Abstract).

[BibT_eX]

[DOI]

Chris Okasaki

Proceedings of the Algorithm Theory, 1998

Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Cell Flipping in Permutation Diagrams.

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

1996

Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

Purely Functional Representations of Catenable Sorted Lists.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Physical Maps and Interval Sandwich Problems: Bounded Degrees Help.

[BibT_eX]

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Four Strikes Against Physical Mapping of DNA.

[BibT_eX]

[DOI]

Paul W. Goldberg

J. Comput. Biol., 1995

Graph Sandwich Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Persistent lists with catenation via recursive slow-down.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

The Domatic Number Problem on Some Perfect Graph Families.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract).

[BibT_eX]

[DOI]