Algorithms Unplugged最新文献

筛选
英文 中文
Binary Search 二分查找
Algorithms Unplugged Pub Date : 2020-07-09 DOI: 10.1007/978-3-642-15328-0_1
T. Seidl, Jost Enderle
{"title":"Binary Search","authors":"T. Seidl, Jost Enderle","doi":"10.1007/978-3-642-15328-0_1","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_1","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125599275","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}
引用次数: 10
The Knapsack Problem 背包问题
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_39
René Beier, Berthold Vöcking
{"title":"The Knapsack Problem","authors":"René Beier, Berthold Vöcking","doi":"10.1007/978-3-642-15328-0_39","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_39","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","volume":"35 18 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":"116657788","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
Eulerian Circuits 欧拉回路
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_28
Michael Behrisch, A. Coja-Oghlan, P. Liske
{"title":"Eulerian Circuits","authors":"Michael Behrisch, A. Coja-Oghlan, P. Liske","doi":"10.1007/978-3-642-15328-0_28","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_28","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","volume":"53 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":"127554330","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
Marriage Broker 婚姻介绍所
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_35
V. Claus, V. Diekert, H. Petersen
{"title":"Marriage Broker","authors":"V. Claus, V. Diekert, H. Petersen","doi":"10.1007/978-3-642-15328-0_35","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_35","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","volume":"2 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":"127962841","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
Parallel Sorting - The Need for Speed 并行排序-需要速度
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_4
R. Wanka
{"title":"Parallel Sorting - The Need for Speed","authors":"R. Wanka","doi":"10.1007/978-3-642-15328-0_4","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_4","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","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":"130131668","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 - What Is Really Relevant in the World-Wide Web? 网页排名-什么是真正相关的全球网络?
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_10
U. Brandes, Gabi Dorfmüller
{"title":"PageRank - What Is Really Relevant in the World-Wide Web?","authors":"U. Brandes, Gabi Dorfmüller","doi":"10.1007/978-3-642-15328-0_10","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_10","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","volume":"43 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":"134256297","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
Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm 搜索文本——但要快!Boyer-Moore-Horspool算法
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_6
M. Nebel
{"title":"Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm","authors":"M. Nebel","doi":"10.1007/978-3-642-15328-0_6","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_6","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","volume":"134 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":"115711250","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
Converting Numbers into English Words 将数字转换成英语单词
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_23
L. Schmitz
{"title":"Converting Numbers into English Words","authors":"L. Schmitz","doi":"10.1007/978-3-642-15328-0_23","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_23","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","volume":"3 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":"116314725","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
Online Algorithms - What Is It Worth to Know the Future? 在线算法——了解未来有什么价值?
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_37
S. Albers, Swen Schmelzer
{"title":"Online Algorithms - What Is It Worth to Know the Future?","authors":"S. Albers, Swen Schmelzer","doi":"10.1007/978-3-642-15328-0_37","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_37","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","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":"121717654","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
Winning Strategies for a Matchstick Game 火柴棍游戏的制胜策略
Algorithms Unplugged Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-15328-0_26
J. Könemann
{"title":"Winning Strategies for a Matchstick Game","authors":"J. Könemann","doi":"10.1007/978-3-642-15328-0_26","DOIUrl":"https://doi.org/10.1007/978-3-642-15328-0_26","url":null,"abstract":"","PeriodicalId":189100,"journal":{"name":"Algorithms Unplugged","volume":"23 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":"133282143","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
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学术官方微信
小红书