Amalia Duch Brown

Orcid: 0000-0003-4371-1286

Affiliations:
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Amalia Duch Brown authored at least 31 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Proposal for an Educational Well-Being Index (EWI) for Undergraduate Course Design.
Proceedings of the 16th International Conference on Computer Supported Education, 2024

2022
Median and Hybrid Median K-Dimensional Trees.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Partial Match Queries in Quad- K-d Trees.
Proceedings of the 33rd International Conference on Probabilistic, 2022

2021
Some results of Maria Serna on strategic games: Complexity of equilibria and models.
Comput. Sci. Rev., 2021

2019
Dynamic Pipelining of Multidimensional Range Queries.
Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, 2019

2018
Fixed Partial Match Queries in Quadtrees.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Partial Match Queries in Relaxed <i>K</i>-d<i>t</i> trees.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Quad-kd trees: A general framework for kd trees and quad trees.
Theor. Comput. Sci., 2016

Celebrity games.
Theor. Comput. Sci., 2016

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

Random Partial Match in Quad-K-d Trees.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Stars and Celebrities: A Network Creation Game.
CoRR, 2015

A Cost-benefit Analysis of Continuous Assessment.
Proceedings of the CSEDU 2015, 2015

Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio.
Proceedings of the Computer Supported Education - 7th International Conference, 2015

2014
Selection by rank in <i>K</i>-dimensional binary search trees.
Random Struct. Algorithms, 2014

Quad-K-d Trees.
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.
Proceedings of the CSEDU 2014, 2014

2013
Fun in CS2.
Proceedings of the CSEDU 2013, 2013

2011
Coaching on New Technologies: Programming Workshop Android Applications for Google Phones.
Bull. EATCS, 2011

Computational models for networks of tiny artifacts: A survey.
Comput. Sci. Rev., 2011

On the Existence of Nash Equilibria in Strategic Search Games.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

2010
Rank Selection in Multidimensional Data.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
Updating relaxed <i>K</i>-d trees.
ACM Trans. Algorithms, 2009

Sensor Field: A Computational Model.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2007
On the Average Cost of Insertions on Random Relaxed K-d Trees.
Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2005
Improving the performance of multidimensional search using fingers.
ACM J. Exp. Algorithmics, 2005

2004
Design and Analysis of Multidimensional Data Structures.
PhD thesis, 2004

Fingered Multidimensional Search Trees.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Randomized Insertion and Deletion in Point Quad Trees.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2002
On the average performance of orthogonal range search in multidimensional data structures.
J. Algorithms, 2002

1998
Randomized K-Dimensional Binary Search Trees.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998


  Loading...