search result

Cover von A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino

A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino

Year: 2016
Media group: LIPIcs
Cover von Threes!, Fives, 1024!, and 2048 are Hard

Threes!, Fives, 1024!, and 2048 are Hard

Year: 2016
Media group: LIPIcs
Cover von Tiling with Three Polygons Is Undecidable

Tiling with Three Polygons Is Undecidable

Year: 2025
Media group: LIPIcs
Cover von An Optimal Algorithm to Compute the Inverse Beacon Attraction Region

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region

Year: 2018
Media group: LIPIcs
Cover von Self-Approaching Paths in Simple Polygons

Self-Approaching Paths in Simple Polygons

Year: 2017
Media group: LIPIcs
Cover von Incremental Voronoi diagrams

Incremental Voronoi diagrams

Year: 2016
Media group: LIPIcs
Cover von Dynamic Trees with Almost-Optimal Access Cost

Dynamic Trees with Almost-Optimal Access Cost

Year: 2018
Media group: LIPIcs
Cover von Subquadratic Algorithms for Algebraic Generalizations of 3SUM

Subquadratic Algorithms for Algebraic Generalizations of 3SUM

Author: Barba, Luis
Year: 2017
Media group: LIPIcs
Cover von Space-Time Trade-offs for Stack-Based Algorithms

Space-Time Trade-offs for Stack-Based Algorithms

Year: 2013
Media group: ARTICLE
Cover von Subquadratic Encodings for Point Configurations

Subquadratic Encodings for Point Configurations

Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0