{"id":"https://openalex.org/W1992876100","doi":"https://doi.org/10.1145/1073884.1073924","title":"Finding telescopers with minimal depth for indefinite nested sum and product expressions","display_name":"Finding telescopers with minimal depth for indefinite nested sum and product expressions","publication_year":2005,"publication_date":"2005-07-24","ids":{"openalex":"https://openalex.org/W1992876100","doi":"https://doi.org/10.1145/1073884.1073924","mag":"1992876100"},"language":"en","primary_location":{"id":"doi:10.1145/1073884.1073924","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073884.1073924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","raw_type":"proceedings-article"},"type":"article","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/A5012740956","display_name":"Carsten Schneider","orcid":"https://orcid.org/0000-0002-5703-4530"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Carsten Schneider","raw_affiliation_strings":["J. Kepler University, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"J. Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012740956"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":null,"apc_paid":null,"fwci":3.2848,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.92851975,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"285","last_page":"292"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.975600004196167,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.975600004196167,"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"}},{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.9707000255584717,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/telescoping-series","display_name":"Telescoping series","score":0.8899897336959839},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5968758463859558},{"id":"https://openalex.org/keywords/nested-set-model","display_name":"Nested set model","score":0.5963250398635864},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5007984638214111},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.4607682228088379},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4189216196537018},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35433077812194824},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.33920401334762573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33528006076812744},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33515745401382446},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.32567617297172546},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21935239434242249},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.17349502444267273},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.142797589302063},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13491734862327576}],"concepts":[{"id":"https://openalex.org/C15341905","wikidata":"https://www.wikidata.org/wiki/Q2164293","display_name":"Telescoping series","level":2,"score":0.8899897336959839},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5968758463859558},{"id":"https://openalex.org/C103000020","wikidata":"https://www.wikidata.org/wiki/Q1978426","display_name":"Nested set model","level":3,"score":0.5963250398635864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5007984638214111},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.4607682228088379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4189216196537018},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35433077812194824},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.33920401334762573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33528006076812744},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33515745401382446},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.32567617297172546},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21935239434242249},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17349502444267273},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.142797589302063},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13491734862327576},{"id":"https://openalex.org/C510870499","wikidata":"https://www.wikidata.org/wiki/Q47607","display_name":"SQL","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1073884.1073924","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073884.1073924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.133.6416","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.6416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sfb013.uni-linz.ac.at/reports/2005/pdf-files/rep_05-08_schneider.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W327567694","https://openalex.org/W1983693613","https://openalex.org/W2009471672","https://openalex.org/W2016946768","https://openalex.org/W2048214141","https://openalex.org/W2089722995","https://openalex.org/W2107194895","https://openalex.org/W2122300900","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2016946768","https://openalex.org/W4230399950","https://openalex.org/W115059224","https://openalex.org/W3010946016","https://openalex.org/W1992876100","https://openalex.org/W3010972395","https://openalex.org/W2354058820","https://openalex.org/W2017174299","https://openalex.org/W2999848603","https://openalex.org/W1902706178"],"abstract_inverted_index":{"We":[0],"provide":[1],"algorithms":[2],"that":[3],"find,":[4],"in":[5,13],"case":[6],"of":[7],"existence,":[8],"indefinite":[9],"nested":[10,24],"sum":[11],"extensions":[12],"which":[14],"a":[15],"(creative)":[16],"telescoping":[17],"solution":[18],"can":[19],"be":[20],"expressed":[21],"with":[22],"minimal":[23],"depth.":[25]},"counts_by_year":[{"year":2023,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}