Peyman Afshani

Pingan Cheng

CoRR, 2020

A Lower Bound for Jumbled Indexing.

[BibT_eX]

[DOI]

Ingo van Duijn

Rasmus Killmann

Jesper Sindahl Nielsen

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

2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions.

[BibT_eX]

[DOI]

Pingan Cheng

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Revisiting the Theory and Practice of Database Cracking.

[BibT_eX]

[DOI]

Fatemeh Zardbani

Panagiotis Karras

Proceedings of the 23rd International Conference on Extending Database Technology, 2020

2019

The query complexity of a permutation-based variant of Mastermind.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Lower Bounds for Multiplication via Network Coding.

[BibT_eX]

[DOI]

Casper Benjamin Freksen

Lior Kamma

Kasper Green Larsen

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

Fragile Complexity of Comparison-Based Algorithms.

[BibT_eX]

[DOI]

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

Independent Range Sampling, Revisited Again.

[BibT_eX]

[DOI]

Jeff M. Phillips

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

A New Lower Bound for Semigroup Orthogonal Range Searching.

[BibT_eX]

[DOI]

Constantinos Tsirogiannis

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

2018

An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2018

Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges.

[BibT_eX]

[DOI]

Konstantinos Tsakalidis

Algorithmica, 2018

On the complexity of range searching among curves.

[BibT_eX]

[DOI]

Anne Driemel

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

2017

Instance-Optimal Geometric Algorithms.

[BibT_eX]

[DOI]

Jérémy Barbay

J. ACM, 2017

Cross-Referenced Dictionaries and the Limits of Write Optimization.

[BibT_eX]

[DOI]

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

Independent Range Sampling, Revisited.

[BibT_eX]

[DOI]

Zhewei Wei

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Permuting and Batched Geometric Lower Bounds in the I/O Model.

[BibT_eX]

[DOI]

Constantinos Tsirogiannis

Ingo van Duijn

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

An Efficient Algorithm for the 1D Total Visibility-Index Problem.

[BibT_eX]

[DOI]

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

Data Structure Lower Bounds for Document Indexing Problems.

[BibT_eX]

[DOI]

Jesper Sindahl Nielsen

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Applications of Incidence Bounds in Point Covering Problems.

[BibT_eX]

[DOI]

Edvin Berglin

Ingo van Duijn

Jesper Sindahl Nielsen

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Approximating the Simplicial Depth.

[BibT_eX]

[DOI]

Donald R. Sheehy

Yannik Stein

CoRR, 2015

Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls.

[BibT_eX]

[DOI]

Wanbin Son

Proceedings of the Theory and Applications of Models of Computation, 2015

Sorting and Permuting without Bank Conflicts on GPUs.

[BibT_eX]

[DOI]

Nodari Sitchinava

Proceedings of the Algorithms - ESA 2015, 2015

2014

I/O-Efficient Range Minima Queries.

[BibT_eX]

[DOI]

Nodari Sitchinava

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges.

[BibT_eX]

[DOI]

Konstantinos Tsakalidis

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Concurrent Range Reporting in Two-Dimensional Space.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Fast Computation of Output-Sensitive Maxima in a Word RAM.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM.

[BibT_eX]

[DOI]

Konstantinos Tsakalidis

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

(Approximate) Uncertain Skylines.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems.

[BibT_eX]

[DOI]

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

Property Testing on Linked Lists.

[BibT_eX]

[DOI]

Kevin Matulef

Bryan T. Wilkinson

Electron. Colloquium Comput. Complex., 2013

The Query Complexity of Finding a Hidden Permutation.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

2012

The Deterministic and Randomized Query Complexity of a Simple Guessing Game.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Lower Bounds for Sorted Geometric Queries in the I/O Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model.

[BibT_eX]

[DOI]

Lars Arge

Kasper Green Larsen

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

2011

Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space.

[BibT_eX]

[DOI]

Chris H. Hamilton

Discret. Comput. Geom., 2011

Improved Space Bounds for Cache-Oblivious Range Reporting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Ordered and Unordered Top-K Range Reporting in Large Data Sets.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

A general approach for cache-oblivious range reporting and approximate range counting.

[BibT_eX]

[DOI]

Chris H. Hamilton

Comput. Geom., 2010

Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements.

[BibT_eX]

[DOI]

Lars Arge

Kasper Dalgaard Larsen

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

2009

On Approximate Range Counting and Depth.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Dynamic Connectivity for Axis-Parallel Rectangles.

[BibT_eX]

[DOI]

Algorithmica, 2009

Optimal halfspace range reporting in three dimensions.

[BibT_eX]

[DOI]

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

Orthogonal Range Reporting in Three and Higher Dimensions.

[BibT_eX]

[DOI]

Lars Arge

Kasper Dalgaard Larsen

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

On Geometric Range Searching, Approximate Counting and Depth Problems.

[BibT_eX]

[DOI]

PhD thesis, 2008

Approximation and inapproximability results for maximum clique of disc graphs in high dimensions.

[BibT_eX]

[DOI]

Hamed Hatami

Inf. Process. Lett., 2008

On Dominance Reporting in 3D.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

On the Complexity of Finding an Unknown Cut Via Vertex Queries.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull.

[BibT_eX]

[DOI]

Arash Farzan

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2005

Circular chromatic index of graphs of maximum degree 3.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

On the spectrum of the forced matching number of graphs.

[BibT_eX]

[DOI]