{"id":"https://openalex.org/W35044186","doi":"https://doi.org/10.1007/978-3-319-08404-6_1","title":"I/O-Efficient Range Minima Queries","display_name":"I/O-Efficient Range Minima Queries","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W35044186","doi":"https://doi.org/10.1007/978-3-319-08404-6_1","mag":"35044186"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-08404-6_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-08404-6_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035056543","display_name":"Peyman Afshani","orcid":"https://orcid.org/0000-0001-6102-0759"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Peyman Afshani","raw_affiliation_strings":["MADALGO, Department of Computer Science, University of Aarhus, Denmark","University of Aarhus,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computer Science, University of Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128"]},{"raw_affiliation_string":"University of Aarhus,","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015446804","display_name":"Nodari Sitchinava","orcid":"https://orcid.org/0000-0001-8876-4846"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nodari Sitchinava","raw_affiliation_strings":["Department of Information and Computer Sciences, Univ. of Hawaii \u2013 Manoa, USA","university of hawaii manoa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Sciences, Univ. of Hawaii \u2013 Manoa, USA","institution_ids":["https://openalex.org/I117965899"]},{"raw_affiliation_string":"university of hawaii manoa","institution_ids":["https://openalex.org/I117965899"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3621,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5665917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6675346493721008},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6649150252342224},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6606506109237671},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.6294992566108704},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5003836154937744},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.47752586007118225},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45736345648765564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.424790620803833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3308209478855133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30879896879196167},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14634260535240173},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06679841876029968}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6675346493721008},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6649150252342224},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6606506109237671},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.6294992566108704},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5003836154937744},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.47752586007118225},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45736345648765564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.424790620803833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3308209478855133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30879896879196167},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14634260535240173},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06679841876029968},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-08404-6_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-08404-6_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.716.480","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.716.480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.au.dk/%7Epeyman/pubdata/14AS-SWAT.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/5fea6f9e-f6fe-4f7f-90a6-4eb4777298c0","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/5fea6f9e-f6fe-4f7f-90a6-4eb4777298c0","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Afshani, P & Sitchinava, N 2014, I/O-efficient range minima queries. in R Ravi & I L G\u00f8rtz (eds), Algorithm Theory \u2013 SWAT 2014 : 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. Springer VS, Lecture Notes in Computer Science, vol. 8503, pp. 1-12, Scandinavian Symposium andWorkshop on Algorithm Theory, Copenhagen, Denmark, 02/07/2014. https://doi.org/10.1007/978-3-319-08404-6_1","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1565650557","https://openalex.org/W1574082713","https://openalex.org/W1979109797","https://openalex.org/W2005397752","https://openalex.org/W2007791040","https://openalex.org/W2038142281","https://openalex.org/W2041783148","https://openalex.org/W2052196304","https://openalex.org/W2057839002","https://openalex.org/W2095875205","https://openalex.org/W2103913570","https://openalex.org/W2105156747","https://openalex.org/W2137120608","https://openalex.org/W2218000085"],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2354676191","https://openalex.org/W3188646203","https://openalex.org/W2909957174","https://openalex.org/W4246278799","https://openalex.org/W136674370","https://openalex.org/W2105527480","https://openalex.org/W2052387497","https://openalex.org/W1983915440","https://openalex.org/W3095925971"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}