Amalia Duch Brown

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Some results of Maria Serna on strategic games: Complexity of equilibria and models.

[BibT_eX]

[DOI]

Carme Àlvarez

Comput. Sci. Rev., 2021

2019

Dynamic Pipelining of Multidimensional Range Queries.

[BibT_eX]

[DOI]

Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, 2019

2018

Fixed Partial Match Queries in Quadtrees.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Partial Match Queries in Relaxed K-dt trees.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

Quad-kd trees: A general framework for kd trees and quad trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Celebrity games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On the Cost of Fixed Partial Match Queries in K-d Trees.

[BibT_eX]

[DOI]

Algorithmica, 2016

Random Partial Match in Quad-K-d Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Stars and Celebrities: A Network Creation Game.

[BibT_eX]

[DOI]

CoRR, 2015

A Cost-benefit Analysis of Continuous Assessment.

[BibT_eX]

Proceedings of the CSEDU 2015, 2015

Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio.

[BibT_eX]

[DOI]

Proceedings of the Computer Supported Education - 7th International Conference, 2015

2014

Selection by rank in K-dimensional binary search trees.

[BibT_eX]

[DOI]

Rosa M. Jiménez

Random Struct. Algorithms, 2014

Quad-K-d Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android.

[BibT_eX]

[DOI]

Proceedings of the CSEDU 2014, 2014

2013

Fun in CS2.

[BibT_eX]

[DOI]

Enric Rodríguez-Carbonell

Jordi Petit

Salvador Roura

Proceedings of the CSEDU 2013, 2013

2011

Coaching on New Technologies: Programming Workshop Android Applications for Google Phones.

[BibT_eX]

[DOI]

Bull. EATCS, 2011

Computational models for networks of tiny artifacts: A survey.

[BibT_eX]

[DOI]

Carme Àlvarez

Ioannis Chatzigiannakis

Comput. Sci. Rev., 2011

On the Existence of Nash Equilibria in Strategic Search Games.

[BibT_eX]

[DOI]

Carme Àlvarez

Maria J. Serna

Dimitrios M. Thilikos

Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

2010

Rank Selection in Multidimensional Data.

[BibT_eX]

[DOI]

Rosa M. Jiménez

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Updating relaxed K-d trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Sensor Field: A Computational Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2007

On the Average Cost of Insertions on Random Relaxed K-d Trees.

[BibT_eX]

[DOI]

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2005

Improving the performance of multidimensional search using fingers.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2005

2004

Design and Analysis of Multidimensional Data Structures.

[BibT_eX]

[DOI]

Amalia Duch Brown

PhD thesis, 2004

Fingered Multidimensional Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Randomized Insertion and Deletion in Point Quad Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2002

On the average performance of orthogonal range search in multidimensional data structures.

[BibT_eX]

[DOI]

J. Algorithms, 2002

1998

Randomized K-Dimensional Binary Search Trees.

[BibT_eX]

[DOI]

Vladimir Estivill-Castro