{"id":"https://openalex.org/W1549146562","doi":"https://doi.org/10.1007/bfb0055829","title":"On Boolean vs. Modular arithmetic for circuits and communication protocols","display_name":"On Boolean vs. Modular arithmetic for circuits and communication protocols","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1549146562","doi":"https://doi.org/10.1007/bfb0055829","mag":"1549146562"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0055829","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0055829","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/A5066480163","display_name":"Carsten Damm","orcid":"https://orcid.org/0000-0002-7653-2498"},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Carsten Damm","raw_affiliation_strings":["Department of Computer Science, University of Trier, D-54296, Trier, Germany","Dept. of Comput. Sci., Univ. of Trier, Trier, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Trier, D-54296, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Trier, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066480163"],"corresponding_institution_ids":["https://openalex.org/I89864525"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5051,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65449755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"780","last_page":"788"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","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/T12029","display_name":"DNA and Biological Computing","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8771445155143738},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6598239541053772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.610236644744873},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.589248776435852},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5565605759620667},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5425058603286743},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5207529067993164},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44763925671577454},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4385867714881897},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.42676037549972534},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.4179283380508423},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4092440903186798},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.36327996850013733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33920127153396606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31196069717407227},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0677935779094696}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8771445155143738},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6598239541053772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.610236644744873},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.589248776435852},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5565605759620667},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5425058603286743},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5207529067993164},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44763925671577454},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4385867714881897},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.42676037549972534},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.4179283380508423},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4092440903186798},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.36327996850013733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33920127153396606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31196069717407227},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0677935779094696},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bfb0055829","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0055829","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:hdl:10068/153686","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/153686","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"I - Miscellaneous"}],"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/W201553861","https://openalex.org/W256408654","https://openalex.org/W1569612250","https://openalex.org/W1649841383","https://openalex.org/W1981234161","https://openalex.org/W2018302254","https://openalex.org/W2295428206","https://openalex.org/W2405942460","https://openalex.org/W4231916799"],"related_works":["https://openalex.org/W1597080238","https://openalex.org/W2234833091","https://openalex.org/W2011469629","https://openalex.org/W2487593933","https://openalex.org/W2106622045","https://openalex.org/W2082224527","https://openalex.org/W2495817859","https://openalex.org/W2055594799","https://openalex.org/W3204916073","https://openalex.org/W3049543508"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}