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

Taschenbuch der Algorithmen最新文献

筛选
英文 中文
Online-Algorithmen: Was ist es wert, die Zukunft zu kennen? 在线算法:了解未来的价值是什么?
Taschenbuch der Algorithmen Pub Date : 2010-10-01 DOI: 10.1007/978-3-540-76394-9_39
Susanne Albers, Swen Schmelzer
{"title":"Online-Algorithmen: Was ist es wert, die Zukunft zu kennen?","authors":"Susanne Albers, Swen Schmelzer","doi":"10.1007/978-3-540-76394-9_39","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_39","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125163313","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
Sortieren durch Einfügen 通过粘贴进行排序
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_2
W. Kowalk
{"title":"Sortieren durch Einfügen","authors":"W. Kowalk","doi":"10.1007/978-3-540-76394-9_2","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_2","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":"126144558","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
PageRank: Was ist wichtig im World Wide Web? PageRank:它是在万维网上吗?
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_10
Ulrik Brandes, G. Dorfmüller
{"title":"PageRank: Was ist wichtig im World Wide Web?","authors":"Ulrik Brandes, G. Dorfmüller","doi":"10.1007/978-3-540-76394-9_10","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_10","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"30 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":"128524165","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
Die Eulertour
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_29
Michael Behrisch, Amin Coja-Oghlan, P. Liske
{"title":"Die Eulertour","authors":"Michael Behrisch, Amin Coja-Oghlan, P. Liske","doi":"10.1007/978-3-540-76394-9_29","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_29","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"126 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":"128070640","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
Minimale aufspannende Bäume (Wenn das Naheliegende das Beste ist... ) 自由显现物
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_35
Katharina Skutella, Martin Skutella
{"title":"Minimale aufspannende Bäume (Wenn das Naheliegende das Beste ist... )","authors":"Katharina Skutella, Martin Skutella","doi":"10.1007/978-3-540-76394-9_35","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_35","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"50 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":"127941532","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
Paralleles Sortieren - Parallel geht schnell 平行又要平行
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_4
Rolf Wanka
{"title":"Paralleles Sortieren - Parallel geht schnell","authors":"Rolf Wanka","doi":"10.1007/978-3-540-76394-9_4","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_4","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"13 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":"128614712","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
Zufallszahlen: Wie kommt der Zufall in den Rechner? 机遇在里面是什么呢?
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_25
Bruno Müller-Clostermann, Tim Jonischkat
{"title":"Zufallszahlen: Wie kommt der Zufall in den Rechner?","authors":"Bruno Müller-Clostermann, Tim Jonischkat","doi":"10.1007/978-3-540-76394-9_25","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_25","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"24 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":"116974096","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
Das Sieb des Eratosthenes: Wie schnell kann man eine Primzahlentabelle berechnen? 行星的筛子:你计算一个灵长类病例要多久?
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_13
Rolf H. Möhring, Martin Oellrich
{"title":"Das Sieb des Eratosthenes: Wie schnell kann man eine Primzahlentabelle berechnen?","authors":"Rolf H. Möhring, Martin Oellrich","doi":"10.1007/978-3-540-76394-9_13","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_13","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"17 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":"127475946","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
Der One-Time-Pad-Algorithmus: Der einfachste und sicherste Verschlüsselungsalgorithmus 单一时机配对算法最简单最安全的加密算法
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_15
Till Tantau
{"title":"Der One-Time-Pad-Algorithmus: Der einfachste und sicherste Verschlüsselungsalgorithmus","authors":"Till Tantau","doi":"10.1007/978-3-540-76394-9_15","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_15","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"40 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":"115102057","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
Texte durchsuchen - aber schnell! Der Boyer-Moore-Horspool Algorithmus 搜索文本但是要快博埃尔马horspool算法
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_6
M. Nebel
{"title":"Texte durchsuchen - aber schnell! Der Boyer-Moore-Horspool Algorithmus","authors":"M. Nebel","doi":"10.1007/978-3-540-76394-9_6","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_6","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"7 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":"129924579","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学术官方微信