default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmalia Duch Brown
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Maria J. Serna:
A Proposal for an Educational Well-Being Index (EWI) for Undergraduate Course Design. CSEDU (2) 2024: 626-633- 2022
- [c19]Amalia Duch, Conrado Martínez:
Partial Match Queries in Quad- K-d Trees. AofA 2022: 8:1-8:16 - [c18]Amalia Duch
, Conrado Martínez, Mercè Pons, Salvador Roura:
Median and Hybrid Median K-Dimensional Trees. LATIN 2022: 38-53 - 2021
- [j10]Carme Àlvarez, Amalia Duch:
Some results of Maria Serna on strategic games: Complexity of equilibria and models. Comput. Sci. Rev. 39: 100346 (2021)
2010 – 2019
- 2019
- [c17]Amalia Duch, Daniel Lugosi, Edelmira Pasarella, Cristina Zoltan:
Dynamic Pipelining of Multidimensional Range Queries. AMW 2019 - 2018
- [c16]Amalia Duch, Gustavo Lau, Conrado Martínez:
Fixed Partial Match Queries in Quadtrees. AofA 2018: 20:1-20:18 - 2017
- [c15]Amalia Duch, Gustavo Lau:
Partial Match Queries in Relaxed K-dt trees. ANALCO 2017: 131-138 - 2016
- [j9]Amalia Duch, Gustavo Lau, Conrado Martínez:
On the Cost of Fixed Partial Match Queries in K-d Trees. Algorithmica 75(4): 684-723 (2016) - [j8]Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura:
Quad-kd trees: A general framework for kd trees and quad trees. Theor. Comput. Sci. 616: 126-140 (2016) - [j7]Carme Àlvarez, Maria J. Blesa, Amalia Duch, Arnau Messegué, Maria J. Serna:
Celebrity games. Theor. Comput. Sci. 648: 56-71 (2016) - [c14]Amalia Duch, Gustavo Lau, Conrado Martínez:
Random Partial Match in Quad-K-d Trees. LATIN 2016: 376-389 - 2015
- [c13]Amalia Duch, Joaquim Gabarró, Jordi Petit, Maria J. Blesa, Maria J. Serna:
A Cost-benefit Analysis of Continuous Assessment. CSEDU (2) 2015: 57-66 - [c12]Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Jordi Petit, Maria J. Serna:
Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio. CSEDU (Selected Papers) 2015: 313-332 - [i1]Carme Àlvarez, Maria J. Blesa, Amalia Duch, Arnau Messegué, Maria J. Serna:
Stars and Celebrities: A Network Creation Game. CoRR abs/1505.03718 (2015) - 2014
- [j6]Amalia Duch, Rosa M. Jiménez, Conrado Martínez:
Selection by rank in K-dimensional binary search trees. Random Struct. Algorithms 45(1): 14-37 (2014) - [c11]Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Maria J. Serna:
The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android. CSEDU (2) 2014: 159-166 - [c10]Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura:
Quad-K-d Trees. LATIN 2014: 743-754 - 2013
- [c9]Amalia Duch, Jordi Petit, Enric Rodríguez-Carbonell, Salvador Roura:
Fun in CS2. CSEDU 2013: 437-442 - 2011
- [j5]Carme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Joaquim Gabarró, Othon Michail, Maria J. Serna, Paul G. Spirakis:
Computational models for networks of tiny artifacts: A survey. Comput. Sci. Rev. 5(1): 7-25 (2011) - [j4]Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Hugo Hernández, Maria J. Serna:
Coaching on New Technologies: Programming Workshop Android Applications for Google Phones. Bull. EATCS 105: 205-208 (2011) - [c8]Carme Àlvarez, Amalia Duch, Maria J. Serna, Dimitrios M. Thilikos:
On the Existence of Nash Equilibria in Strategic Search Games. TGC 2011: 58-72 - 2010
- [c7]Amalia Duch, Rosa M. Jiménez, Conrado Martínez:
Rank Selection in Multidimensional Data. LATIN 2010: 674-685
2000 – 2009
- 2009
- [j3]Amalia Duch, Conrado Martínez:
Updating relaxed K-d trees. ACM Trans. Algorithms 6(1): 4:1-4:24 (2009) - [c6]Carme Àlvarez, Amalia Duch, Joaquim Gabarró, Maria J. Serna:
Sensor Field: A Computational Model. ALGOSENSORS 2009: 3-14 - 2007
- [c5]Amalia Duch, Conrado Martínez:
On the Average Cost of Insertions on Random Relaxed K-d Trees. ANALCO 2007: 194-200 - 2005
- [j2]Amalia Duch, Conrado Martínez:
Improving the performance of multidimensional search using fingers. ACM J. Exp. Algorithmics 10 (2005) - 2004
- [b1]Amalia Duch Brown:
Design and Analysis of Multidimensional Data Structures. Polytechnic University of Catalonia, Spain, 2004 - [c4]Amalia Duch:
Randomized Insertion and Deletion in Point Quad Trees. ISAAC 2004: 415-426 - [c3]Amalia Duch, Conrado Martínez:
Fingered Multidimensional Search Trees. WEA 2004: 228-242 - 2002
- [j1]Amalia Duch, Conrado Martínez:
On the average performance of orthogonal range search in multidimensional data structures. J. Algorithms 44(1): 226-245 (2002) - [c2]Amalia Duch, Conrado Martínez:
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures. ICALP 2002: 514-524
1990 – 1999
- 1998
- [c1]Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez:
Randomized K-Dimensional Binary Search Trees. ISAAC 1998: 199-208
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 01:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
