{"id":"https://openalex.org/W2016946768","doi":"https://doi.org/10.1145/1005285.1005326","title":"Symbolic summation with single-nested sum extensions","display_name":"Symbolic summation with single-nested sum extensions","publication_year":2004,"publication_date":"2004-07-04","ids":{"openalex":"https://openalex.org/W2016946768","doi":"https://doi.org/10.1145/1005285.1005326","mag":"2016946768"},"language":"en","primary_location":{"id":"doi:10.1145/1005285.1005326","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1005285.1005326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 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, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"J. Kepler University Linz, 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":6.0077,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.95937997,"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":"282","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9855999946594238,"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.9855999946594238,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9635999798774719,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9553999900817871,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/telescoping-series","display_name":"Telescoping series","score":0.9413885474205017},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.7156311273574829},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6860819458961487},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.6043580770492554},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6000537872314453},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5885161757469177},{"id":"https://openalex.org/keywords/nested-set-model","display_name":"Nested set model","score":0.4571838080883026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42487800121307373},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35600578784942627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3235017657279968},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32301419973373413},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2501433491706848},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1194567084312439},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09900391101837158},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0761861503124237},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06169712543487549}],"concepts":[{"id":"https://openalex.org/C15341905","wikidata":"https://www.wikidata.org/wiki/Q2164293","display_name":"Telescoping series","level":2,"score":0.9413885474205017},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.7156311273574829},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6860819458961487},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.6043580770492554},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6000537872314453},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5885161757469177},{"id":"https://openalex.org/C103000020","wikidata":"https://www.wikidata.org/wiki/Q1978426","display_name":"Nested set model","level":3,"score":0.4571838080883026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42487800121307373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35600578784942627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3235017657279968},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32301419973373413},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2501433491706848},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1194567084312439},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09900391101837158},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0761861503124237},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06169712543487549},{"id":"https://openalex.org/C510870499","wikidata":"https://www.wikidata.org/wiki/Q47607","display_name":"SQL","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1005285.1005326","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1005285.1005326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 international symposium on Symbolic and algebraic computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.528.8118","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.528.8118","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/2004/pdf-files/rep_04-07_schneider.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.3116","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.3116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.risc.uni-linz.ac.at/publications/download/risc_194/SumExtensionExtended.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.5355","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.5355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.risc.uni-linz.ac.at/publications/download/risc_201/SUMISSAC04.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":11,"referenced_works":["https://openalex.org/W167061930","https://openalex.org/W1978059199","https://openalex.org/W1983693613","https://openalex.org/W2009471672","https://openalex.org/W2040506575","https://openalex.org/W2048214141","https://openalex.org/W2067240242","https://openalex.org/W2085350446","https://openalex.org/W2102215343","https://openalex.org/W2122300900","https://openalex.org/W4285719527"],"related_works":["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","https://openalex.org/W3008942882"],"abstract_inverted_index":{"Abstract.":[0],"We":[1],"present":[2],"a":[3,22,52,58,123],"streamlined":[4],"and":[5,39],"refined":[6,107],"version":[7],"of":[8,26,34,95],"Karr\u2019s":[9,12],"summation":[10],"algorithm.":[11],"original":[13],"approach":[14],"constructively":[15,48,116],"decides":[16],"the":[17,63,118,138],"telescoping":[18,64,120],"problem":[19,65,121],"in":[20,61,71,93,129],"\u03a0\u03a3-fields,":[21],"very":[23],"general":[24],"class":[25],"difference":[27],"fields":[28],"that":[29,73,98,133],"can":[30,46,68,114,126],"describe":[31],"rational":[32],"terms":[33,72,94],"arbitrarily":[35],"nested":[36,77,102,136],"indefinite":[37,86],"sums":[38,97],"products.":[40],"More":[41],"generally,":[42],"our":[43,106],"new":[44],"algorithm":[45,108],"decide":[47,115],"if":[49,117],"there":[50],"exists":[51],"so":[53],"called":[54],"single-nested":[55,130],"\u03a0\u03a3-extension":[56],"over":[57,88],"given":[59],"\u03a0\u03a3-field":[60],"which":[62],"for":[66,122],"f":[67,79,89],"be":[69,127],"solved":[70,128],"are":[74,99,134],"not":[75,100],"more":[76,101],"than":[78,103,137],"itself.":[80,141],"This":[81],"allows":[82],"to":[83,110],"eliminate":[84],"an":[85],"sum":[87,140],"by":[90],"expressing":[91],"it":[92,113],"additional":[96],"f.":[104],"Moreover,":[105],"contributes":[109],"definite":[111,139],"summation:":[112],"creative":[119],"fixed":[124],"order":[125],"\u03a3":[131],"\u2217-extensions":[132],"less":[135],"1.":[142]},"counts_by_year":[{"year":2023,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}