UB Paderborn / Katalog / Suche / in CDI

How fast can we play Tetris greedily with rectangular pieces?

Theoretical computer science, 2024-04, Vol.992, p.114405, Article 114405

2024

Volltextzugriff (PDF)

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

Algorithmica, 2018-11, Vol.80 (11), p.3316-3334

2018

Volltextzugriff (PDF)

Competitive Online Search Trees on Trees

ACM transactions on algorithms, 2023-06, Vol.19 (3), p.1-19, Article 25

2023

Volltextzugriff (PDF)

Fragile complexity of adaptive algorithms

Theoretical computer science, 2022-06, Vol.919, p.92-102

2022

Volltextzugriff (PDF)

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model

Computational geometry : theory and applications, 2023-02, Vol.109, p.101945, Article 101945

2023

Volltextzugriff (PDF)

Encoding nearest larger values

Theoretical computer science, 2018-02, Vol.710, p.97-115

2018

Volltextzugriff (PDF)

Subquadratic Algorithms for Algebraic 3SUM

Discrete & computational geometry, 2019-06, Vol.61 (4), p.698-734

2019

Volltextzugriff (PDF)

In Pursuit of the Dynamic Optimality Conjecture

Space-Efficient Data Structures, Streams, and Algorithms, p.236-250

Volltextzugriff (PDF)

Spanning Properties of Theta–Theta-6

Graphs and combinatorics, 2020-05, Vol.36 (3), p.525-538

2020

Volltextzugriff (PDF)

Worst-Case Optimal Tree Layout in External Memory

Algorithmica, 2015-06, Vol.72 (2), p.369-378

2015

Volltextzugriff (PDF)

Foreword

Computational geometry : theory and applications, 2014-02, Vol.47 (2), p.199

2014

Volltextzugriff (PDF)

The Power and Limitations of Static Binary Search Trees with Lazy Finger

Algorithmica, 2016-12, Vol.76 (4), p.1264-1275

2016

Volltextzugriff (PDF)

Belga B-Trees

Theory of computing systems, 2021-04, Vol.65 (3), p.541-558

2021

Volltextzugriff (PDF)

Algorithms and Data Structures: 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011, Proceedings

1, 2011

Volltextzugriff (PDF)

Necklaces, Convolutions, and X+Y

Algorithmica, 2014, Vol.69 (2), p.294-314

2014

Volltextzugriff (PDF)

Editorial

Computational geometry : theory and applications, 2010-01, Vol.43 (1), p.1

Iacono, John

2010

Volltextzugriff (PDF)

Encoding 2D range maximum queries

Theoretical computer science, 2016-01, Vol.609, p.316-327

2016

Volltextzugriff (PDF)

Improved upper bounds for pairing heaps

Lecture notes in computer science, 2000, p.32-45

IACONO, J

2000

Volltextzugriff (PDF)

Incremental Voronoi Diagrams

Discrete & computational geometry, 2017-12, Vol.58 (4), p.822-848

2017

Volltextzugriff (PDF)

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries

ACM transactions on algorithms, 2017-05, Vol.13 (2), p.1-31

2017

Volltextzugriff (PDF)

Expected asymptotically optimal planar point location

Computational geometry : theory and applications, 2004-09, Vol.29 (1), p.19-22

Iacono, John

2004

Volltextzugriff (PDF)

Inducing the LCP-Array

Algorithms and Data Structures, p.374-385

Volltextzugriff (PDF)

A static optimality transformation with applications to planar point location

Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011, p.21-26

Iacono, John

2011

Volltextzugriff (PDF)

On the hierarchy of distribution-sensitive properties for data structures

Acta informatica, 2013-06, Vol.50 (4), p.289-295

2013

Volltextzugriff (PDF)

Efficient reconfiguration of lattice-based modular robots

Computational geometry : theory and applications, 2013-10, Vol.46 (8), p.917-928

2013

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

How fast can we play Tetris greedily with rectangular pieces?

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

Competitive Online Search Trees on Trees

Fragile complexity of adaptive algorithms

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model

Encoding nearest larger values

Subquadratic Algorithms for Algebraic 3SUM

In Pursuit of the Dynamic Optimality Conjecture

Spanning Properties of Theta–Theta-6

Worst-Case Optimal Tree Layout in External Memory

Foreword

The Power and Limitations of Static Binary Search Trees with Lazy Finger

Belga B-Trees

Algorithms and Data Structures: 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011, Proceedings

Necklaces, Convolutions, and X+Y

Editorial

Encoding 2D range maximum queries

Improved upper bounds for pairing heaps

Incremental Voronoi Diagrams

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries

Expected asymptotically optimal planar point location

Inducing the LCP-Array

A static optimality transformation with applications to planar point location

On the hierarchy of distribution-sensitive properties for data structures

Efficient reconfiguration of lattice-based modular robots

Suchergebnisse filtern