发布求助
文献互助 智能选刊 最新文献

Taschenbuch der Algorithmen最新文献

筛选
英文 中文
Mehrheitsbestimmung - Wer wird Klassensprecher? 谁要成为班代表?
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_24
Thomas Erlebach
{"title":"Mehrheitsbestimmung - Wer wird Klassensprecher?","authors":"Thomas Erlebach","doi":"10.1007/978-3-540-76394-9_24","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_24","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130369535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Kürzeste Wege
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_34
P. Sanders, Johannes Singler
{"title":"Kürzeste Wege","authors":"P. Sanders, Johannes Singler","doi":"10.1007/978-3-540-76394-9_34","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_34","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131783087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Kleinster umschließender Kreis. (Ein Demokratiebeitrag aus der Schweiz?) 然后是最小的(瑞士民主活动?)
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_38
Emo Welzl
{"title":"Kleinster umschließender Kreis. (Ein Demokratiebeitrag aus der Schweiz?)","authors":"Emo Welzl","doi":"10.1007/978-3-540-76394-9_38","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_38","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125638570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multiplikation langer Zahlen (schneller als in der Schule) 相乘长期数字(比在学校时快得多)
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_11
Arno Eigenwillig, Kurt Mehlhorn
{"title":"Multiplikation langer Zahlen (schneller als in der Schule)","authors":"Arno Eigenwillig, Kurt Mehlhorn","doi":"10.1007/978-3-540-76394-9_11","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_11","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128017310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Poker per E-Mail 每封电子邮件的扑克
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_18
Detlef Sieling
{"title":"Poker per E-Mail","authors":"Detlef Sieling","doi":"10.1007/978-3-540-76394-9_18","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_18","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133538635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Broadcasting: Wie verbreite ich schnell Informationen? 我如何快速传递信息?
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_22
Christian Scheideler
{"title":"Broadcasting: Wie verbreite ich schnell Informationen?","authors":"Christian Scheideler","doi":"10.1007/978-3-540-76394-9_22","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_22","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125046368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximale Flüsse - Die ganze Stadt will zum Stadion 全市进入体育场
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_36
D. Wagner, R. Görke, Steffen Mecke
{"title":"Maximale Flüsse - Die ganze Stadt will zum Stadion","authors":"D. Wagner, R. Görke, Steffen Mecke","doi":"10.1007/978-3-540-76394-9_36","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_36","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126423955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fehlererkennende Codes: Was ist eigentlich EAN? 识别错误的代码，那是什么?
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_21
Alexander Souza, A. Steger
{"title":"Fehlererkennende Codes: Was ist eigentlich EAN?","authors":"Alexander Souza, A. Steger","doi":"10.1007/978-3-540-76394-9_21","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_21","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133239960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Gewinnstrategie für ein Streichholzspiel 火柴游戏的胜利策略
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_26
Jochen Könemann
{"title":"Gewinnstrategie für ein Streichholzspiel","authors":"Jochen Könemann","doi":"10.1007/978-3-540-76394-9_26","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_26","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134116647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Schnelle Sortieralgorithmen 快速Sortieralgorithmen
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_3
H. Alt
{"title":"Schnelle Sortieralgorithmen","authors":"H. Alt","doi":"10.1007/978-3-540-76394-9_3","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_3","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121212718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信