default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Salvador Roura
Polytechnic University of Catalonia, Barcelona, Spain
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2024
- Xavier Molinero, Fabián Riquelme, Salvador Roura, Maria J. Serna:
Author Correction: Multidimension: a dimensionality extension of simple games. Comput. Appl. Math. 43(4): 237 (2024) - Xavier Molinero, Fabián Riquelme, Salvador Roura, Maria J. Serna:
Correction: Multidimension: a dimensionality extension of simple games. Comput. Appl. Math. 43(5): 296 (2024) - 2023
- Xavier Molinero, Fabián Riquelme, Salvador Roura, Maria J. Serna:
Multidimension: a dimensionality extension of simple games. Comput. Appl. Math. 42(8): 339 (2023) - Xavier Molinero, Fabián Riquelme, Salvador Roura, Maria J. Serna:
On the generalized dimension and codimension of simple games. Eur. J. Oper. Res. 306(2): 927-940 (2023) - 2022
- Amalia Duch, Conrado Martínez, Mercè Pons, Salvador Roura:
Median and Hybrid Median K-Dimensional Trees. LATIN 2022: 38-53 - 2019
- Jordi Petit, Salvador Roura, Josep Carmona, Jordi Cortadella, Jordi Duch, Omer Giménez, Anaga Mani, Jan Mas, Enric Rodríguez-Carbonell, Enric Rubio, Enric de San Pedro, Divya Venkataramani:
Corrections to "Jutge.org: Characteristics and Experiences". IEEE Trans. Learn. Technol. 12(2): 290 (2019) - 2018
- Jordi Petit, Salvador Roura, Josep Carmona, Jordi Cortadella, Jordi Duch, Omer Giménez, Anaga Mani, Jan Mas, Enric Rodríguez-Carbonell, Enric Rubio, Enric de San Pedro, Divya Venkataramani:
Jutge.org: Characteristics and Experiences. IEEE Trans. Learn. Technol. 11(3): 321-333 (2018) - 2016
- 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) - 2014
- Leonor Frias, Salvador Roura:
Multikey Quickselect. Algorithmica 69(4): 958-973 (2014) - Anaga Mani, Divya Venkataramani, Jordi Petit, Salvador Roura:
Better Feedback for Educational Online Judges. CSEDU (2) 2014: 176-183 - Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura:
Quad-K-d Trees. LATIN 2014: 743-754 - 2013
- Salvador Roura:
Fibonacci BSTs: A new balancing method for binary search trees. Theor. Comput. Sci. 482: 48-59 (2013) - Amalia Duch, Jordi Petit, Enric Rodríguez-Carbonell, Salvador Roura:
Fun in CS2. CSEDU 2013: 437-442 - 2012
- Josep Freixas, Xavier Molinero, Salvador Roura:
Complete voting systems with two classes of voters: weightedness and counting. Ann. Oper. Res. 193(1): 273-289 (2012) - Jordi Petit, Omer Giménez, Salvador Roura:
Jutge.org: an educational programming judge. SIGCSE 2012: 445-450 - 2009
- Leonor Frias, Jordi Petit, Salvador Roura:
Lists revisited: Cache-conscious STL lists. ACM J. Exp. Algorithmics 14 (2009) - 2007
- Josep Freixas, Xavier Molinero, Salvador Roura:
Minimal Representations for Majority Games. CiE 2007: 297-306 - 2006
- Leonor Frias, Jordi Petit, Salvador Roura:
Lists Revisited: Cache Conscious STL Lists. WEA 2006: 121-133 - 2001
- Salvador Roura:
Improved master theorems for divide-and-conquer recurrences. J. ACM 48(2): 170-205 (2001) - Salvador Roura:
Digital Access to Comparison-Based Tree Data Structures and Algorithms. J. Algorithms 40(1): 1-23 (2001) - Conrado Martínez, Salvador Roura:
Optimal Sampling Strategies in Quicksort and Quickselect. SIAM J. Comput. 31(3): 683-705 (2001) - Salvador Roura:
A New Method for Balancing Binary Search Trees. ICALP 2001: 469-480 - 2000
- Conrado Martínez, Salvador Roura:
On the competitiveness of the move-to-front rule. Theor. Comput. Sci. 242(1-2): 313-325 (2000) - 1999
- Salvador Roura:
Improving Mergesort for Linked Lists. ESA 1999: 267-276 - 1998
- Conrado Martínez, Salvador Roura:
Randomized Binary Search Trees. J. ACM 45(2): 288-323 (1998) - Conrado Martínez, Salvador Roura:
Optimal Sampling Strategies in Quicksort. ICALP 1998: 327-338 - 1997
- Salvador Roura:
An Improved Master Theorem for Divide-and-Conquer Recurrences. ICALP 1997: 449-459 - 1996
- Salvador Roura, Conrado Martínez:
Randomization of Search Trees by Subtree Size. ESA 1996: 91-106
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-27 19:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint